A new Approach to Policy-Based Routing in the Internet

Bradley R. Smith and Jose Joaquin Garcia-Luna-Aceves

Chapter Chapter 7 in Performance Evaluation and Planning Methods for the Next Generation Internet, 2005, pp 165-188 from Springer

Abstract: Abstract The current Internet routing architecture is based on a distributed, address-based, hop-by-hop routing model. In contrast, current proposals for policy-based routing are based on an on-demand, source-specified routing model. The benefits of the Internet model are that it is very robust, efficient, and responsive. However, it only supports a single forwarding class per destination. As a result, the Internet does not efficiently support quality-of-service (QoS) or traffic engineering, which are critical capabilities for the future of the Internet. In this chapter we review these previous solutions, review their limitations, and propose a new distributed policy routing model which we call distributed label-swap routing.

Keywords: Internet Service Provider; Link Weight; Traffic Class; Traffic Engineering; Maximal Subset (search for similar items in EconPapers)
Date: 2005
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:sprchp:978-0-387-25551-4_7

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

DOI: 10.1007/0-387-25551-6_7

Access Statistics for this chapter

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