A Distributed Service Registry for Resource Sharing Among Ad-Hoc Dynamic Coalitions

  • Ravi Mukkamala
  • Vijayalakshmi Atluri
  • Janice Warner
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 193)


In a dynamic coalition environment, it is essential to allow automatic sharing of resources among coalition members. The challenge is to facilitate such sharing while adhering to the security policies of each coalition. To accomplish this, a dynamic coalition-based access control (DCBAC) has been proposed earlier, where security policies enforced by each coalition member are published in a centralized coalition service registry (CSR). In this paper, we propose a distributed coalition service registry (DCSR) system. In the DCSR system, several service registry agents cooperate to provide controlled access to resources. Distribution of the registries results in improved availability, higher concurrency, better response times to user queries, and enhanced flexibility. We employ secure group multicasting to communicate among the DCSR agents. The paper outlines the DCSR system, the supported functionalities and its underlying infrastructure.


Security Policy Service Registry Multicast Group Access Control Policy Coalition Member 
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.


  1. [1]
    K. Birman. Reliable distributed systems: Technologies, web services, and applications. Springer, 2005.Google Scholar
  2. [2]
    Y. Chawathe, S. McCanne, and E. A. Brewer. RMX: Reliable multicast for heterogeneous networks. IEEE Infocom, pp. 795–804, 2000.Google Scholar
  3. [3]
    Y. Chu, S.G. Rao, and H. Zhang. A case for end system multicast. ACM SIGMETRICS 2000, Santa Clara, California, USA, 2000.Google Scholar
  4. [4]
    W.K. Edwards. Core Jini, Prentice-Hall, 1999.Google Scholar
  5. [5]
    M. Eltoweissy, H. Heydari, L. Morales, and H. Sudbourough. Combinatorial optimization of key management in group communications. Journal of Network and Systems Management: Special Issue on Network Security, March 2004.Google Scholar
  6. [6]
    P. Francis. Yoid: Extending the Internet multicast architecture. April 2000, Scholar
  7. [7]
    H. Harney, and C. Muckenhirn. Group Key Management Protocol (GKMP) Specification. RFC 2093, 1997.Google Scholar
  8. [8]
    J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. O’Toole. Overcast: Reliable multicasting with an overlay network. Fourth Symposium on Operating Systems Design and implementation. pp. 197–212, San Diego, CA, October 2000. USENIX Association.Google Scholar
  9. [9]
    V. Kalogeraki, L.E. Moser, P.M. Melliar-Smith. Dynamic modeling of replicated objects for dependable softreal-time distributed object systems. Proceedings Fourth International Workshop on Object-Oriented Real-Time Dependable Systems, pp. 48–55, January 1999.Google Scholar
  10. [10]
    J. Liebeherr, T. Beam. HyperCast: A Protocol for maintaining multicast group members in a logical hypercube topology. First International Workshop on Networked Group Communication (NGC ′99), Lecture Notes in Computer Science, Vol. 1736, pp. 72–89, 1999.Google Scholar
  11. [11]
    Y. Lin, B. Kemme, M. Patino-Martinez, and R. Jimenez-Peris. Consistent data replication: Is it feasible in WANs? Europar Conf., Lisbon (Portugal), 2005.Google Scholar
  12. [12]
    M. Moharrum, R. Mukkamala, and M. Eltoweissy, Efficient secure multicast with well-populated multicast key trees. Tenth Int. Conf. Parallel and Distributed Systems (ICPADS′04), pp. 215–224, 2004.Google Scholar
  13. [13]
    M. Moharrum, R. Mukkamala, and M. Eltoweissy. A novel collusion-resilient architecture for secure group communication in wireless ad-hoc networks. Journal of High Speed Networks, 2005 (to appear).Google Scholar
  14. [14]
    C. Philips, T.C. Ting, and S. Demurjian. Information sharing and security in dynamic coalitions. SACMAT, 2002.Google Scholar
  15. [15]
    J. Prosise. Programming Microsoft.Net, Microsoft Press, 2002.Google Scholar
  16. [16]
    S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Application-level multicast using content-addressable networks. Third International Workshop on Networked Group Communication (NGC ′01), London, England, 2001.Google Scholar
  17. [17]
    E. Royer and C. Perkins. Multicast operation of the ad-hoc on-demand distance vector routing protocol. 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM′99), Seattle, WA, USA, August 1999, pp. 207–218.Google Scholar
  18. [18]
    D. Wallner, E. Harder, and R. Agee. Key management for multicast: Issues and architectures. RFC 2627, 1999.Google Scholar
  19. [19]
    J. Warner, V. Atluri, and R. Mukkamala. A credential-based approach for facilitating automatic resource sharing among ad-hoc dynamic coalitions. 19th Annual IFIP WG 11.3 Conference on Data and Application Security, Storrs, CT, August 2005, Springer LNCS 3654, pp. 252–266.Google Scholar
  20. [20]
    R. Yavatkar, J. Friffioen, and M. Sudan. A Reliable dissemination protocol for interactive collaborative applications. ACM Multimedia 1995, pp. 333–343. November 1995.Google Scholar
  21. [21]
    Y. Yi, S. Lee, W. Su, and M. Gerla. On-demand multicast routing protocol (ODMRP) for ad hoc networks. IETF MANET Working Group Internet Draft, Feb. 2003.Google Scholar
  22. [22]
    M. Younis, M. Youssef, and K. Arisha. Energy-aware management in cluster-based sensor networks. Computer Networks, Vol. 43, No. 5, pp. 649–668, December 2003.CrossRefGoogle Scholar

Copyright information

© International Federation for Information Processing 2005

Authors and Affiliations

  • Ravi Mukkamala
    • 1
  • Vijayalakshmi Atluri
    • 2
  • Janice Warner
    • 2
  1. 1.Department of Computer ScienceOld Dominion UniversityNorfolk
  2. 2.MSIS Department and CIMICRutgers UniversityNewark

Personalised recommendations