Download now Free registration required
Given the weighted graph G(V;E), where weights represent links' bandwidths. Authors define the Quality of Service Routing Tree (QoSRT) for G as a subgraph G0(V;E0) such that G0 is a tree, and for any pair of nodes u and v in G0 there exist a path between u and v, where all intermediate edges form a subset of E0, and the bottleneck of the path is maximized. In this paper, authors propose a distributed algorithm to construct a QoSRT that adapts quickly to changes in links' band widths. The QoSRT is uniquely constructed for maintenance purposes, so a change to a link's bandwidth is handled within the local subtree. Then authors propose both reactive and proactive routing schemes based on the QoSRT.
- Format: PDF
- Size: 194 KB