A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
An investigation of geographic mapping techniques for internet hosts
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Topology modeling via cluster graphs
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
IEEE Internet Computing
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Analyzing peer-to-peer traffic across large networks
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Building Topology-Aware Overlays Using Global Soft-State
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A Distributed Approach to Solving Overlay Mismatching Problem
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Location Awareness in Unstructured Peer-to-Peer Systems
IEEE Transactions on Parallel and Distributed Systems
Improving Unstructured Peer-to-Peer Systems by Adaptive Connection Establishment
IEEE Transactions on Computers
Dubious feedback: fair or not?
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Rumor Riding: Anonymizing Unstructured Peer-to-Peer Systems
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Optimizing overlay topology by reducing cut vertices
Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video
Dubious feedback: fair or not?
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Survey on anonymity in unstructured peer-to-peer systems
Journal of Computer Science and Technology
Receiver-oriented design of Bloom filters for data-centric routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
T2MC: a peer-to-peer mismatch reduction technique by traceroute and 2-means classification algorithm
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
A vEB-tree-based architecture for interactive video on demand services in peer-to-peer networks
Journal of Network and Computer Applications
KCube: A novel architecture for interconnection networks
Information Processing Letters
Removing uncertainties from overlay network
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Enhancing investment decisions in P2P lending: an investor composition perspective
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Cooperating with free riders in unstructured P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reducing Network Overhead with Common Junction Methodology
International Journal of Mobile Computing and Multimedia Communications
The state of peer-to-peer network simulators
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Peer-to-Peer (P2P) model, being widely adopted in today’s Internet computing, suffers from the problem of topology mismatch between the overlay networks and the underlying physical network. Traditional topology optimization techniques identify physical closer nodes to connect as overlay neighbors, but could significantly shrink the search scope. Recent efforts have been made to address the mismatch problem without sacrificing search scope, but they either need time synchronization among peers or have a low convergent speed. In this paper, we propose a scalable bipartite overlay (SBO) scheme to optimize the overlay topology by identifying and replacing the mismatched connections. In SBO, we employ an efficient strategy for distributing optimization tasks in peers with different colors. We conducted comprehensive simulations to evaluate this design. The results show that SBO achieves approximately 85% reduction on traffic cost and about 60% reduction on query response time. Our comparisons with previous approaches to address the topology mismatch problem have shown that SBO can achieve fast convergent speed without the need of time synchronization among peers.