Numerical Evaluation of Hierarchical QoS Routing
Sungjoon Ahn, Gayathri Chittiappa, A. Udaya Shankar · University Libraries (University of Maryland) · 1998
We develop a numerical evaluation method for adaptive hierarchical QoS routing, and demonstrate its viability by application to two networks. Our approach models aggregation and delayed feedback in a straightforward way, and is scalable to the large networks needed to evaluate hierarchical routing. 1 Introduction Packet-switched networks in the near future are expected to support applications with a wide variety of quality-of-service (QoS) requirements, such as bounded end-to-end delay. Routing and admission control play a key role in this respect. Routing provides an end-to-end path for the application. Admission control specifies the amount of resources (bandwidth, buffers, scheduling priority, etc.) needed on the path to achieve the desired QoS. We can distinguish the following activities: ffl Router view maintanence: Each router maintains a view of the network state that is periodically refreshed by routing updates. The view may be simple and relatively static (e.g. up/down statu...