Stateless QoS routing in IP networks

QoS routing has generally been addressed in the context of reservation-based network services (e.g. ATM, IntServ), which require explicit (out of band) signaling of reservation requests and maintenance of per-flow state information. It has been recognized that the processing of per-flow state information poses scalability problems, especially at core routers. To remedy this situation, in this paper we introduce an approach for stateless QoS routing in IP networks that assumes no support for signaling or reservation from the network. Simple heuristics are proposed to identify a low-cost delay-constrained path. These heuristics essentially divide the end-to-end path into at most two "superedges" that are connected by a "relay node". Routers that lie on the same superedge use either the cost metric or the delay metric (but not both) to forward the packet. Simulations are presented to evaluate the cost performance of the proposed approach