SCALABLE AND EFFICIENT END TO END NETWORK TOPOLOGY INFERENCE

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.0INTRODUCTION
1.1STATEMENT OF PROBLEM
1.2PURPOSE OF STUDY
1.3AIMS AND OBJECTIVES
1.4SCOPE/DELIMITATIONS
1.5LIMITATIONS/CONSTRAINTS
1.6DEFINITION OF TERMS

CHAPTER TWO
2.0LITERATURE REVIEW

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

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

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

Subscribe to access this work and thousands more
Overall Rating

0

5 Star
(0)
4 Star
(0)
3 Star
(0)
2 Star
(0)
1 Star
(0)
APA

Possibility, A. (2018). SCALABLE AND EFFICIENT END TO END NETWORK TOPOLOGY INFERENCE. Afribary. Retrieved from https://afribary.com/works/scalable-and-efficient-end-to-end-network-topology-inference-5063

MLA 8th

Possibility, Aka "SCALABLE AND EFFICIENT END TO END NETWORK TOPOLOGY INFERENCE" Afribary. Afribary, 29 Jan. 2018, https://afribary.com/works/scalable-and-efficient-end-to-end-network-topology-inference-5063. Accessed 29 May. 2024.

MLA7

Possibility, Aka . "SCALABLE AND EFFICIENT END TO END NETWORK TOPOLOGY INFERENCE". Afribary, Afribary, 29 Jan. 2018. Web. 29 May. 2024. < https://afribary.com/works/scalable-and-efficient-end-to-end-network-topology-inference-5063 >.

Chicago

Possibility, Aka . "SCALABLE AND EFFICIENT END TO END NETWORK TOPOLOGY INFERENCE" Afribary (2018). Accessed May 29, 2024. https://afribary.com/works/scalable-and-efficient-end-to-end-network-topology-inference-5063

Document Details
Field: Computer Science Type: Project 35 PAGES (4166 WORDS) (rtf)