MUILTI CAST ROUTING WITH DELAY AND DELAY VARIATION CONSTRAINTS FOR COLLABORATIVE APPLICATION ON OVERLAY NETWORK

  • Type: Project
  • Department: Computer Science
  • Project ID: CPU1627
  • Access Fee: ₦5,000 ($14)
  • Pages: 45 Pages
  • Format: Microsoft Word
  • Views: 787
  • Report This work

For more Info, call us on
+234 8130 686 500
or
+234 8093 423 853
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

MUILTI CAST ROUTING WITH DELAY AND DELAY VARIATION CONSTRAINTS FOR COLLABORATIVE APPLICATION ON OVERLAY NETWORK
For more Info, call us on
+234 8130 686 500
or
+234 8093 423 853

Share This
  • Type: Project
  • Department: Computer Science
  • Project ID: CPU1627
  • Access Fee: ₦5,000 ($14)
  • Pages: 45 Pages
  • Format: Microsoft Word
  • Views: 787
Payment Instruction
Bank payment for Nigerians, Make a payment of ₦ 5,000 to

Bank GTBANK
gtbank
Account Name Obiaks Business Venture
Account Number 0211074565

Bitcoin: Make a payment of 0.0005 to

Bitcoin(Btc)

btc wallet
Copy to clipboard Copy text

500
Leave a comment...

    Details

    Type Project
    Department Computer Science
    Project ID CPU1627
    Fee ₦5,000 ($14)
    No of Pages 45 Pages
    Format Microsoft Word

    Related Works

    SOURCE CODE INCLUDED ABSTRACT In the fundamental operation in computer science, Graph algorithm is a great tool used to solve problems related to graph theory and this algorithms have wide applications in solving routing problems. For the purpose of this project four algorithms from the many types of graph algorithms were selected which are... Continue Reading
    SOURCE CODE INCLUDED ABSTRACT In the fundamental operation in computer science, Graph algorithm is a great tool used to solve problems related to graph theory and this algorithms have wide applications in solving routing problems. For the purpose of this project four algorithms from the many types of graph algorithms were selected which are... Continue Reading
    ABSTRACT This project examines the determinants of audit delay report in the 40 Nigeria listed companies and to find out the impact of selected corporate attributes, on audit delay in Nigeria. Timeliness of financial report is one of the attributes of good corporate governance identified by the... Continue Reading
    ABSTRACT This project examines the determinants of audit delay report in the 40 Nigeria listed companies and to find out the impact of selected corporate attributes, on audit delay in Nigeria. Timeliness of financial report is one of the attributes of good corporate governance identified by the... Continue Reading
    ABSTRACT Congestion and delay at the airport are used in measuring the performance indicator (PI) of an airport. One key determinant of the expected activities at a given aerodrome is the airfield component and characteristic in which the runway is of great significant.  According to ICAO Annex 14 which addresses Aerodrome, runway is defined... Continue Reading
    ABSTRACT This study examines the impact of audit delay on timeliness of financial reporting in Nigerian quoted companies. To empirically examine audit delay in Nigeria, secondary data were collected from the 2nd tier security market and some few food and leverages companies in order... Continue Reading
    CHAPTER ONE INTRODUCTION Background of the Study “Financial reporting is the manner of communicating data on the activities of the organization to the users of accounting data; and the quality of financial reporting is a feature of the excellent of... Continue Reading
    ABSTRACT Simple population growth models involving birth rate, death rate, migration, and carrying capacity of the environment were considered. Furthermore, the particular case where there is discrete delay according to the sex involved in the population growth were treated. The equilibrium and stability analysis of each of the cases were... Continue Reading
    ABSTRACT    A  powerful  and  effective  numerical  tool  called  the  Variational  Iteration Method  has  been  used  to  solve  various  kinds  of  differential  equations  over  the years. Though the Variational Iteration Method has not been used solely to solve various  kinds  of  differential  equations  as  it ... Continue Reading
    ABSTRACT    A  powerful  and  effective  numerical  tool  called  the  Variational  Iteration Method  has  been  used  to  solve  various  kinds  of  differential  equations  over  the years. Though the Variational Iteration Method has not been used solely to solve various  kinds  of  differential  equations  as  it ... Continue Reading
    Call Us
    Get this work
    whatsappWhatsApp Us