Loop-free multicast routing with end-to-end delay constraint

1999 ◽  
Vol 22 (2) ◽  
pp. 181-192 ◽  
Author(s):  
Chor Ping Low
Author(s):  
D. Chakraborty ◽  
G. Chakraborty ◽  
N. Shiratori

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.


1996 ◽  
Vol 07 (05) ◽  
pp. 617-626 ◽  
Author(s):  
THOMAS L. HEMMINGER ◽  
CARLOS A. POMALAZA-RAEZ

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.


2018 ◽  
Vol 7 (S1) ◽  
pp. 123-129
Author(s):  
K. Kavitha

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.


Author(s):  
D. Chakraborty ◽  
G. Chakraborty ◽  
N. Shiratori

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