Reducing Network Overhead with Common Junction Methodology

Reducing Network Overhead with Common Junction Methodology

Shashi Bhushan (Haryana Engineering College Jagadhri, India), Mayank Dave (National Institute of Technology Kurukshetra, India) and R.B. Patel (DCRUST Murthal, India)
DOI: 10.4018/978-1-4666-2163-3.ch013
OnDemand PDF Download:
List Price: $37.50


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.
Chapter Preview

There are several traditional topology optimization approaches. The end system multicast is used in NARADA (Chu et al., 2000). NARADA first constructs a rich connected graph on which it further constructs shortest path spanning trees. Each tree rooted at the corresponding source uses well-known routing algorithms (Chu et al., 2000). This approach introduces large overhead of forming the graph and trees in a large scope, and does not consider the dynamic joining and leaving characteristics of peers. The overhead of NARADA is proportional to the multicast group size. Further this approach is impractical in large-scale P2P systems.

Researchers have also considered clustering of closely located peers based on their IP addresses (Krishnamurthy et al., 2001; Padmanabhan et al., 2001). In this approach there are two limitations- (a) mapping accuracy is not guaranteed and (b) searching scope is affected with increase in volume of traffic in P2P networks.

Complete Chapter List

Search this Book: