Large-Scale Service Overlay Networking with Distance-Based Clustering

  • Jingwen Jin
  • Klara Nahrstedt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2672)


The problem of service routing (or dynamic service composition) has recently emerged as a consequence of the distributed composable services model residing in middleware layer(s). However, existing solutions are mostly suitable for small- or medium-scale service overlay networks, as service routing is performed over flat overlay topologies such as a mesh. Due to their increasing routing information maintenance costs, these flat (single-level) topology solutions cannot cope with largescale service overlay networking. For better scalability, in this paper, we provide a hierarchical service routing framework, which comprises three parts. In the first part, we organize the overlay network nodes into clusters based on their Internet distances. We then construct a hierarchically fully connected (HFC) topology based on the clustering result. In such a topology, nodes within a cluster are considered fully connected, and the clusters themselves are also fully connected by their border nodes. In the second part, a hierarchical state information distribution protocol will be provided so that each node in the system maintains full state of the nodes in its own cluster and aggregate state of other clusters in the system. In the third part, we present how service paths can be computed hierarchically in a divide-and-conquer fashion. Through simulation tests, we demonstrate that while achieving much better scalability, our framework provides also as good and efficient service paths as single-level mesh solutions.


service routing dynamic service composition clustering topology aggregation hierarchical routing 


  1. 1.
    Y. Chu, S. G. Rao and H. Zhang. A Case For End System Multicast. In Proc. of ACM SIGMETRICS, pages 1–12, Santa Clara, CA, Jun 2000.Google Scholar
  2. 2.
    J. Liebeherr, and M. Nahas. Application-Layer Multicast with Delaunay Triangulations. In Proc. of Sixth Global Internet Symposium (IEEE Globecom 2001), San Antonio, Texas, Nov 2001.Google Scholar
  3. 3.
    Jingwen Jin and Klara Nahrstedt. mc-SPF: An Application-Level Multicast Service Path Finding Protocol for Multimedia Applications. In Proc. of IEEE International Conference on Multimedia and Expo (ICME2002), Lausanne, Switzerland, Aug 2002.Google Scholar
  4. 4.
    D. Xu, K. Nahrstedt,. Finding Service Paths in a Media Service Proxy Network. In Proc. of SPIE/ACM Multimedia Computing and Networking Conference (MMCN’02), San Jose, CA, Jan 2002.Google Scholar
  5. 5.
    Xiaohui Gu, Klara Nahrstedt, Rong N. Chang, Christopher Ward. QoS-Assured Service Composition in Managed Service Overlay Networks. In Proc. of The IEEE 23rd International Conference on Distributed Computing Systems (ICDCS 2003), Providence, Rhode Island, May 2003.Google Scholar
  6. 6.
    Jingwen Jin and Klara Nahrstedt. On Construction of Service Multicast Trees. In Proc. of IEEE International Conference on Communications (ICC 2003), Anchorage, Alaska, May 2003.Google Scholar
  7. 7.
    S. Chen, K. Nahrstedt. An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions. IEEE Network Magazine, 12(6):64–79, 1998.CrossRefGoogle Scholar
  8. 8.
    King-Shan Lui, Klara Nahrstedt, Shigang Chen. Hierarchical QoS Routing in Delay-Bandwidth Sensitive Networks. In Proc. of IEEE Conference on Local Computer Networks (LCN 2000), Tampa, FL, Nov 2000.Google Scholar
  9. 9.
    Turgay Korkmaz and Marwan Krunz. Source-Oriented Topology Aggregation with Multiple QoS Parameters in Hierarchical Networks. ACM Transactions on Modeling and Computer Simulation, 10(4):295–325, Nov 2000.CrossRefGoogle Scholar
  10. 10.
    F. Hao and E. W. Zegura. On Scalable QoS Routing: Performance Evaluation of Topology Aggregation. In Proc. of IEEE INFOCOM, Tel Aviv, Israel, Mar 2000.Google Scholar
  11. 11.
    Jingwen Jin, Klara Nahrstedt. QoS Service Routing for Supporting Multimedia Applications. Technical Report UIUCDCS-R-2002-2303/UILU-ENG-2002-1746, Department of Computer Science, University of Illinois at Urbana-Champaign, USA, Nov 2002.Google Scholar
  12. 12.
    Sumi Choi, Jonathan Turner, and Tilman Wolf. Configuring Sessions in Programmable Networks. In Proc. of IEEE INFOCOM, Anchorage, Alaska, Apr 2001.Google Scholar
  13. 13.
    King-Shan Lui, Klara Nahrstedt. Topology Aggregation and Routing in Bandwidth-Delay Sensitive Networks. In Proc. of IEEE Globecom 2000, San Franscisco, CA, Nov-Dec 2000.Google Scholar
  14. 14.
    F. Kon, R. Campbell, M. D. Mickunas, K. Nahrstedt, and F. J. Ballesteros. 2K: A Distributed Operating System for Dynamic Heterogeneous Environments. In Proc. of the 9th IEEE International Symposium on High Performance Distributed Computing, Pittsburgh, Aug 2000.Google Scholar
  15. 15.
    S. D. Gribble, M. Welsh, R. von Behren, E. A. Brewer, D. Culler, N. Borisov, S. Czerwinski, R. Gummadi, J. Hill, A. Joseph, R.H. Katz, Z.M. Mao, S. Ross, and B. Zhao. The Ninja Architecture for Robust Internet-Scale Systems and Services. Special Issue of Computer Networks on Pervasive Computing, 2001.Google Scholar
  16. 16.
    Xiaodong Fu, Weisong Shi, Anatoly Akkerman, and Vijay Karamcheti. CANS: Composable, Adaptive Network Services Infrastructure. In Proc. of Third USENIX Symposium on Internet Technologies and Systems, San Francisco, CA, Mar 2001.Google Scholar
  17. 17.
    A. Ivan, J. Harman, M. Allen, and V. Karamcheti. Partitionable Services: A Framework for Seamlessly Adapting Distributed Applications to Heterogeneous Environments. In Proc. of IEEE International Conference on High Performance Distributed Computing (HPDC), Edinburgh, Scotland, Jul 2002.Google Scholar
  18. 18.
    A. Fox, S. Gribble, Y. Chawathe, and E. Brewer. Adapting to Network and Client Variation Using Infrastructural Proxies: Lessons and Perspectives. IEEE Personal Communications, Aug 1998.Google Scholar
  19. 19.
    The ATM Forum. Private Network-Network Interface Specification Version 1.0 (PNNI 1.0), Mar 1996.Google Scholar
  20. 20.
    B. Awerbuch, Y. Du, B. Khan, and Y. Shavitt. Routing Through Teranode Networks with Topology Aggregation. In Proc. of IEEE ISCC, Athens, Greece, Jun 1998.Google Scholar
  21. 21.
    Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker. Topologically-Aware Overlay Construction and Server Selection. In Proc. of IEEE INFOCOM, New York, NY, Jun 2002.Google Scholar
  22. 22.
    T. S. Eugene Ng, Hui Zhang. Predicting Internet Network Distance with Coordinates-Based Approaches. In Proc. of IEEE INFOCOM, New York, NY, Jun 2002.Google Scholar
  23. 23.
    J. A. Nelder and R. Mead. A Simplex Method for Function Minimization. Computer Journal, 7, 1965.Google Scholar
  24. 24.
    Erich Rome. Simulating Perceptual Clustering by Gestalt Principles. In Proc. of 25th Workshop of the Austrian Association for Pattern Recognition, Berchtesgaden, Germany, Jun 2001.Google Scholar
  25. 25.
    C.T. Zahn. Graph-Theoretical Methos for Detecting And Describing Gestalt Clusters. IEEE Transactions on Computers, C 20, 1971.Google Scholar
  26. 26.
    E. Zegura, K. Calvert, S. Bhattacharjee. How to Model an Internetwork. In Proc. of IEEE INCOFOM, Apr 1996.Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2003

Authors and Affiliations

  • Jingwen Jin
    • 1
  • Klara Nahrstedt
    • 1
  1. 1.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUSA

Personalised recommendations