Finding all hops shortest paths

被引：11

作者：

Cheng, G ^{[1
]}

Ansari, N ^{[1
]}

机构：

[1] Newark Inst Technol, Dept Elect & Comp Engn, Adv Networking Lab, Newark, NJ 07012 USA

来源：

IEEE COMMUNICATIONS LETTERS | 2004年 / 8卷 / 02期

关键词：

quality of service (QoS); routing;

D O I：

10.1109/LCOMM.2004.823365

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

In this letter, we introduce and investigate a new problem referred to as the All Hops Shortest Paths (AHSP) problem. The AHSP problem involves selecting, for all hop counts, the shortest paths from a given source to any other node in a network. We derive a tight lower bound on the worst-case computational complexities of the optimal comparison-based solutions to AHSP.

引用

页码：122 / 124

页数：3