Cited By
View all- Shukla NDatta DPandey MSrivastava S(2021)Towards software defined low maintenance structured peer-to-peer overlaysPeer-to-Peer Networking and Applications10.1007/s12083-021-01112-7Online publication date: 11-Mar-2021
Software Defined Underlay-aware Structured Peer-to-Peer Overlay
Article No.: 52, Pages 1 - 10
Abstract
Structured Peer-to-Peer (P2P) overlay networks based on Distributed Hash Table (DHT) provide self-organization and fault tolerance along with good look-up efficiency. This makes them a perfect alternative for designing distributed applications where participating entities (peers) leave or join the system dynamically. However due to continuous churn of peers, periodic maintenance of overlay structure is required resulting in large amount of network traffic. This issue becomes more critical when logical overlay topology is different from actual physical network topology which is a common phenomenon in P2P overlay networks. In this paper, we present a novel approach of designing DHT based P2P overlays using Software Defined Networks (SDN) paradigm. SDN provides flexible ways to tune the policies and rules of underlying physical network dynamically according to the application. In our approach, we have used SDN concepts to bring the overlay topology closer to actual physical topology with an aim to reduce the maintenance traffic. We have implemented an improved SDN based DHT on a smaller scale as proof of concept. The experimental results suggest and establish the applicability of our approach.
References
[1]
2009. IEEE Standard for Local and Metropolitan Area Networks-- Station and Media Access Control Connectivity Discovery. IEEE Std 802.1AB-2009 (Revision of IEEE Std 802.1AB-2005) (Sept 2009), 1--204.
[2]
Miguel Castro, Peter Druschel, Y Charlie Hu, and Antony Rowstron. 2003. Topology-aware routing in structured peer-to-peer overlay networks. In Future directions in distributed computing. Springer, 103--107.
[3]
Manuel Costa, Miguel Castro, R Rowstron, and Peter Key. 2004. PIC: Practical Internet coordinates for distance estimation. In Distributed Computing Systems, 2004. Proceedings. 24th International Conference on. IEEE, 178--187.
[4]
Rubén Cuevas Rumín. 2010. Dynamic and location aware server discovery based on a fair distributed Hash table. (2010).
[5]
Frank Dabek, Jinyang Li, Emil Sit, James Robertson, M Frans Kaashoek, and Robert Morris. 2004. Designing a DHT for Low Latency and High Throughput. In NSDI, Vol. 4. 85--98.
[6]
Ngoc Ben Dang, Son Tung Vu, and Hoai Son Nguyen. 2009. Building a low-latency, proximity-aware DHT-based P2P network. In Knowledge and Systems Engineering, 2009. KSE'09. International Conference on. IEEE, 195--200.
[7]
Rogério Leão Santos de Oliveira, Ailton Akira Shinoda, Christiane Marie Schweitzer, and Ligia Rodrigues Prete. 2014. Using mininet for emulation and prototyping software-defined networks. In Communications and Computing (COLCOM), 2014 IEEE Colombian Conference on. IEEE, 1--6.
[8]
D Eastlake 3rd and Paul Jones. 2001. US secure hash algorithm 1 (SHA1). Technical Report.
[9]
Project Floodlight. 2017. http://www.projectfloodlight.org. (2017). {Online; accessed 24-April-2017}.
[10]
Open Networking Foundation. 2013. Software-Defined Networking:The New Norm for Networks. White Paper. (13 April 2013). https://www.opennetworking.org/sdn-resources/openflow
[11]
Satoshi Fujita. 2011. Proximity-Aware DHT for Efficient Lookup Service in Peer-to-Peer Applications. In Computational Science and Engineering (CSE), 2011 IEEE 14th International Conference on. IEEE, 464--470.
[12]
Laura Galluccio, Giacomo Morabito, Sergio Palazzo, Marco Pellegrini, M Elena Renda, and Paolo Santi. 2007. Georoy: A location-aware enhancement to Viceroy peer-to-peer algorithm. Computer Networks 51, 8 (2007), 1998--2014.
[13]
Junghee Han, David Watson, and Farnam Jahanian. 2005. Topology aware overlay networks. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, Vol. 4. IEEE, 2554--2565.
[14]
Qinlu He, Zhanhuai Li, and Xiao Zhang. 2010. Study on cloud storage system based on distributed storage systems. In Computational and Information Sciences (ICCIS), 2010 International Conference on. IEEE, 1332--1335.
[15]
Sven Kaffille and Karsten Loesing. 2007. Open chord version 1.0. 4 user's manual. Otto-Friedrich-Univ. Bamberg, Fak. Wirtschaftsinformatik und Angewandte Informatik.
[16]
David Karger, Eric Lehman, Tom Leighton, Rina Panigrahy, Matthew Levine, and Daniel Lewin. 1997. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. ACM, 654--663.
[17]
Dae-Woong Kim, Woo-Ram Park, and Chan-Ik Park. 2007. Effect of unstable routing in location-aware mobile ad hoc networks on a geographic DHT protocol. In Parallel and Distributed Systems, 2007 International Conference on, Vol. 2. IEEE, 1--8.
[18]
Minseok Kwon and Sonia Fahmy. 2002. Topology-aware overlay networks for group communication. In Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video. ACM, 127--136.
[19]
Bob Lantz, Brandon Heller, and Nick McKeown. 2010. A network in a laptop: rapid prototyping for software-defined networks. In Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks. ACM, 19.
[20]
Petar Maymounkov and David Mazieres. 2002. Kademlia: A peer-to-peer information system based on the xor metric. In International Workshop on Peer-to-Peer Systems. Springer, 53--65.
[21]
Nick McKeown. 2009. Software-defined networking. INFOCOM keynote talk 17, 2 (2009), 30--32.
[22]
Nick McKeown, Tom Anderson, Hari Balakrishnan, Guru Parulkar, Larry Peterson, Jennifer Rexford, Scott Shenker, and Jonathan Turner. 2008. OpenFlow: enabling innovation in campus networks. ACM SIGCOMM Computer Communication Review 38, 2 (2008), 69--74.
[23]
Angela Orebaugh, Gilbert Ramirez, and Jay Beale. 2006. Wireshark & Ethereal network protocol analyzer toolkit. Syngress.
[24]
Ben Pfaff, Justin Pettit, Teemu Koponen, Ethan J Jackson, Andy Zhou, Jarno Rajahalme, Jesse Gross, Alex Wang, Joe Stringer, Pravin Shelar, et al. 2015. The Design and Implementation of Open vSwitch. In NSDI. 117--130.
[25]
Peter Pietzuch, Jonathan Ledlie, Michael Mitzenmacher, and Margo Seltzer. 2006. Network-aware overlays with network coordinates. In Distributed Computing Systems Workshops, 2006. ICDCS Workshops 2006. 26th IEEE International Conference on. IEEE, 12--12.
[26]
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. 2001. A scalable content-addressable network. Vol. 31. ACM.
[27]
Sylvia Ratnasamy, Mark Handley, Richard Karp, and Scott Shenker. 2002. Topologically-aware overlay construction and server selection. In INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Vol. 3. IEEE, 1190--1199.
[28]
Maria Isabel Ribeiro. 2004. Gaussian probability density functions: Properties and error characterization. Institute for Systems and Robotics, Lisboa, Portugal (2004).
[29]
J Risson and T Moors. 2007. Survey of Research on P2P Search. RFC 4981. RFC Editor. 1--91 pages.
[30]
Antony Rowstron and Peter Druschel. 2001. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms and Open Distributed Processing. Springer, 329--350.
[31]
Chris Sanders. 2011. Practical packet analysis: Using Wireshark to solve real-world network problems. No Starch Press.
[32]
Puneet Sharma, Zhichen Xu, Sujata Banerjee, and Sung-Ju Lee. 2006. Estimating network proximity and latency. ACM SIGCOMM Computer Communication Review 36, 3 (2006), 39--50.
[33]
Haiying Shen and Cheng-Zhong Xu. 2006. Hash-based proximity clustering for load balancing in heterogeneous DHT networks. In Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International. IEEE, 10--pp.
[34]
Ion Stoica, Robert Morris, David Karger, M Frans Kaashoek, and Hari Balakrishnan. 2001. Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Computer Communication Review 31, 4 (2001), 149--160.
[35]
Paolo Trunfio, Domenico Talia, Harris Papadakis, Paraskevi Fragopoulou, Matteo Mordacchini, Mika Pennanen, Konstantin Popov, Vladimir Vlassov, and Seif Haridi. 2007. Peer-to-Peer resource discovery in Grids: Models and systems. Future Generation Computer Systems 23, 7 (2007), 864--878.
[36]
Marcel Waldvogel and Roberto Rinaldi. 2003. Efficient topology-aware overlay network. ACM SIGCOMM Computer Communication Review 33, 1 (2003), 101--106.
[37]
Weiyu Wu, Yang Chen, Xinyi Zhang, Xiaohui Shi, Lin Cong, Beixing Deng, and Xing Li. 2008. LDHT: Locality-aware distributed hash tables. In Information Networking, 2008. ICOIN 2008. International Conference on. IEEE, 1--5.
[38]
Ben Yanbin Zhao, John Kubiatowicz, Anthony D Joseph, et al. 2001. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. (2001).
[39]
Shuheng Zhou, Gregory R Ganger, and Peter Alfons Steenkiste. 2003. Location-based node ids: Enabling explicit locality in dhts. (2003).
[40]
Internet Topology Zoo. 2010. ERNET Topology. http://www.topology-zoo.org/maps/Ernet.jpg. (2010). {Online; accessed 10-Jan-2017}.
Index Terms
- Software Defined Underlay-aware Structured Peer-to-Peer Overlay
Recommendations
Optimal Resource Placement in Structured Peer-to-Peer Networks
Utilizing the skewed popularity distribution in P2P systems, common in Gnutella and KazaA like P2P applications, we propose an optimal resource (replica or link) placement strategy, which can optimally trade off the performance gain and paid cost. The ...
A Novel Hierarchical Overlay for Structured Peer-to-Peer Network
SCALCOM-EMBEDDEDCOM '09: Proceedings of the 2009 International Conference on Scalable Computing and Communications; Eighth International Conference on Embedded ComputingLarge-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Empirical studies have shown that participating nodes in P2P systems are not equivalent. Such heterogeneity has been taken into account in ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
January 2018
494 pages
ISBN:9781450363723
DOI:10.1145/3154273
Copyright © 2018 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 04 January 2018
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ICDCN '18
ICDCN '18: 19th International Conference on Distributed Computing and Networking
January 4 - 7, 2018
Varanasi, India
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 138Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 21 Jan 2025
Other Metrics
Citations
Cited By
View all- Shukla NDatta DPandey MSrivastava S(2021)Towards software defined low maintenance structured peer-to-peer overlaysPeer-to-Peer Networking and Applications10.1007/s12083-021-01112-7Online publication date: 11-Mar-2021
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in