Sciweavers

155 search results - page 3 / 31
» A New Necessary Condition for Shortest Path Routing
Sort
View
AICCSA
2006
IEEE
126views Hardware» more  AICCSA 2006»
14 years 1 months ago
Restricted Shortest Path Routing with Concave Costs
Multi-constraint quality-of-service routing has become increasingly important as the Internet evolves to support real-time services. Restricted shortest path (RSP) is one of the i...
Pejman Khadivi, Shadrokh Samavi, Hossein Saidi
ICDCS
2012
IEEE
11 years 9 months ago
Optimal Recovery from Large-Scale Failures in IP Networks
—Quickly recovering IP networks from failures is critical to enhancing Internet robustness and availability. Due to their serious impact on network routing, large-scale failures ...
Qiang Zheng, Guohong Cao, Tom La Porta, Ananthram ...
SIROCCO
2003
13 years 8 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
DATE
2008
IEEE
138views Hardware» more  DATE 2008»
14 years 1 months ago
BARP-A Dynamic Routing Protocol for Balanced Distribution of Traffic in NoCs
A novel routing algorithm, named Balanced Adaptive Routing Protocol (BARP), is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at ...
Pejman Lotfi-Kamran, Masoud Daneshtalab, Caro Luca...
ISCAPDCS
2003
13 years 8 months ago
Design and Analysis of Improved Shortest Path Tree Update for Network Routing
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...