On path selection for traffic with bandwidth guarantees

Transmission ofmultimedia streams imposesa minimum-bandwidth requirementon the path being usedto ensureend-to-endQuality-ofService (QoS) guarantees. While any shortest-path algorithm can be used to select a feasible path, additional constraints that limit resource consumption and balance the network load are needed to achieve efficient resource utilization. We present a systematic evaluation of four routing algorithms that offer different tradeoffs between limiting the path hop count and balancing the network load. Our evaluation considers not only the call blocking rate but also the fairness to requests for different bandwidths, robustness to inaccurate routing information, and sensitivity to the routing information update frequency. Itevaluates notonly the performance of these algorithms for the sessions with bandwidth guarantees, but also their impact on the lower priority best-effort sessions. Our results show that a routing algorithm that gives preference to limiting the hop coun...

• Type: Conference
• Year: 1997
• Where: ICNP
• Authors: Qingming Ma, Peter Steenkiste
• Keywords: Computer Networks, ICNP 1997, Network Load, Routing, Routing Information