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 subnetwork, 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 subnetwork 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 subnetwork 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. 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.


Existing system:

• The multicasting subnetwork messages arrived at the destinations within a specified delay bound.
• The applications also require that destinations receive the message from the source





Proposed system:
• In our proposed system, we have to determine a multicasting subnetwork with end-to-end delay bound and delay variation bounded for collaborative applications on overlay network.
• We have to overcome the Delay and Delay Variation Bounded Multicasting Network (DVBMN) problem by using heuristic chain.
• The problem of DVBMN is one of finding a subnetwork 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 underestimation delay variance.
• Heuristic Chain achieves the tightest delay variation for a given delay bound.


System Requirements

Software Requirements:-


• Language : Java 1.5 or more
• Operating System : Windows Xp


Hardware Requirements:-


• Hard disk : 80 GB
• SDRAM : 256 MB
• Processor : P IV
Processor Speed : 2.33 GHz