Message bundling on structured overlays

A structured overlay running as the base of a DHT or ALM occasionally receives a large number of messages collectively. Those cases are opportunities for an overlay to bundle multiple different messages into a single message and achieve extraordinarily effective message deliveries. Such message bundling reduces the number packet transmissions on an underlay network such as an IP network. This paper presents Collective Forwarding, a message bundling technique for structured overlays. The technique not only reduces the number of packet transmissions but also improves throughput of message forwarding. In experiments, the number of packet transmissions and the time to get items were reduced to 12% and 9.7% respectively at best. Theoretical analysis matches and then supports the experimental results.

[1]  Kazuyuki Shudo,et al.  Overlay Weaver: An overlay construction toolkit , 2008, Computer Communications.

[2]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[3]  Ben Y. Zhao,et al.  Towards a Common API for Structured Peer-to-Peer Overlays , 2003, IPTPS.

[4]  Kensuke Fukuda,et al.  MARIF: Multiple Queries Look-Up Architecture Using Range Information Feedback in a DHT Network , 2013, IEICE transactions on communications.

[5]  Guy Pujolle,et al.  Improving Network I/O Virtualization for Cloud Computing , 2014, IEEE Transactions on Parallel and Distributed Systems.

[6]  Krishna P. Gummadi,et al.  The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.

[7]  Miguel Castro,et al.  Scribe: a large-scale and decentralized application-level multicast infrastructure , 2002, IEEE J. Sel. Areas Commun..

[8]  Indranil Gupta,et al.  Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead , 2003, IPTPS.

[9]  Florian Schintke,et al.  Range queries on structured overlay networks , 2008, Comput. Commun..

[10]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[11]  Kazuyuki Shudo,et al.  FRT-2-Chord: A DHT supporting seamless transition between one-hop and multi-hop lookups with symmetric Routing Table , 2014, The International Conference on Information Networking 2014 (ICOIN2014).

[12]  David R. Karger,et al.  Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.

[13]  Kensuke Fukuda,et al.  Efficient query bundling mechanism in a DHT network , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[14]  David Simplot-Ryl,et al.  DHT-based distributed ALE engine in RFID middleware , 2011, 2011 IEEE International Conference on RFID-Technologies and Applications.

[15]  Bo Li,et al.  CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  首藤 一幸.  Collective Forwarding on Structured Overlays , 2009 .

[17]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

[18]  Anjali Gupta,et al.  Efficient Routing for Peer-to-Peer Overlays , 2004, NSDI.

[19]  Wolf-Bastian Pöttner,et al.  Opportunistic Data Aggregation in Delay Tolerant Networks , 2015 .

[20]  Daniel Massey,et al.  A Comparative Study of the DNS Design with DHT-Based Alternatives , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[21]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1999, Theory of Computing Systems.

[22]  Yusuke Doi,et al.  A Design for Distributed Backup and Migration of Distributed Hash Tables , 2008, 2008 International Symposium on Applications and the Internet.

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

[24]  Deborah Estrin,et al.  Building efficient wireless sensor networks with low-level naming , 2001, SOSP.

[25]  Kazuyuki Shudo,et al.  Flexible routing tables: Designing routing algorithms for overlays based on a total order on a routing table set , 2011, 2011 IEEE International Conference on Peer-to-Peer Computing.

[26]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[27]  Kazuyuki Shudo,et al.  A method for designing proximity-aware routing algorithms for structured overlays , 2013, 2013 IEEE Symposium on Computers and Communications (ISCC).

[28]  Vinay S. Pai,et al.  Chainsaw: Eliminating Trees from Overlay Multicast , 2005, IPTPS.

[29]  Miguel Castro,et al.  SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.

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

[31]  Yusuke Doi,et al.  On Scalability of DHT-DNS Hybrid Naming System , 2006, AINTEC.