期刊文献+

Internet上多限制条件下的QoS路由算法研究综述

Survey of Multi-constrained QoS Routing on Internet
下载PDF
导出
摘要 1 引言目前的Internet网络中,一个会话的数据分组可以通过不同的传输路径到达目的节点,而且不同任务分组公平地共享网络资源,例如,链路带宽、交换缓冲区等。这种结构不能支持多媒体数据和实时数据传输。多媒体业务需求的日益增长推动了现有多媒体应用的进一步发展,这也对新一代网络提出了新的要求。服务质量(QoS,Quality of Services)的概念已经用于定量和定性地描述服务的提供者和服务的接受者之间协商的服务性能。服务质量可以由一些特定的参数来描述,服务的提供者允许服务的使用者在建立连接时对各种服务参数指定希望的、可接受的最低限度值。 Multi-constrained Quality of Service (QoS) routing is to find a feasible path in network which satisfies multiple independent quality of service constraints. The problem is a main problem in QoS routing and is NP-hard-The researchers in the field have presented many algorithms to solve this problem. In this paper, the authors propose a mathematical model of multi-constrained QoS routing and introduce the properties of each algorithm for multi-constrained QoS routing. Finally the future directions of the work is presented.
出处 《计算机科学》 CSCD 北大核心 2002年第8期59-62,共4页 Computer Science
基金 国家海外杰出青年自然科学基金(69928201) 教育部高等学校骨干教师资助计划(教科司[2000]143号)资助项目
关键词 INTERNET QOS 路由算法 服务质量 计算机网络 Multi-constrained .QoS routing .Algorithm
  • 相关文献

参考文献33

  • 1Xiao Xi-Peng ,Lionel Ni. Internet QoS: A Big Picture. IEEE Network Magazine, 1999 (March/April): 8~ 18 被引量:1
  • 2Zhang Zhi-Li. End-To-End support for Statistical Quality-of-Ser vice Guarantees in Multimedia Networks: [Ph. D. thesis]. University of Massachusetts at Amherst, Amherst, MA, Feb. 1997 被引量:1
  • 3Shaikh A. Efficient Dynamic Routing in Wide-Area Networks: [Ph. D. thesis]. University of Michigan, May 1999 被引量:1
  • 4Nair R, Rajagopalan B,Sandick H. A Framework for QoS-based Routing in the Internet, RFC 2386, IETF, Aug. 1998 被引量:1
  • 5Pornavalai C,Chakraborty G, Shiratori N. Routing with multiple QoS requirements for supporting multimedia applications. Journalof High Speed Networks, 1998 被引量:1
  • 6Jaffe J M. Algorithms for Finding Paths with Multiple Con straints. Networks, 1984, 14:95~116 被引量:1
  • 7Goel A,et al. An Efficient Algorithm for Constraint-based Routing in Data Networks: [Technical Report, BL0112120-99061611TM]. Bell Laboratories/Lucent Technologies, 1999 被引量:1
  • 8Chen S,Nahrstedt K. On Finding Multi-Constrained Paths. IEEE ICC'98, June 1998 被引量:1
  • 9Chen S,Nahrstedt K.On finding multi-constrained paths:[Tech. Report UIUCDCS-R-97-2026]. Dept. of Computer Science, Uni versity of Illinois at Urbana-Champaign, Aug. 1997 被引量:1
  • 10Yuan Xin, Liu Xingming. Heuristic Algorithms for Multi-Con-strainedQuality of Service Routing. IEEE INFOCOM 2001, An chorage, Alaska, April 2001. 844~853 被引量:1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部