Multicast tree rearrangement to recover node failures in overlay multicast networks

• Published in: Computers & operations research Vol. 33; no. 3; pp. 581 - 594
• Main Authors: Cho, Hee K., Lee, Chae Y.
• Format: Journal Article
• Language: English
• Published: Oxford Elsevier Ltd 01.03.2006; Elsevier Science; Pergamon Press Inc
• Subjects: Access methods and protocols, osi model; Algorithms; Applied sciences; Exact sciences and technology; Flow control; Heuristic; Integer programming; Internet Protocol; IP multicast; Lagrangean relaxation; Node failure; Operational research and scientific management; Operational research. Management science; Overlay; Reliability; Reliability theory. Replacement problems; Studies; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Lagrangean relaxation; IP multicast; Overlay; Node failure; Multicast; Integer programming; Control flow; Tree(graph); Internet protocol; Lagrange relaxation; Traffic management; Traffic congestion
• ISSN: 0305-0548; 1873-765X; 0305-0548
• DOI: 10.1016/j.cor.2004.07.018

Overlay multicast makes use of the Internet as a low level infrastructure to provide multicast service to end hosts. The strategy of overlay multicast slides over most of the basic deployment issues associated with IP multicast, such as end-to-end reliability, flow and congestion control, and assignment of an unique address for each multicasting group. Since each multicast member is responsible for forwarding multicast packets, overlay multicast protocols suffer from multicast node failures. To cope with node failures in the overlay multicast networks, the employment of multicast service nodes (MSNs) is considered which allows relatively high processing performance to cover the disconnected nodes. We are interested in minimizing the cost of both the MSNs and additional links when a node failure occurs. Overlay multicast tree rearrangement to connect multicast members is discussed and formulated as a binary integer programming problem. The tree rearrangement problem is solved by a heuristic based on the Lagrangian relaxation. The performance of the proposed algorithm is investigated by carrying out experiments in 50 and 100 node problems. The employment of MSNs is illustrated to be dependent on the end-to-end delay bound in overlay networks and the degree constraint of member nodes.