Optimal multicast routing with quality of service constraints |
| |
Authors: | Vachaspathi P Kompella Joseph C Pasquale George C Polyzos |
| |
Affiliation: | (1) Networking Systems Laboratory, IBM Corp., P.O. Box 12195, 27709 Research Triangle Park, North Carolina;(2) Computer Systems Laboratory, Department of Computer Science and Engineering, University of California, San Diego, 92093-0014 La Jolla, California |
| |
Abstract: | We consider the problem of optimal multicast routing with Quality of Service constraints motivated by the requirements of interactive continuous media communication, e.g., real-time teleconferencing. We concentrate on distributed algorithms for determining a tree over the network topology, rooted at the source and spanning the intended destinations. Quality of Service requirements for interactive continuous media typically impose constraints on some metric over the individual paths from the source to each destination, usually in the form of an upper bound on the delay. Thus, we focus on the problem of minimizing the cost of the tree while at the same time satisfying a common constraint over individual source-destination paths. We have shown that this problem is intractable, but have also devised centralized polynomial time heuristics that perform well. Here we present distributed algorithms to minimize tree cost while satisfying the constraints on the paths from the source to each destination. |
| |
Keywords: | Multipoint routing multimedia communications interactive continuous media Steiner tree |
本文献已被 SpringerLink 等数据库收录! |
|