Reducing Network Overhead with Common Junction Methodology

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.

[1]  Wen-Jang Jih,et al.  Effects of Consumer-Perceived Convenience on Shopping Intention in Mobile Commerce: An Empirical study , 2007, Int. J. E Bus. Res..

[2]  Hui Zhang,et al.  A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.

[3]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[4]  David Taniar,et al.  International Journal of Mobile Computing and Multimedia Communications , 2010 .

[5]  David Taniar,et al.  Mobile Computing: Concepts, Methodologies, Tools, and Applications , 2008 .

[6]  Krishna P. Gummadi,et al.  An analysis of Internet content delivery systems , 2002, OPSR.

[7]  Li Xiao,et al.  Building a Scalable Bipartite P2P Overlay Network , 2007, IEEE Trans. Parallel Distributed Syst..

[8]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2004, IEEE/ACM Trans. Netw..

[9]  Andreas Komninos,et al.  Using Communication Frequency and Recency Context to Facilitate Mobile Contact List Retrieval , 2013, Int. J. Handheld Comput. Res..

[10]  Muneer O. Bani Yassein,et al.  An Adaptive Backoff Algorithm for Mobile Ad-Hoc Networks , 2011, Int. J. Mob. Comput. Multim. Commun..

[11]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[12]  Kamel Rouibah,et al.  Effect of Personal Innovativeness, Attachment Motivation and Social Norms on the Acceptance of Camera Mobile Phones: An Empirical Study in an Arab Country , 2011, Int. J. Handheld Comput. Res..

[13]  Li Xiao,et al.  Improving unstructured peer-to-peer systems by adaptive connection establishment , 2005, IEEE Transactions on Computers.

[14]  David Taniar.  Encyclopedia of Mobile Computing and Commerce , 2007 .

[15]  Scott Shenker,et al.  Querying the Internet with PIER , 2003, VLDB.

[16]  Gary Marsden,et al.  Using Mobile Phones and PDAs in Ad Hoc Audience Response Systems , 2009 .

[17]  Lakshminarayanan Subramanian,et al.  An investigation of geographic mapping techniques for internet hosts , 2001, SIGCOMM 2001.

[18]  Maria-Isabel Sanchez-Segura,et al.  A Framework for Information Systems Integration in Mobile Working Environments , 2007 .

[19]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[20]  Ian T. Foster,et al.  Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems , 2002, IPTPS.

[21]  Zheng Zhang,et al.  Building topology-aware overlays using global soft-state , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[22]  David Wright,et al.  Business and Technology Issues in Wireless Networking , 2007 .

[23]  Balachander Krishnamurthy,et al.  Topology modeling via cluster graphs , 2001, IMW '01.

[24]  Yunhao Liu.  A Two-Hop Solution to Solving Topology Mismatch , 2008, IEEE Transactions on Parallel and Distributed Systems.

[25]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..