SCALABLE AND EFFICIENT END TO END NETWORK TOPOLOGY INFERENCE

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

For more Info, call us on
+234 8130 686 500
or
+234 8093 423 853
ABSTRACT
To construct an efficient overlay network, the information of underlay is important. We consider using end-to-end measurement tools such as traceroute to infer the underlay topology among a group of hosts. Previously, Max-Delta has been proposed to infer a highly accurate topology with a low number of traceroutes. However, Max-Delta relies on a central server to collect traceroute results and to select paths for hosts to traceroute. It is not scalable to large groups. In this paper, we investigate a distributed inference scheme to support scalable inference. In our scheme, each host joins an overlay tree before conducting traceroute. A host then independently selects paths for tracerouting and exchanges traceroute results with others through the overlay tree. As a result, each host can maintain a partially discovered topology. We have studied the key issue in the scheme, that is, how a low-diameter overlay tree can be constructed. Furthermore, we propose several techniques to reduce the measurement cost for topology inference. They include 1) integrating the Doubletree algorithm into our scheme to reduce measurement redundancy, 2) setting up a lookup table for routers to reduce traceroute size, and 3) conducting topology abstraction and reducing the computational frequency to reduce the computational overhead. As compared to the naive Max-Delta, our scheme is fully distributed and scalable. The computational loads for target selection are distributed to all the hosts instead of a single server. In addition, each host only communicates with a few other hosts. The consumption of edge bandwidth at a host is hence limited. We have done simulations on Internet-like topologies and conducted measurements on PlanetLab. The results show that the constructed tree has a low diameter and can support quick data exchange between hosts. Furthermore, the proposed improvements can efficiently reduce measurement redundancy, bandwidth consumption, and computational overhead.

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

SCALABLE AND EFFICIENT END TO END NETWORK TOPOLOGY INFERENCE
For more Info, call us on
+234 8130 686 500
or
+234 8093 423 853

Share This
  • Type: Project
  • Department: Computer Science
  • Project ID: CPU1453
  • Access Fee: ₦5,000 ($14)
  • Pages: 35 Pages
  • Format: Microsoft Word
  • Views: 705
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 CPU1453
    Fee ₦5,000 ($14)
    No of Pages 35 Pages
    Format Microsoft Word

    Related Works

    ABSTRACT The Transmission Control Protocol (TCP) wad designed to provide reliable end-to-end delivery of data over unreliable networks. In practice most TCP deployments have been carefully designed in the context of wired networks. Ignoring the properties of wireless Ad hoc Network can lead to TCP implementations with poor performance. In order to... Continue Reading
    ABSTRACT The Transmission Control Protocol (TCP) wad designed to provide reliable end-to-end delivery of data over unreliable networks. In practice most TCP deployments have been carefully designed in the context of wired networks. Ignoring the properties of wireless Ad hoc Network can lead to TCP implementations with poor performance. In order to... Continue Reading
    ABSTRACT As we move past the middle of the decade, the trend continues away from host-based to client- server systems. It's no secret this operational migration has caused as many new network management problems as it has answered. Intensified requirements come from all directions: more nodes, more uptime, more communications, more... Continue Reading
    ABSTRACT As we move past the middle of the decade, the trend continues away from host-based to client- server systems. It's no secret this operational migration has caused as many new network management problems as it has answered. Intensified requirements come from all directions: more nodes, more uptime, more communications, more flexibility,... Continue Reading
    ABSTRACT A channel allocation algorithm in a cellular network consists of two parts: a channel acquisition algorithm and a channel selection algorithm. Some of the previous works in this field focused on centralized approaches to allocating channels. But, centralized approaches are neither scalable nor reliable. Recently, distributed dynamic... Continue Reading
    ABSTRACT A channel allocation algorithm in a cellular network consists of two parts: a channel acquisition algorithm and a channel selection algorithm. Some of the previous works in this field focused on centralized approaches to allocating channels. But, centralized approaches are neither scalable nor reliable. Recently, distributed dynamic... Continue Reading
    ABSTRACT The XTC ad-hoc network topology control algorithm shows three main advantages over previously proposed algorithms. First, it is extremely simple. Second, it does not assume the network graph to be a Unit Disk Graph; XTC proves correct also on general weighted network graphs. Third, the algorithm does not require availability of node... Continue Reading
    The discussion of the link between  personality types  and  strategic change by scholars today  is compounded by the  contradicting findings as how personality types influence implementation of strategic change. While some studies reveal positive correlation between personality types and the strategic change implementation initiatives, some... Continue Reading
    Health related quality of life is one of the growing subjects used for evaluating health conditions among patients who suffer from specific ailment.It has been assumed that identification of the variables is able to mirror the one's general health conditions.However,formulating the extent of contribution is multiple variable towards overall... Continue Reading
    Health related quality of life is one of the growing subjects used for evaluating health conditions among patients who suffer from specific ailment.It has been assumed that identification of the variables is able to mirror the one's general health conditions.However,formulating the extent of contribution is multiple variable towards overall health... Continue Reading
    Call Us
    Get this work
    whatsappWhatsApp Us