Unicast Routing Algorithms

Carlos A. S. Oliveira () and Panos M. Pardalos ()
Additional contact information
Carlos A. S. Oliveira: Bloomberg LP
Panos M. Pardalos: University of Florida

Chapter Chapter 1 in Mathematical Aspects of Network Routing Optimization, 2011, pp 1-11 from Springer

Abstract: Abstract Routing algorithms occur in diverse forms, which depend on the specific application for which they are employed. They constitute the foundation for networking protocols in the Internet and are deployed in millions of units of networking equipment, such as the in routers used throughout the world.

Keywords: Short Path; Short Path Problem; Short Path Algorithm; Minimum Cost Path; Require Destination (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-0311-1_1

Ordering information: This item can be ordered from
http://www.springer.com/9781461403111

DOI: 10.1007/978-1-4614-0311-1_1

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().