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

被引:0
作者
Zhang Yan-mei [1 ,2 ]
Yu Zhen-wei [1 ]
Cao Huai-hu [2 ]
机构
[1] China Univ Min & Technol, Mech Elect & Informat Engn Sch, Beijing 100083, Peoples R China
[2] Cent Univ Finance & Econ, Informat Sch, Beijing 100081, Peoples R China
来源
NSWCTC 2009: INTERNATIONAL CONFERENCE ON NETWORKS SECURITY, WIRELESS COMMUNICATIONS AND TRUSTED COMPUTING, VOL 2, PROCEEDINGS | 2009年
关键词
service composition; routing; QoS; load balancing; service overlay network;
D O I
10.1109/NSWCTC.2009.182
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:524 / +
页数:2
相关论文
共 6 条
[1]  
GU X, 2004, THESIS U ILLINOIS UR
[2]  
Gu XH, 2002, INT CON DISTR COMP S, P194
[3]  
JAI M, 2006, P IEEE INT WORKSH QU
[4]  
LIAO Y, 2005, CHINESE J COMPUTERS, V28
[5]  
Raman B, 2003, IEEE INFOCOM SER, P1477
[6]  
RAMAN B, 2002, THESIS U CALIFORNIA