作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (08): 100-102. doi: 10.3969/j.issn.1000-3428.2007.08.034

• 网络与通信 • 上一篇    下一篇

Overlay组播网络中的服务组合算法

潘 耘1,余镇危2,王银燕2   

  1. (1. 中国传媒大学计算机与软件学院,北京 100024;2. 中国矿业大学(北京)计算机系,北京 100083)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-04-20 发布日期:2007-04-20

Service Composition Algorithm on Overlay Multicast Network

PAN Yun1, YU Zhenwei2, WANG Yinyan2   

  1. (1. Computer Science & Software Institute, Communication University of China, Beijing 100024; 2. Department of Computer, China University of Mining and Technology (Beijing), Beijing 100083)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-04-20 Published:2007-04-20

摘要: 在Overlay组播路由中既需要考虑确保数据流能获得它所需要的服务,还需要确保不同的服务按照合适的次序到达,这是一个新的值得研究的问题,称之为服务组合问题。该文研究了Overlay组播网络中的服务组合问题,建立了相应的优化模型,设计了求解该模型的启发式算法。大量的仿真表明了该模型和算法的有效性。

关键词: Overlay组播网络, 服务组合, 扩展最短路径算法

Abstract: This paper investigates the service combination problem in overlay multicasting network by taking both the service assuring and order of service into consideration. It presents an optimization model and designs a heuristic algorithm on the service combination problem. Large amount of simulations suggest the model and the algorithm are practical and effective.

Key words: Overlay multicast network, Service composition, Extend short path algorithm