Survivable low-cost low-delay multicast trees
Irava, V.S.; Hauser, C.
Global Telecommunications Conference, 2005. GLOBECOM apos;05. IEEE
Volume 1, Issue , 2-2 Dec. 2005 Page(s):6 pp. - 115
Digital Object Identifier   10.1109/GLOCOM.2005.1577363
Summary:The problem of finding survivable low-cost multicast trees having node-disjoint paths to destinations and satisfying delay requirements is an open area of research. Having two node-disjoint paths from the source to each destination makes a multicast tree resilient to node or edge failures. Satisfying delay requirements of the application ensures that the data delivered to the destination is fresh. Reducing the total cost of the multicast tree helps in lowering resource usage. We propose a new heuristic called dynamic weight optimal path pair (DW-OPP) for this problem. The heuristic constructs a node-disjoint low-cost multicast tree having low end-to-end delays. A user-specified parameter controls the performance of the heuristic. The parameter presents the user with a choice between lowering tree cost and achieving better delay performance. The performance of the new heuristic is evaluated empirically

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.