Skip to main content
Log in

Scaling Group Communication Services with Self-adaptive and Utility-driven Message Routing

Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

Group communication services typically generate large multicast data streams. Delivering such massive data streams to the end system nodes at the edge of the Internet has been a challenging problem in terms of high stress on the network links and high demand on network resources and routing node capacities. Most of existing research has been dedicated on geo-distance based routing with various optimizations to alleviate the performance impact on geo-distance based routing due to unpredictable network dynamics. Most representative techniques are targeted at reducing the delivery path length or optimizing routing path by utilizing network locality. In this paper, we identify the inefficiency of geo-distance based routing protocols in many existing multicast overlay networks in terms of both resource utilization and group communication efficiency. To address this issue, we develop a utility-based routing scheme (UDR) that can provide efficient group communication services in a decentralized geographical overlay network. Our approach makes three unique contributions. First, we introduce a utility function to refine the geo-distance based routing in such a way that the routing path selection can carefully incorporate both geo-distance based metric and the network latency. Second, we enhance our utility driven routing scheme with self-adaptive capability by considering the nodes’ state and network density. Thus, nodes in the multicast network can dynamically accommodate the changes of network conditions based solely on their local knowledge about the network. Third, we devise a suite of optimization techniques to minimize the maintenance cost and computational complexity of our self-adaptive and utility-drive routing scheme. We evaluate our approach through extensive experiments based on a realistic network topology model and show that the UDR method is highly scalable and it effectively enhances the multicast delivery efficiency for large scale group communication services compared to existing geo-distance based routing protocols.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21

