A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The Ninja architecture for robust Internet-scale systems and services373423
Computer Networks: The International Journal of Computer and Telecommunications Networking - pervasive computing
Hierarchical QoS routing in delay-bandwidth sensitive networks
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
2K: A Distributed Operating System for Dynamic Heterogeneous Environments
HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
QoS-Assured Service Composition in Managed Service Overlay Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
CANS: composable, adaptive network services infrastructure
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
IEEE Transactions on Computers
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
IEEE Network: The Magazine of Global Internetworking
Hybrid multicasting in large-scale service networks
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
A taxonomy for multimedia service composition
Proceedings of the 12th annual ACM international conference on Multimedia
On exploring performance optimizations in web service composition
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Towards building large scale multimedia systems and applications: challenges and status
Proceedings of the first ACM international workshop on Multimedia service composition
Structuring topologically aware overlay networks using domain names
Computer Networks: The International Journal of Computer and Telecommunications Networking
QoS-Aware service management for component-based distributed applications
ACM Transactions on Internet Technology (TOIT)
An architecture for adaptive multimedia streaming to mobile nodes
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia
Distributed OSGi built over message-oriented middleware
Software—Practice & Experience
Hi-index | 0.00 |
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 large-scale 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.