Routing by distributed recursive computation and information reuse

Distributed multimedia applications have quality-of-service (QoS) requirements specified in terms of constraints on, various metrics such as bandwidth and delay. The task of QoS routing is to find a path from the source node to the destination node with sufficient resources to support the required end-to-end QoS. We propose several distributed algorithms for the bandwidth-constrained routing and the delay-constrained routing. The algorithms are presented in the form of distributed recursive computation (DRC). DRG computes the global routing state in a distributed, recursive fashion and often leaves useful information at intermediate nodes during the process. An information-reuse scheme is studied to utilize such information in order to reduce the overall overhead. Our simulation shows that the overhead of the proposed algorithms is modest and stable.