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

Maximum variation in the delays from a source to the destinations. The time-complexity of our Algorithm is O (|E| +nk log (|E|/n) +m2 k), where n and |E| are the number of nodes and edges in the network, respectively, k is the Number of shortest paths determined, and 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 specifiedm 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-toend delay bound.

HARDWARE SPECIFICATION
Processor : Any Processor above 500 Mhz.
Ram : 128Mb.
Hard Disk : 10 Gb.
Compact Disk : 650 Mb.
Input device : Standard Keyboard and Mouse.
Output device : VGA and High Resolution Monitor.
SOFTWARE SPECIFICATION
Operating System : Windows 2000 server Family.
Techniques : JDK 1.5
Data Bases : Microsoft Sql Server
Front End : Java Swing

hi can u send me ppt of the above project title and its document

Multicast Routing with Delay and Delay Variation Constraints for Collaborative Applications on Overlay Networks
Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispersed. video-conferencing, distributed database replication, and online games etc are examples of such applications. a multicasting subnetwork is required by such applications , using which messages should arrive at the destinations within a specified delay bound. It is also mandatory 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. an efficient heuristic to obtain a multicast subnetwork on an overlay network when the 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 is given is proposed in this paper.

for downloading the paper, visit:
http://computerportal/web/csdl/doi?doc=doi/10.1109/TPDS.2007.45

you can use your institution's subscription to download it or you may approach your friends