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
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Topology modeling via cluster graphs
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
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
Analyzing peer-to-peer traffic across large networks
IEEE/ACM Transactions on Networking (TON)
An analysis of internet content delivery systems
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Improving Unstructured Peer-to-Peer Systems by Adaptive Connection Establishment
IEEE Transactions on Computers
Building a Scalable Bipartite P2P Overlay Network
IEEE Transactions on Parallel and Distributed Systems
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A Two-Hop Solution to Solving Topology Mismatch
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
In structured and unstructured Peer-to-Peer P2P systems, frequent joining and leaving of peer nodes causes topology mismatch between the P2P logical overlay network and the physical underlay network. This topology mismatch problem generates high volumes of redundant traffic in the network. This paper presents Common Junction Methodology CJM to reduce network overhead by optimize the overlay traffic at underlay level. CJM finds common junction between available paths, and traffic is only routed through the common junction and not through the conventional identified paths. CJM does not alter overlay topology and performs without affecting the search scope of the network. Simulation results show that CJM resolves the mismatch problem and significantly reduces redundant P2P traffic up to 87% in the best case for the simulated network. CJM can be implemented over structured or unstructured P2P networks, and also reduces the response time by 53% approximately for the network.