Label algorithm for delay-constrained dynamic multicast routing

IEICE Transactions on Communications

Volumn E84-B, Issue 1, 2001, Pages 55-62

  Asaka, Takuya ^a   Miyoshi, Takumi ^a   Tanaka, Yoshiaki ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MULTICASTING; MULTIMEDIA SYSTEMS; TELECOMMUNICATION TRAFFIC;

MULTICAST ROUTING;

ROUTERS;

EID: 0035126416     PISSN: 09168516     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. The IP Multicast Initiative, The IP Multicast Initiative Home Page, http://www.ipmulticast.com/, Dec. 1998.
2. The MBone Information Web, Home Page, http://www. mbone.com/, Dec. 1998.
3. C. Diot, W. Dabbous, and J. Crowcroft, "Multipoint communication: A survey of protocols, functions, and mechanisms," IEEE J. Sel. Areas Commun., vol.15, no.3, pp.277-290, April 1997.
4. A. Ballardie, "Core based trees (CBT version 2) multicast routing-Protocol specification," RFC21S9, Sept. 1997.
5. D. Estrin, D. Farinacci, A. Hcliny, D. Thaler, S. Dcoring, M. Handley, V. Jacobson, C. Liu, P. Sharma, and L. Wei, "Protocol independent multicast-sparse mode (PIM-SM): Protocol specification,'' RFC23G2, June 1998.
6. [G] J. Moy, "Multicast extensions to OSPF," RFC 158-1, March 1991.
7. M. Doar and I. Leslie, "How bad is naïve multicast routing?"' IEEE INFOCOM'93, pp.82-89, March 1993.
8. B.M. Waxman, "Routing of multipoint connections," IEEE J. Sel. Areas Commun., vol.G, no.9, pp.1017-1622, Dec. 1988.
9. H. Lin and S. Lai, "VTDM-A dynamic multicast routing algorithm," IEEE INFOCOM'98, pp.l42G-1432, MarchApril 1998.
10. J. Kadirire, "Minimizing packet copies in multicast routing by exploiting geographic spread," ACM SIGCOMM Computer Communication Review, vol.24, pp.47-G3, 1994.
11. J. Kadirire, ''Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks," IEEE INFOCOM'95, pp.212-219, March 1995.
12. F. Bauer and A. Varma, "ARIES: A rearrangcable inexpensive edge-based on-line Steiner algorithm," IEEE INFOCOM'9G, PP.3G1-3G8, March 199G.
13. S. Chen and K. Nahrstedt, "An overview of quality of service routing for next-generation high-speed networks: Problems and solutions," IEEE Network, vol.12, no.G, pp.G 1-79, Nov./Dec. 1998.
14. H.F. Salama, D.S. Reeves, and Y. Viniotis, "Evaluation of multicast routing algorithms for real-time communication on high-speed networks," IEEE J. Sel. Areas Commun., vol.15, no.3, pp.332-345, March 1995.
15. R. Widoyono, "The design and evaluation of routing algorithms for real-time applications," Technical Report, ICSI TR-94-024, Univ. CA at Berkeley, June 1994.
16. Q. Zhu, M. Parsa, and J.J. Garcia-Luna-Accvcs, "A sourcebased algorithm for delay-constrained minimum-cost multicasting," IEEE INFOCOM'95, pp.377-385, March 1995.
17. S. Hong, II. Lee, and D.H. Park, "An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership," IEEE INFOCOM'98, pp.1433-1440, March/April 1998.
18. V.P. Kompella, J.C. Pasqualc, and G.G. Polyzos, "Multicasting for multimedia applications," IEEE INFOCOM'92, pp.2078-2085, April 1992.
19. S. Raghavan and G. Manimaran, "A rearrangcable algorithm for the construction of delay-constrained dynamic multicast trees," IEEE/ACM Trans. Networking, vol.7, no.4, pp.514-529, Aug. 1999.
20. M. Faloutsos, A. Banerjea, and R. Pankaj, "QoSMIC: Quality of service sensitive multicast internet protocol," ACM SIGCOMM'98, Sept. 1998.
21. L. YVei and D. Estrin, "The trade-offs of multicast trees and algorithms," ICCN'94, Sept. 1994.
22. P. Winter, "Steiner problem in networks: a survey," Networks, vol.17, pp.129-107, 1987.
23. K. Ishida and K. Amano, "On a delay-constrained leastcost path routing problem," IEICE Trans., vol.J82-B, no.5, pp.722-729, May 1999.