Policy-Aware Connectionless Routing

8 years 10 months ago
Policy-Aware Connectionless Routing
The current Internet implements hop-by-hop packet forwarding based entirely on globally-unique identifiers specified in packet headers, and routing tables that identify destinations with globally unique identifiers and specify the next hops to such destinations. This model is very robust; however, it supports only a single forwarding class per destination. As a result, the Internet must rely on mechanisms working “on top” of IP to support quality-of-service (QoS) or traffic engineering (TE). We present the first policy-based connectionless routing architecture and algorithms to support QoS and TE as part of the basic networklevel service of the Internet. We show that policy-aware connectionless routing can be accomplished with roughly the same computational efficiency of the traditional single-path shortest-path routing approach.
Bradley R. Smith, J. J. Garcia-Luna-Aceves
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Authors Bradley R. Smith, J. J. Garcia-Luna-Aceves
Comments (0)