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

计算机工程 ›› 2006, Vol. 32 ›› Issue (10): 34-36.

• 博士论文 • 上一篇    下一篇

Overlay 网络上的覆盖节点的放置问题

潘 耘 1,2,张丽 1,3,余镇危1   

  1. 1. 中国矿业大学(北京校区)计算机系,北京 100083;2. 中国科学院计算技术研究所,北京 100080;3. 河南理工大学应用数学与信息科学系,焦作 454003
  • 出版日期:2006-05-20 发布日期:2006-05-20

Overlay Nodes Placement Problem on Overlay Network

PAN Yun1,2, ZHANG Li1,3, YU Zhenwei1   

  1. 1. Dept. of Computer, China University of Mining and Technology, Beijing 100083; 2. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080; 3. Institute of Applied Mathematics and Information Science, Henan Polytechnic University, Jiaozuo 454003
  • Online:2006-05-20 Published:2006-05-20

摘要: Overlay 服务网络是一种通用的服务框架,它利用覆盖网络技术来向用户提供各种各样的服务。该文在讨论Overlay 服务网络的基础上,提出了覆盖节点放置的问题,对该问题进行了形式化,并提出了相应的算法,对算法进行了相应的仿真。

关键词: Overlay 网络;覆盖节点;Lagrangian 松弛法

Abstract: Overlay service network (OSN) is a generic framework to support variety new applications based on the traditional Internet infrastructure. This paper surveys the current research on OSN topologies and brings forward the overlay node placement problems (ONPP). A programming model and three algorithms corresponding to the ONPP problems are also proposed. The complexity analysis and the numerical experiments support the model and algorithms from theory and practice as well. The comparison of performances on different algorithms suggests that Lagrangian relaxation method for solving the ONPP problem is feasible and efficient.

Key words: Overlay network; Overlay node; Lagrangian relaxation