Solve tree setup-break problem and minimize control overhead in delay-bounded distributed wireless multicast QoS routing

Authors:
Ying-Hsin Liang;Ben-Jye Chang;Yan-Min Lin
Affiliations:
Nan Kai University of Technology, Taiwan;National Yunlin University of Science and Technology, Taiwan;National Chung-Cheng University, Taiwan
Venue:
Proceedings of the Nineteenth International Workshop on Quality of Service
Year:
2011

Citing 12
Cited 0

Steiner problem in networks: a survey

Networks
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Distributed algorithms for multicast path setup in data networks

IEEE/ACM Transactions on Networking (TON)
A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks

IEEE/ACM Transactions on Networking (TON)
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to Algorithms

Introduction to Algorithms
A source-based algorithm for delay-constrained minimum-cost multicasting

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Comments and an improvement on "A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks"

IEEE/ACM Transactions on Networking (TON)
A Service-Centric Multicast Architecture and Routing Protocol

IEEE Transactions on Parallel and Distributed Systems
Research on multicast routing protocols for mobile ad-hoc networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient mobile multicast mechanism for fast handovers: A study from design and implementation in experimental networks

Computer Communications
Large-scale cooperative caching and application-level multicast in multimedia content delivery networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

In wireless networks, the multicast QoS routing is a key technique to increase bandwidth utilization, but the multicast routing is typically complicated and difficult because it belongs to the NP-complete problem. The main goal of a delay-bounded wireless multicast algorithm is to determine the optimal multicast tree that has the least cost while satisfying the delay-bounded requirement. However, previous studies suffer from the Tree setup-break and dangling node problems, and yield a large number of control messages. This paper thus proposes the adaptive distributed multicast routing (ADMR) algorithm to guarantee cycle-free, and to overcome these two problems while yielding the least-cost delay-bounded multicast tree for high-density member multicast networks. Numerical results indicate that ADMR significantly outperforms the Jia-based algorithms in number of control messages and setup convergent time.