✦ LIBER ✦

Single backup table schemes for shortest-path routing

✍ Scribed by Hiro Ito; Kazuo Iwama; Yasuo Okabe; Takuya Yoshihiro

Book ID: 118501397
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 183 KB
Volume: 333
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.06.033

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterization results of all shortest

Characterization results of all shortest paths interval routing schemes

✍ M. Flammini; G. Gambosi; U. Nanni; R.B. Tan 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB

Worst Case Bounds for Shortest Path Inte

Worst Case Bounds for Shortest Path Interval Routing

✍ Cyril Gavoille; Eric Guévremont 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Consider shortest path inter¨al routing, a popular memory-balanced method for Ž . solving the routing problem on arbitrary networks. Given a network G, let IRS G denote the maximum number of intervals necessary to encode groups of destinations on an edge, minimized over all shortest path interval ro

Improved balancing heuristics for optimi

Improved balancing heuristics for optimizing shortest path routing

✍ Makarem Bamatraf; Mohamed Othman 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 379 KB

F-TPR: fine two-phase IP routing scheme

F-TPR: fine two-phase IP routing scheme over shortest paths for hose model

✍ Oki, E.; Iwaki, A. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 144 KB

Load-Balanced IP Routing Scheme Based on

Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model

✍ Oki, Eiji; Iwaki, Ayako 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 579 KB

Management of Railroad Impedances for Sh

Management of Railroad Impedances for Shortest Path-based Routing

✍ Jeff Day; George L. Nemhauser; Joel S. Sokol 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 650 KB