QoS-Guaranteed Algorithm for Composed Service Path Selection in the SON

Author

Zhang Yan-mei ; Yu Zhen-wei ; Cao Huai-hu

Author_Institution

Mech. Electron. & Inf. Eng. Sch., China Univ. of Min. & Technol., Beijing

Volume

2

fYear

2009

fDate

25-26 April 2009

Firstpage

524

Lastpage

527

Abstract

LDT and LDT-P Algorithms are proposed, which fit for linear and parallel service composition respectively .Composition Agent is responsible for searching components and generating a least delay tree. Then candidate paths are found by visiting the tree nodes with the depth-first traversal scheme. At last a path is selected for composed service considering the capability of the nodes and the bandwidth of links comprehensively. Simulation shows LDT and LDT-P Algorithms have the feature of higher composition success ratio and shorter path length, compared with the other current algorithms.

Keywords

quality of service; QoS-guaranteed algorithm; composed service path selection; composition agent; depth-first traversal scheme; least delay tree; linear service composition; parallel service composition; service overlay network; Algorithm design and analysis; Bandwidth; Computer networks; Concurrent computing; Delay; Finance; Information security; Load management; Routing; Wireless communication; QoS; load balancing; routing; service composition; service overlay network;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks Security, Wireless Communications and Trusted Computing, 2009. NSWCTC '09. International Conference on

Conference_Location

Wuhan, Hubei

Print_ISBN

978-1-4244-4223-2

Type

conf

DOI

10.1109/NSWCTC.2009.182

Filename

4908521