《QoS-Aware Service Composition in Large Scale Multi-Domain Networks》
Jin Xiao, Raouf Boutaba, IEEE
Abstract Next generation networks are envisioned to support dynamic and customizable service compositions at Internet scale. To facilitate the communication between distributed software components, on-demand and QoS-aware network service composition across large scale networks emerges as a key research challenge. This paper presents a fast QoS-aware service composition algorithm for selecting a set of interconnected domains with specific service classes.We further show how such algorithm can be used to support network adaptation and service mobility. In simulation studies performed on large scale networks, the algorithm exhibits very high probability of finding the optimal solution within short execution time. In addition, we present a distributed service composition framework utilizing this algorithm.
Keywords: Service composition and provisioning, network adaptation, multi-domain networks, end-to-end QoS assurance
个人点评:
因为读了 玉泉老博 论文泛读,才看了这篇文章。先谈对此文看法:一般,没有细研究其算法。
思路: (Conclusion)
1. service composition problem k-MCOP (k Multi-Constraint Optimization Problem)
2. propose a new heuristic algorithm based on Bellman-Ford or Dijkstra’s algorithm
3. copy with Network Adaptation, present a simple network adaptation algorithm
Simulate and Comparison:
1. The first algorithm is a well known k-MCOP heuristic developed by Korkmaz and Krunz
2. The second algorithm (denoted as SC-SON) is used in the service composition scheme proposed by Gu
作者认为其算法
1. fast
2. scalability: algorithm only relies on per-hop domain knowledge that can be readily extracted from BGP information,
缺点:
1. Abstract: it don't point out its key techniques and main contributions
2. 没有发现其算法特别之处,倒是所选择对比的算法是经典
另外说明一下:以解释玉泉老博的疑惑
本文是针对于 Qos Routing in Network Services, 研究在网络层次;玉泉老博 理解为 Web Services,关键在于对于 Service 的理解范围。