Advertisement

A Flexible Concast-Based Grouping Service

  • Amit Sehgal
  • Kenneth L. Calvert
  • James Griffioen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2546)

Abstract

We present a scalable and flexible grouping service based on concast and best-effort single-source multicast. The service assigns participating end systems to specific groups based on application-supplied criteria. Example uses of such a service include peer-to-peer applications that want to group machines that are “near” each other, and reliable multicast services that need to assign receivers to repair groups. Our generic grouping framework relies on concast’s many-to-one transport service to efficiently collect and apply the applicationspecific grouping criteria to the group members’ information, and it relies on single-source multicast (i.e., one-to-many communication) to distribute the results to the nodes being grouped. The service can easily be customized to meet the grouping requirements of the application. We present simulation data showing the convergence properties of our grouping service and its effectiveness when applied to the problem of constructing overlay networks.

Keywords

Overlay Network Bloom Filter Incoming Packet Membership Query Representative Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    Sneha Kumar Kasera, Supratik Bhattacharyya, Mark Keaton, Diane Kiwior, Jim Kurose, Don Towsley, and Steve Zabele. Scalable Fair Reliable Multicast Using Active Services. IEEE Network Magazine, February 2000.Google Scholar
  2. [2]
    R. Yavatkar, J. Griffioen, and M. Sudan. A Reliable Dissemination Protocol for Interactive Collaborative Applications. In The Proceedings of the ACM Multimedia’ 95 Conference, pages 333–344, November 1995.Google Scholar
  3. [3]
    Billy C. Mullins Amit Sehgal Kenneth L. Calvert, James Griffioen and Su Wen. Concast: Design and implementaion of an active network service. IEEE Journal on Selected Areas in Communications (2001), pages 19(3):426–437, March 2001.CrossRefGoogle Scholar
  4. [4]
    D. Katz. IP Router Alert Option, February 1997. RFC 2113.Google Scholar
  5. [5]
    Burton Bloom. Space time tradeoffs in hash coding with allowable errors. Communications of the ACM, pages 13(7):422–426, July 1970.zbMATHCrossRefGoogle Scholar
  6. [6]
    Sylvia Ratnasamy and Steven McCanne. Inference of Multicast Routing Trees and Bottleneck Bandwidths using End-to-end Measurements. In the Proceedings of the 1999 INFOCOM Conference, March 1999.Google Scholar
  7. [7]
    Sylvia Ratnasamy and Steven McCanne. Scaling End-to-end Multicast Transports with a Topologically-sensitive Group Formation Protocol. In the Proceedings of the International Conference on Network Protocols (ICNP’ 99), November 1999.Google Scholar
  8. [8]
    I. Kouvelas, V. Hardman, and J. Crowcroft. Network Adaptive Continuous-Media Applications Through Self Organised Transcoding. In the Proceedings of the Network and Operating Systems Support for Digital Audio and Video Conference (NOSSDAV 98), July 1998.Google Scholar
  9. [9]
    Clip2.com. The gnutella protocol specification ver 0.4, 2000. http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf.
  10. [10]
    M. Handley R. Karp S. Shenker S. Ratnasamy, P. Francis. A scalable content addressable network. In in Proceedings of ACM Sigcomm’ 01 Conference, August 2001.Google Scholar
  11. [11]
    D. Karger F. Kasshoek I Stoica, R. Morris and H. Balakrishnan. Chord: A scalable peerto-peer lookup sevice for internet applications. In in Proceedings of ACM Sigcomm’ 01 Conference, August 2001.Google Scholar
  12. [12]
    Kenneth L. Calvert, Matthew B. Doar, and Ellen W. Zegura. Modeling Internet Topology. IEEE Communications Magazine, June 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Amit Sehgal
    • 1
  • Kenneth L. Calvert
    • 1
  • James Griffioen
    • 1
  1. 1.Laboratory for Advanced NetworkingUniversity of KentuckyLexington

Personalised recommendations