Multicast Routing with Delay and Delay- Variation Constraints for Collaborative Applications on Overlay Networks

Abstract:-
Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include video-conferencing, distributed database replication, and online games. This type of application requires a multicasting sub network, using which messages should arrive at the destinations within a specified delay bound. These applications also require that destinations receive the message from the source at approximately the same time. The problem of finding a multicasting sub network with delay and delay-variation bound has been proved to be an NP Complete problem in the literature and heuristics have been proposed for this problem. In this paper, we provide an efficient heuristic to obtain a multicast sub network on an overlay network, given a source and a set of destinations that is within a specified maximum delay and a specified maximum variation in the delays from a source to the destinations. The time-complexity of our algorithm is
O (|E|+ nk log (|E|/n) +m2k), where n and |E| are the number of nodes and edges in the network, respectively, k is the number of shortest paths determined, and m is the number of destinations. We have shown that our algorithm is significantly better in terms of time-complexity than existing algorithms for the same problem. Our extensive empirical studies indicate that our heuristic uses significantly less runtime in comparison with the best-known heuristics while achieving the tightest delay variation for a given end-to end delay bound.


Multicast Routing with Delay and Delay Variation Constraints
For Collaborative Applications on Overlay Networks


INTRODUCTION:
The Internet has made a tremendous impact on human civilization by providing global connectivity to a vast number of end users who are geographically dispersed
From each other.

It supports Multicasting is an efficient communication mechanism, where a source host sends the same message to a group of destination hosts, called the Multicasting group.

The primary advantage of using the multicast is that it conserves network bandwidth. Collaborative applications such as video conferencing, online games, interactive simulations, and distributed database replications require that messages should arrive at the destinations within a specified delay bound.


Existing System:
In this system, we have considered the problem of determining a multicasting sub network with end-to-end delay bound and delay variation bounded for collaborative applications on overlay network

The problem of this system is one of finding a sub network given a source and a set of destinations that satisfies the QoS (Quality of Service) requirements on the maximum Delay from the source to any of the destinations and on the Maximum interdestination delay variance. This system problem along with its performance evaluation. In this system delay variation between the source and destination is more.

Proposed System:
In this new System, we provide an efficient heuristic to obtain a multicast sub network on an overlay network, given a source and a set of destinations that is within a specified maximum delay and a specified maximum variation in the delays from a source to the destinations The time-complexity of our algorithm is O (|E|+ nk log (|E|/n) +m2k), We have shown that our algorithm is significantly better in terms of time-complexity than existing algorithms for the same problem. Performance analysis demonstrated that the proposed method performs very well. In this we try to construct a delay-constrained minimum cost tree


S/W Specifications

Operating System : Windows XP
Front end : JAVA
Back end : SQLITE

H/W Specification

System Processor : Pentium IV
Processor Speed : 2.80GHz