The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2012 vol.61)
pp: 969-985
Xiaomei Liu , Texas Commission on Environmental Quality,
Li Xiao , Michigan State University, East Lansing
Andrew Kreling , Google, Mountain View
ABSTRACT
A cut vertex is defined as a network node whose removal increases the number of network components. Failure of a cut vertex disconnects a network component and downgrades the network performance. Overlay networks are resilient to the failure of random nodes, but cut vertices that have been observed in real-world overlay traces make the network very vulnerable to well-constructed and targeted attacks. Traditional methods of detecting cut vertices are centralized and are very difficult, if not impossible, to be applied to large-scale and highly dynamic overlay networks. We aim to provide a practical solution by proposing a distributed mechanism that detects the cut vertices and neutralizes them to noncut vertices before they fail. The proposed mechanism not only minimizes the possibility of network decomposition on the cut vertex failure but also offloads the traffic that is handled by the cut vertices. We prove that our proposed method can correctly identify the cut vertices. We evaluate the performance of our design through trace-driven simulations. The results show that our method can successfully locate all cut vertices in the network and greatly offload the traffic processed by cut vertices.
INDEX TERMS
Overlay network, cut vertex, distributed method, reliability, accuracy.
CITATION
Xiaomei Liu, Li Xiao, Andrew Kreling, "A Fully Distributed Method to Detect and Reduce Cut Vertices in Large-Scale Overlay Networks", IEEE Transactions on Computers, vol.61, no. 7, pp. 969-985, July 2012, doi:10.1109/TC.2011.139
REFERENCES
[1] F. Buckley and M. Lewinter, A Friendly Introduction to Graph Theory. Prentice Hall, 2002.
[2] R. Thurimella, “Sub-Linear Distributed Algorithms for Sparse Certificates and Biconnected Components,” J. Algorithms, vol. 23, pp. 160-179, 1997.
[3] J. Cheriyan et al., “Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for K-Vertex Connectivity,” SIAM J. Computer, vol. 22, pp. 157-174, 1993.
[4] W. Hohberg, “How to Find Biconnected Components in Distributed Networks,” J. Parallel Distributed Computing, vol. 9, pp. 374-386, 1990.
[5] S.T. Huang, “A New Distributed Algorithm for the Biconnectivity Problem,” Proc. Int'l Conf. Parallel Processing, 1989.
[6] X. Liu et al., “Optimizing Overlay Topology by Reducing Cut Vertices,” Proc. Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV '06), 2006.
[7] V.N. Padmanabhan et al., “Resilient Peer-to-Peer Streaming,” Proc. IEEE 11th Int'l Conf. Network Protocols, 2003.
[8] Limeware, www.limeware.org, 2010.
[9] Y. Chu et al., “Early Experience with an Internet Broadcast System Based on Overlay Multicast,” Proc. USENIX Ann. Technical Conf., 2004.
[10] C. Rohrs, Query Routing for the Gnutella Network, http:/rfc-gnutella.sourceforge.net, 2012.
[11] S. Sen and J. Wang, “Analyzing Peer-to-Peer Traffic Across Large Networks,” IEEE/ACM Trans. Networking, vol. 12, no. 2, pp. 219-232, Apr. 2002.
[12] S. Saroiu et al., “A Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. Mutimedia Computing and Networking (MMCN), 2002.
[13] DSS Trace, http:/dss.clip2.com, 2012.
[14] P2P Traces of the Univ. of Oregon, http://mirage.cs.uoregon.edu/P2Pinfo.cgi , 2012.
[15] W. Lehr, “The Growth of Internet Overlay Networks: Implications for Architecture, Industry Structure and Policy,” Proc. Telecomm. Policy and Research Conf., 2005.
[16] P. Keyani et al., “Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems,” Proc. IFIP Workshop Web Eng. and Peer-to-Peer Computing, 2002.
[17] X. Liu et al., “Reliable Response Delivery in Peer-to-Peer Systems,” Proc. IEEE CS 12th Ann. Int'l Symp. Modeling, Analysis, and Simulation of Computer and Telecomm. Systems (MASCOTS), 2004.
[18] Y. Liu et al., “Location-Aware Topology Matching in Unstructured P2P Systems,” Proc. IEEE INFOCOM, 2004.
[19] S. Yuen and B. Li, “Strategy Proof Mechanisms for Dynamic Multicast Tree Formation in Overlay Networks,” Proc. IEEE INFOCOM, 2005.
[20] C. Abad et al., “A Survey and Comparison of End-System Overlay Multicast Solutions Suitable for Network-Centric Warfare,” Proc. SPIE, vol. 5441, pp. 215-226, 2004.
[21] G. Pandurangan et al., “Building Low-Diameter Peer-to-Peer Networks,” IEEE J. Selected Area in Comm., vol. 21, no. 6, pp. 995-1002, Aug. 2003.
[22] G. Kwon and K.D. Ryu, “BYPASS: Topology-Aware Lookup Overlay for DHT-Based P2P File Locating Services,” Proc. 10th Int'l Conf. Parallel and Distributed Systems (ICPADS '04), 2004.
[23] Y. Chawathe et al., “Making Gnutella-like P2P Systems Scalable,” Proc. SIGCOMM, 2003.
[24] L. Ramaswamy et al., “A Distributed Approach to Node Clustering in Decentralized Peer-to-Peer Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 9, pp. 814-829, Sept. 2005.
[25] S. Ratnasamy et al., “Topologically-Aware Overlay Construction and Server Selection,” Proc. IEEE INFOCOM, 2002.
[26] S. Saroiu et al., “An Analysis of Internet Content Delivery Systems,” Proc. Fifth Symp. Operating Systems Design and Implementation (OSDI '02), 2002.
[27] D. Stutzbach et al., “Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems,” Proc. Fifth ACM SIGCOMM Internet Measurement Conf. (IMC '05), pp. 49-62, 2005.
[28] KaZaA, http:/www.kazaa.com, 2012.
[29] BitTorrent, www.bittorrent.com, 2012.
[30] The Gnutella Protocol Specification 0.6, http:/rfc-gnutella. sourceforge.net , 2012.
[31] Gnutella Network Size, http://www.limewire.com/index.jspsize, 2012.
[32] K.P. Gummadi et al., “Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload,” Proc 19th ACM Symp. Operating Systems Principles (SOSP), 2003.
[33] J. Han and F. Jahanian, “Impact of Path Diversity on Multi-Homed and Overlay Networks,” Proc. Int'l Conf. Dependable Systems and Networks (DSN '04), 2004.
[34] R. Bhagwan et al., “Understand Availability,” Proc. Int'l Workshop Peer-to-Peer Systems, 2003.
[35] F.E. Bustamante and Y. Qiao, “Friendships That Last: Peer Lifespan and Its Role in P2P Protocols,” Proc. Int'l Workshop Web Content Caching and Distribution, 2003.
[36] M. Izal et al., “Dissecting BitTorrent: Five Months in a Torrent's Lifetime,” Proc. Fifth Ann. Passive and Active Measurement Workshop, 2004.
[37] J. Liang et al., “The KaZaA Overlay: A Measurement Study,” Proc. IEEE 19th Ann. Computer Comm. Workshop, 2005.
[38] J. Pouwelse et al., “The Bittorrent P2P File-Sharing System: Measurements and Analysis,” Proc. Fourth Int'l Workshop Peer-to-Peer Systems (IPTPS), 2005.
[39] D. Stutzbach and R. Rejaie, “Understanding Churn in Peer-to-Peer Networks,” Proc. Sixth ACM SIGCOMM Conf. Internet Measurement (IMC '06), 2006.
430 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool