Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
نویسندگان
چکیده
منابع مشابه
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different location. With the development of Internet, Multicast is widely applied in all kinds of multimedia real-time application: distributed multimedia systems, collaborative computing, video-conferencing, distance education, etc. I...
متن کاملA GRASP heuristic for the delay-constrained multicast routing problem
The increasing development of real-time multimedia network applications, many of which require multiple participants, has created the need for efficient multicast routing algorithms. Examples of such applications include video and tele-conferencing, video-on-demand, tele-medicine, distance education, etc. Several of them require multicasting with a certain Quality of Service (QoS) with respect ...
متن کاملMAMCRA: a constrained-based multicast routing algorithm
Multicast routing algorithms that are capable of providing quality of service (QoS) to its members will play an important role in future communications networks. This paper discusses some fundamental properties of multicast routing subject to multiple QoS requirements. We will show that guaranteeing QoS and optimizing resource utilization are conflicting objectives and require a trade-off. We a...
متن کاملA Distributed Delay-Constrained Dynamic Multicast Routing Algorithm
Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a distributed delay-constrained dynamic multicast routing algorithm (DCDMR) to support these applications. DCDMR scales well because the source of the multicast tree needs only limited computation...
متن کاملPolynomial Algorithm for Bandwidth-Delay-Constrained Multicast Routing Problem
Most network-based multimedia applications require multicasting with constraints such as bandwidth and delay in order to support group communication and their quality of services (QoS). This can be considered as the problem of constructing a multicast tree with delay and bandwidth constraints over a given network topology. This paper proposes a novel algorithm to solve this problem with a small...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of Computer Networks & Communications
سال: 2010
ISSN: 0975-2293,0974-9322
DOI: 10.5121/ijcnc.2010.2212