.png){kind=icon}
返回
A distributed algorithm for delay-constrained unicast routing
.png){kind=icon}
OA
AI
DOI：10.1109/90.842145.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the NP-hard delay-constrained least cost (DCLC) path problem. A solution to this problem is needed to provide real-time communication service to connection-oriented applications, such as video and voice. We propose a simple, distributed heuristic solution, called the delay-constrained unicast routing (DCUR) algorithm. DCUR requires limited network state information to be kept at each node: a cost vector and a delay vector. We prove DCUR's correctness by showing that it is always capable of constructing a loop-free delay-constrained path within finite time, if such a path exists. The worst case message complexity of DCUR is O(\V\(2)) messages, where \V\ is the number of nodes. However, simulation results show that, on the average, DCUR requires much fewer messages. Therefore, DCUR scales well to large networks. We also use simulation to compare DCUR to the optimal algorithm, and to the least delay path algorithm. Our results show that DCUR's path costs are within 10% of those of the optimal solution.
Keyword:
delay constraints
distributed algorithms
quality of service
routing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏The Aqueous Extract of Sclerocarya birrea, Nauclea latifolia, and Piper longum Mixture Protects Striatal Neurons and Movement‐Associated Functionalities in a Rat Model of Diabetes‐Induced Locomotion DysfunctionSclerocarya birrea、Nauclea latifolia和Piper longum混合物的水提物可保护纹状体神经元及与运动相关的功能，在糖尿病诱导的运动功能障碍大鼠模型中。
OAAI
OAAI分享收藏分享收藏 没有更多内容
没有更多内容