Department of Automation, University of Science and Technology of China, Hefei 230027, China
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In this paper, a modified KCP algorithm is presented to replace single delay parameter by an aggregate function when we decide which path to choose, the aggregate function takes nodes’ and links’ comprehensive performance parameters such as the nodes’ delay, available resource and the links’ delay, bandwidth into consideration, besides, a new adjusting factor is proposed to give attention to both load-balancing and node-multiplexing. The simulation results verify the validity of this new algorithm in the service routing selection, it can also adjust the whole system to a well load-balancing and high node-multiplexing state at meanwhile.

    Reference
    Related
    Cited by
Get Citation

刘妍,李俊,吴刚.服务覆盖网中保证QoS的服务路由算法.计算机系统应用,2010,19(12):212-215

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 19,2010
  • Revised:May 23,2010
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063