CJM: A Technique to Reduce Network Traffic in P2P Systems

Reducing cross-network traffic in P2P systems via localized neighbor selection

2009 Fourth International Conference on Communications and Networking in China ◽

10.1109/chinacom.2009.5339819 ◽

2009 ◽

Cited By ~ 3

Author(s):

Lijie Sheng ◽

Haoyu Wen

Keyword(s):

Network Traffic ◽

P2p Systems ◽

Neighbor Selection

Download Full-text

Reducing network traffic in unstructured P2P systems using Top-k queries

Distributed and Parallel Databases ◽

10.1007/s10619-006-8313-5 ◽

2006 ◽

Vol 19 (2-3) ◽

pp. 67-86 ◽

Cited By ~ 37

Author(s):

Reza Akbarinia ◽

Esther Pacitti ◽

Patrick Valduriez

Keyword(s):

Network Traffic ◽

P2p Systems ◽

Unstructured P2p

Download Full-text

SLoPCloud: An Efficient Solution for Locality Problem in Peer-to-Peer Cloud Systems

Algorithms ◽

10.3390/a11100150 ◽

2018 ◽

Vol 11 (10) ◽

pp. 150 ◽

Cited By ~ 2

Author(s):

Mohammed Gharib ◽

Marzieh Malekimajd ◽

Ali Movaghar

Keyword(s):

Network Traffic ◽

Network Performance ◽

Overlay Networks ◽

Peer To Peer ◽

Cloud Systems ◽

P2p Systems ◽

Trip Time ◽

Computational Capability ◽

Efficient Data ◽

Overlay Graph

Peer-to-Peer (P2P) cloud systems are becoming more popular due to the high computational capability, scalability, reliability, and efficient data sharing. However, sending and receiving a massive amount of data causes huge network traffic leading to significant communication delays. In P2P systems, a considerable amount of the mentioned traffic and delay is owing to the mismatch between the physical layer and the overlay layer, which is referred to as locality problem. To achieve higher performance and consequently resilience to failures, each peer has to make connections to geographically closer peers. To the best of our knowledge, locality problem is not considered in any well known P2P cloud system. However, considering this problem could enhance the overall network performance by shortening the response time and decreasing the overall network traffic. In this paper, we propose a novel, efficient, and general solution for locality problem in P2P cloud systems considering the round-trip-time (RTT). Furthermore, we suggest a flexible topology as the overlay graph to address the locality problem more effectively. Comprehensive simulation experiments are conducted to demonstrate the applicability of the proposed algorithm in most of the well-known P2P overlay networks while not introducing any serious overhead.

Download Full-text