References

  1. Castro M, Druschel P, Kermarrec AM, Nandi A, Rowstron A, Singh A (2003) Splitstream: high-bandwidth multicast in cooperative environments. ACM SIGOPS Oper Syst Rev 37(5):298–313

    Article  Google Scholar 

  2. Kostic D, Rodrigues A, Albrecht J, Vahdat A (2003) Bullet: high bandwidth data dissemination using an overlay mesh. In: Proceedings of the 19th ACM symposium on operating oystemsorinciples (SOSP’03), pp 282–297

  3. Banerjee S, Bhattacharjee B, Kommareddy C (2002) Scalable application layer multicast. In: Proceedings of the annual conference of the special interest group on data communication (SIGCOMM’02), pp 205–217

  4. Castro M, Druschel P, Kermarrec AM, Rowstron AIT (2002) Scribe: a large-scale and decentralized application-level multicast infrastructure. IEEE J Sel Areas Commun 20(18):1489–1499

    Article  Google Scholar 

  5. Zhang J, Liu L, Pu C, Ammar M (2004) Reliable peer-to-peer end system multicasting through replication. In: Proceedings of the 4th IEEE international conference on peer-to-peer computing (P2P’04), pp 235–242

  6. Zhang X, Liu J, Li B, Yum TSP (2005) Coolstreaming/donet: a data-driven overlay network for efficient live media streaming. In: Proceedings of the 24th annual IEEE international conference on computer communications (INFOCOM’05), pp 13–17

  7. Chu Y, Rao SG, Seshan S, Zhang H (2002) A case for end system multicast. IEEE J Sel Areas Commun 20(8):1456–1471

    Article  Google Scholar 

  8. Jannotti J, Gifford DK, Johnson KL, Kaashoek MF (2000) Overcast: reliable multicasting with on overlay network. In: Proceedings of the 4th conference on symposium on operating system design & implementation (OSDI’00), pp 14–29

  9. Castro M, Druschel P, Hu YC, Rowstron A (2003) Topology-aware routing in structured peer-to-peer overlay networks. Future directions in distributed computing, pp 103–107

  10. Venkataraman V, Yoshida K, Francis P (2006) Chunkyspread: heterogeneous unstructured tree-based peer-to-peer multicast. In: Proceedings of the 14th IEEE international conference on network protocols (ICNP’06), pp 2–11

  11. Pai V, Kumar K, Tamilmani K, Sambamurthy V, Mohr AE (2005) Chainsaw: eliminating trees from overlay multicast. In: Proceedings of the 4th international workshop on peer-to-peer systems (IPTPS’05), pp 127–140

  12. Ratnasamy S, Francis P, Handley M, Karp R, Schenker S (2001) A scalable content-addressable network. In: Proceedings of the annual conference of the special interest group on data communication (SIGCOMM’01), pp 161–172

  13. Zhang J, Zhang G, Liu L (2007) GeoGrid: a scalable location service network. In: Proceedings of the 27th IEEE international conference on distributed computing systems (ICDCS’07), pp 60–67

  14. Stoica I, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Dabek F, Balakrishnan H (2003) Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans Netw 11(1):17–32

    Article  Google Scholar 

  15. Rowstron A, Druschel P (2001) Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of IFIP/ACM international conference on distributed systems platforms (Middleware’01), pp 329–350

  16. Zhao BY, Kubiatowicz J, Joseph AD (2001) Tapestry: an infrastructure for fault-tolerant wide-area location and routing. IEEE J Sel Areas Commun 74(46):11–20

    Google Scholar 

  17. Maymounkov P, Mazieres D (2002) Kademlia: a peer-to-peer information system based on the xor metric. In: Proceedings of the 1st international workshop on peer-to-peer systems (IPTPS’02), pp 53–65

  18. Gummadi K, Gummadi R, Gribble S,Ratnasamy S, Shenker S, Stoica I (2003) The impact of DHT routing geometry on resilience and proximity. In: Proceedings of the annual conference of the special interest group on data communication (SIGCOMM’03), pp 381–394

  19. Dabek F, Li J, Sit E, Robertson J, Kaashoek MF, Morris R (2004) Designing a DHT for low latency and high throughput. In: Proceedings of the 1st symposium on networked systems design and implementation (NSDI ’04), pp 7–20

  20. Wu J, Liu B, Zhang S, Lu Z, Zhong Y (2007) KadStreaming: a novel Kademlia P2P network-based VoD streaming scheme. In: Proceeding of the 7th Iconference on computer and information technology (CIT’07), pp 405–410

  21. Castro M, Druschel P, Hu YC, Rowstron A (2002) Exploiting network proximity in peer-to-peer overlay networks. Technical report MSR-TR-2002-82

  22. Dabek F, Kaashoek MF, Karger D, Morris R, Stoica I (2001) Wide-area cooperative storage with CFS. ACM SIGOPS Oper Syst Rev 35(5):202–215

    Article  Google Scholar 

  23. Castro M, Jones MB, Kermarrec AM, Rowstron A, Theimer M, Wang H, Wolman A (2003) An evaluation of scalable application-level multicast built using peer-to-peer overlays. In: Proceedings of the 22nd annual IEEE international conference on computer communications (INFOCOM’03), pp 1510–1520

  24. Ren S, Guo L, Jiang S, Zhang X (2004) SAT-Match: a self-adaptive topology matching method to achieve low lookup latency in structured P2P overlay networks. In: Proceedings of the 18th international parallel & distributed processing symposium (IPDPS’04), pp 83–91

  25. Xu Z, Zhang Z (2002) Building low-maintenance expressways for p2p systems. Technical report HPL-2002-41

  26. Han P, Xie B, Yang F, Wang J, Shen R (2004) A novel distributed collaborative filtering algorithm and its implementation on p2p overlay network. In: Proceedings of 8th Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD’04), pp 106–115

  27. Nakao A, Peterson L, Bavier A (2003) A routing underlay for overlay networks. In: Proceedings of the annual conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM’03), pp 11–18

  28. Wang Y, Liu L, Pu C, Zhang G (2009) GeoCast: an efficient overlay system for multicast applications. Technical report GIT-CERCS-09-14

  29. Chu Y, Rao S, Seshan S, Zhang H (2001) Enabling conferencing applications on the internet using an overlay muilticast architecture. In: Proceedings of the annual conference of the special interest group on data communication (SIGCOMM’01), pp 55–67

  30. A tutorial on clustering algorithms. http://home.dei.polimi.it/matteucc/Clustering. Accessed on Aug 2009

  31. Bandyopadhyay S, Giannella C, Maulik U, Kargupta H, Liu K, Datta S (2006) Clustering distributed data streams in peer-to-peer environments. Inf Sci 14(176):1952–1985

    Article  Google Scholar 

  32. Ramaswamy L, Gedik B, Liu L (2005) A distributed approach to node clustering in decentralized peer-to-peer networks. IEEE Trans Parallel Distrib Syst 9(16):814–829

    Article  Google Scholar 

  33. Datta S, Giannella C, Kargupta H (2006) K-means clustering over a large, dynamic network. In: Proceedings of the 6th SIAM international conference on data mining (SDM’06), pp 153–164

  34. Löser A, Staab S, Tempich C (2005) Semantic methods for p2p query routing. In: Proceedings of 3rd German conference on multiagent system technologies (MATES’05), pp 15–26

  35. Rzadca K, Yong J, Datta A (2009) Multicast trees for collaborative applications. In: Proceeding of the 9th IEEE/ACM international symposium on cluster computing and the grid, pp 60–67

  36. Ren D, Li Y, Chan S (2008) On reducing mesh delay for peer-to-peer live streaming. In: Proceeding of the 27th conference on computer communications (INFOCOM’08), pp 1058–1066

Download references

Acknowledgements

The first author performed this research as a visiting PhD student at Georgia Institute of Technology. This work is partially supported by grants from NSF CISE NetSE program, NSF CISE CyberTrust program, and an IBM faculty award, an IBM SUR grant, a grant from Intel Research Council, a grant from the National 973 Program of China (Grant No. 2009CB320805), a grant from the Natural Science Foundation of China (Grant No.61073070, 61170188) and Fundamental Research Funds for the Central Universities of China.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuehua Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Y., Liu, L. & Pu, C. Scaling Group Communication Services with Self-adaptive and Utility-driven Message Routing. Mobile Netw Appl 17, 543–563 (2012). https://doi.org/10.1007/s11036-011-0348-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-011-0348-9

Keywords

Navigation