摘要
在集成网络中 ,服务质量 (QoS)的一个重要方面是寻找满足端到端约束的可行路径 ,从而有效利用网络资源。考虑端到端的延迟约束和传输费用 ,对宽度优先算法 (BFS)进行扩展 ,提出了满足延迟约束多路径算法K_DCP,并对其进行改进 ,得到多路径算法K_EDCP。仿真结果显示 。
In integrated network,a crucial aspect of Quality of Service(QoS)is to find multiple shortest feasible paths that meet end to end delay and cost constraints.This paper expands Breadth First Search(BFS) algorithm,and proposes a multiple feasible paths algorithm under delay constraints(KDCP).The KDCP algorithm is then extended as KEDCP to get paths under delay and cost constraints.Simulation result shows the two algorithms have well performance compared with other mimetic algorithms.
出处
《计算机应用研究》
CSCD
北大核心
2004年第7期222-224,共3页
Application Research of Computers
关键词
服务质量
路由
延迟约束
多媒体
Quality of Service(QoS)
Routing
Delay Constraints
Multimedia