Muilti Cast Routing With Delay And Delay Variation Constraints For Collaborative Application On Overlay Network

ProjectStoc - 45 pages 5248 words 1220 views Project Diploma/Degree/Masters Level Computer Science ₦3000 Naira ($7.89 USD)

This is a Premium work, paid access only

Register/Login to Access Full Work

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


TABLE OF CONTENT
TITLE PAGE
CERTIFICATION
APPROVAL
DEDICATION
ACKNOWLEDGEMENT
ABSTRACT
TABLE OF CONTENT

CHAPTER ONE
1.0 INTRODUCTION
1.1 STATEMENT OF PROBLEM
1.2 PURPOSE OF STUDY
1.3 AIMS AND OBJECTIVES
1.4 SCOPE/DELIMITATIONS
1.5 LIMITATIONS/CONSTRAINTS
1.6 DEFINITION OF TERMS

CHAPTER TWO
2.0 LITERATURE REVIEW

CHAPTER THREE
3.0 METHODS FOR FACT FINDING AND DETAILED DISCUSSIONS OF THE SYSTEM
3.1 METHODOLOGIES FOR FACT-FINDING 
3.2 DISCUSSIONS

CHAPTER FOUR
4.0 FUTURES, IMPLICATIONS AND CHALLENGES OF THE SYSTEM 
4.1 FUTURES 
4.2 IMPLICATIONS
4.3 CHALLENGES

CHAPTER FIVE
5.0 RECOMMENDATIONS, SUMMARY AND CONCLUSION
5.1 RECOMMENDATION
5.2 SUMMARY
5.3 CONCLUSION
5.4 REFERENCES

Disclaimer: Note this academic material is intended as a guide for your academic research work. Do not copy word for word. Note: For Computer or Programming related works, some works might not contain source codes

CITE THIS WORK

(2014, 08). Muilti Cast Routing With Delay And Delay Variation Constraints For Collaborative Application On Overlay Network.. ProjectStoc.com. Retrieved 08, 2014, from https://projectstoc.com/read/2819/muilti-cast-routing-with-delay-and-delay-variation-constraints-for-collaborative-application-on-overlay-network-3872
"Muilti Cast Routing With Delay And Delay Variation Constraints For Collaborative Application On Overlay Network." ProjectStoc.com. 08 2014. 2014. 08 2014 <https://projectstoc.com/read/2819/muilti-cast-routing-with-delay-and-delay-variation-constraints-for-collaborative-application-on-overlay-network-3872>.
"Muilti Cast Routing With Delay And Delay Variation Constraints For Collaborative Application On Overlay Network.." ProjectStoc.com. ProjectStoc.com, 08 2014. Web. 08 2014. <https://projectstoc.com/read/2819/muilti-cast-routing-with-delay-and-delay-variation-constraints-for-collaborative-application-on-overlay-network-3872>.
"Muilti Cast Routing With Delay And Delay Variation Constraints For Collaborative Application On Overlay Network.." ProjectStoc.com. 08, 2014. Accessed 08, 2014. https://projectstoc.com/read/2819/muilti-cast-routing-with-delay-and-delay-variation-constraints-for-collaborative-application-on-overlay-network-3872.

Connect with Us