The Modeling of Service Composition Path Selection Problem: Research on Linear-Structured Composed Service Routing Problem

Author

Zhang Yan-mei ; Wang Jian

Author_Institution

Inf. Sch. of Central, Univ. of Finance & Econ., Beijing, China

fYear

2010

fDate

28-29 Oct. 2010

Firstpage

254

Lastpage

257

Abstract

Take a research in depth on the modeling problem of service path selection based on SON. Firstly, the optimal model is built with the optimal goal of balanced loading and with the functional constraints of users for composed service and multi-QoS constraints. Then the layered method and improved Ant algorithm are adopted to solve this problem. Finally, a simulated emulation is made to the algorithm, and the result shows that modeling the problem of linear-structured composed service routing is more reasonable and the proposed algorithm has a better performance.

Keywords

Internet; optimisation; quality of service; resource allocation; telecommunication network routing; Ant algorithm; SON; layered method; linear structured composed service routing; multiQoS constraint; service composition path selection problem; service overlay network; Biological system modeling; Load modeling; Loading; Network topology; Quality of service; Reliability; Routing; Ant algorithm; composed service routing; layered model; optimal model; service composition;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligence Information Processing and Trusted Computing (IPTC), 2010 International Symposium on

Conference_Location

Huanggang

Print_ISBN

978-1-4244-8148-4

Electronic_ISBN

978-0-7695-4196-9

Type

conf

DOI

10.1109/IPTC.2010.156

Filename

5662834