Constraint-based routing in the internet: Basic principles and recent research
Policy-based routing
Equal-cost multi-path routing
Multipath routing
Routing domain
DOI:
10.1109/comst.2003.5342226
Publication Date:
2009-12-08T19:38:50Z
AUTHORS (2)
ABSTRACT
Novel routing paradigms based on policies, quality of service (QoS) requirements, and packet content have been proposed for the Internet over last decade. Constraint-based algorithms select a path satisfying constraints that are either administrative-oriented (policy routing) or service-oriented (QoS routing). The routes, in addition to constraints, selected reduce costs, balance network load, increase security. In this article, we discuss several constraint-based approaches explain their complexity, recent research proposals. addition, illustrate how these can be integrated with label switching QoS architectures. We also examples application-level techniques used today's Internet.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (66)
CITATIONS (76)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....