Q. Sun and H. Langendorfer, "A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm," in European Workshop on Interactive Dist. Multimedia Sys. and Telecomm. Services, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
New Algorithms for Multicast Routing in Real Time Networks - Mokbel (1999) (Correct)
....WAVE had some drawbacks in that the number of responses could be very large and that any node wished to join the group should contact the source node and this may make a traffic concentration around the source node. WAVE was only evaluated in comparison of static algorithms. Sun and Langendorefer [35] had proposed a distributed algorithm for delay constrained dynamic multicast routing problem. In their algorithm, they had defined two modes for running the algorithm; a FAST mode to make route computation very fast and a SLOW mode to get low cost tree. Finally, Goel and Munagala [36] had ....
Q. Sun and H. Langendoerfer, "A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm", in Proceedings of European Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services (IDMS'97) Vol. 1309, pp.97-106, 1997
A Delay-Constrained Protocol for Shared Multicast Tree.. - Bettahar, Bouabdallah (Correct)
....problem has been widely studied but most of presented works deal with source based trees. Constructing delay constrained multicast source based trees with minimum cost was proved to be NP complete [7] Several heuristics were proposed to approach the minimum solution for this problem [8] 11] 10] [13]. Constructing delay constrained multicast shared trees with minimum cost was also proved to be NP complete [12] but fewer heuristics were proposed for this. In [12] the author proposed a routing algorithm as well as three heuristics for core selection to construct DCMST. Most of the above ....
Q. Sun and H. Langendorfer. A distributed delayConstrained Dynamic Multicast Routing Algorithm. European Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services (IDMS'97) , Lecture Notes in Computer Sciences, 1309:97--106, 1997.
Alternate Path Routing for Multicast - Zappala (2000) (18 citations) (Correct)
....Due to this high overhead, the link state approach does not scale well to large networks or large numbers of highly dynamic groups. Newer research has focused on distributed protocols that search a portion of the network for a feasible path, subject to delay and bandwidth constraints [7] 8] [9]. While this work is promising, it relies on message passing and a decision criteria that requires universal deployment in order to be effective. Our emphasis in this work is to serve all applications, not just those that need a QoS guarantee, and to use a more general approach, in which path ....
Q. Sun and H. Langendorfer, "A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm," in European Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services (IDMS'97), 1997.
Alternate Path Routing for Multicast - Daniel Zappala Member (2000) (18 citations) (Correct)
No context found.
Q. Sun and H. Langendorfer, "A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm," in European Workshop on Interactive Dist. Multimedia Sys. and Telecomm. Services, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC