scholarly journals Multicast routing with end-to-end delay and delay variation constraints

1997 ◽  
Vol 15 (3) ◽  
pp. 346-356 ◽  
Author(s):  
G.N. Rouskas ◽  
I. Baldine
Keyword(s):  
Multicast Routing ◽  
End To End Delay ◽  
End To End ◽  
Delay Variation

Multicast Routing Protocols, Algorithms and its QOS Extensions

2005 ◽  
pp. 2036-2041
Author(s):  
D. Chakraborty ◽  
G. Chakraborty ◽  
N. Shiratori
Keyword(s):  
Data Storage ◽  
High Speed ◽  
Multicast Routing ◽  
Multicast Communication ◽  
Delay Jitter ◽  
End To End Delay ◽  
End To End ◽  
Storage Technologies ◽  
New Applications ◽  
Audio Video

The advancement in optical fiber and switching technologies has resulted in a new generation of high-speed networks that can achieve speeds of up to a few gigabits per second. Also, the progress in audio, video and data storage technologies has given rise to new distributed real-time applications. These applications may involve multimedia, which require low end-to-end delay. The applications’ requirements, such as the end-to-end delay, delay jitter, and loss rate, are expressed as QoS parameters, which must be guaranteed. In addition, many of these new applications involve multiple users, and hence the importance of multicast communication. Multimedia applications are becoming increasingly important, as networks are now capable of carrying continuous media traffic, such as voice and video, to the end user. When there is a lot of information to transmit to a subset of hosts, then multicast is the best possible way to facilitate it. This article addresses different multicast routing algorithms and protocols. We have also discussed about the QoS multicast routing and conclude this article with mobile multicasting.

USING NEURAL NETWORKS TO SOLVE THE MULTICAST ROUTING PROBLEM IN PACKET RADIO NETWORKS

1996 ◽  
Vol 07 (05) ◽  
pp. 617-626 ◽  
Author(s):  
THOMAS L. HEMMINGER ◽  
CARLOS A. POMALAZA-RAEZ
Keyword(s):  
Multicast Routing ◽  
Optimal Solution ◽  
Packet Delay ◽  
Hopfield Neural Network ◽  
Routing Problem ◽  
Packet Radio ◽  
Packet Radio Network ◽  
End To End Delay ◽  
Packet Delays ◽  
End To End

The primary function of a packet radio network is the efficient transfer of information between source and destination nodes using minimal bandwidth and end-to-end delay. Many researchers have investigated the problem of minimizing the end-to-end delay from a single source to a single destination for a variety of networks; however, very little work is reported about routing mechanisms for the common case where a particular information packet is intended to be sent to more than one destination in the network. This is known as multicasting. A simplified version of the problem is to ignore the packet delay at each node, then the problem becomes one of finding solutions which require the least number of transmissions. Determination of an optimal solution is NP-complete meaning that suboptimal solutions are frequently tolerated. The problem becomes more rigorous if packet delays are included in the network topology. This paper describes a practical technique for the computation of optimum or near optimum solutions to the multicasting problem with and without packet delay. The method is based on the Hopfield neural network and experiment has shown this method to yield near optimal solutions while requiring a minimum of CPU time.

scholarly journals An Efficient Algorithm for Delay and Delay- Variation Bounded Core Based Tree Generation

2010 ◽  
pp. 202-207
Author(s):  
Manoj Kumar Patel ◽  
MANAS RANJAN KABAT ◽  
Chita Ranjan Tripathy
Keyword(s):  
Upper Bound ◽  
Heuristic Algorithms ◽  
Multicast Tree ◽  
End To End Delay ◽  
Tree Generation ◽  
Core Selection ◽  
End To End ◽  
Better Than ◽  
Delay Variation

Many multimedia group applications require the construction of multicast tree satisfying the quality of service (QoS) requirements. To support real time communication, computer networks need to optimize the Delay and Delay-Variation Bounded Multicast Tree (DVBMT). The problem is to satisfy the end-to-end delay and delay-variation within an upper bound. The DVBMT problem is known to be NP complete. In this paper, we propose an efficient core selection algorithm for satisfying the end-to-end delay and delay-variation within an upper bound. The efficiency of the proposed algorithm is validated through the simulation. The simulation results reveal that our algorithm performs better than the existing heuristic algorithms.

scholarly journals Comparative Performance Evaluation of On-Demand Multicast Routing Protocols for MANET

2018 ◽  
Vol 7 (S1) ◽  
pp. 123-129
Author(s):  
K. Kavitha
Keyword(s):  
Routing Protocol ◽  
Multicast Routing ◽  
High Mobility ◽  
On Demand ◽  
Control Overhead ◽  
End To End Delay ◽  
Multicast Routing Protocol ◽  
Membership Management ◽  
End To End ◽  
And Control

A Mobile Ad hoc NETwork (MANET) is a collection of wireless nodes communicating with each other in the absence of any infrastructure. Each device in a MANET is free to move independently in any direction, and will therefore change its links to other devices frequently. Each must forward traffic unrelated to its own use, and therefore be a router. The primary challenge in building a MANET is equipping each device to continuously maintain the information required to properly route traffic. Such networks may operate by themselves or may be connected to the larger Internet. In this paper, we compare the performance of On-Demand Multicast Routing Protocol (ODMRP), Adaptive demand driven Multicast Routing Protocol (ADMR) With Efficient Geographic Multicast Routing Protocol (EGMP) under different mobility models such as Random Way Point Model, Manhattan Model and Random Drunken Model. Using these models, performance metrics such as Packet Delivery Ratio, End-to-End Delay and Control Overhead are evaluated. ODMRP dynamically builds the route and manages the group membership. In ADMR, Multicast routing state is dynamically established and maintained only for active groups and only in nodes located between multicast senders and receivers. ADMR detects the high mobility without the use of GPS or other positioning system. EGMP supports a zone-based scheme to efficiently handle the two-tier membership management, and takes advantage of the membership management structure to efficiently track the locations of all the group members. The simulation result shows that the throughput of ADMR is higher than that of ODMRP and EGMP at high mobility and EGMP is high at low mobility. End to end delay and control overhead of EGMP is higher than that of ODMRP and ADMR.

Multicast

2002 ◽  
pp. 225-245
Author(s):  
D. Chakraborty ◽  
G. Chakraborty ◽  
N. Shiratori
Keyword(s):  
Data Storage ◽  
High Speed ◽  
Multicast Routing ◽  
Multicast Communication ◽  
Delay Jitter ◽  
End To End Delay ◽  
End To End ◽  
Storage Technologies ◽  
New Applications ◽  
Audio Video

The advancement in optical fiber and switching technologies has resulted in new generation high-speed networks that can achieve speeds of up to a few gigabits per second. Also, the progress in audio, video and data storage technologies has given rise to new distributed real-time applications. These applications may involve multimedia, which require low end-to-end delay. The applications’ requirements, such as the end-to-end delay, delay jitter, and loss rate, are expressed as QoS parameters that must be guaranteed. In addition, many of these new applications may involve multiple users, and hence the importance of multicast communication. In this chapter we discuss the basics of multicasting, its routing protocols and algorithms, along with different QoS-based multicast routing.

Sign in / Sign up

Export Citation Format

Share Document