๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Efficient Algorithm for Global Path Optimization in MPLS Networks

โœ Scribed by Bal#x00E1;zs G#x00E1;bor J#x00F3;zsa; Zolt#x00E1;n Kir#x00E1;ly; G#x00E1;bor Magyar; #x00C1;ron Szentesi

Book ID
110335743
Publisher
Springer US
Year
2001
Tongue
English
Weight
170 KB
Volume
2
Category
Article
ISSN
1389-4420

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Algorithm for finding optimum path in
An Algorithm for finding optimum path in networks
โœ Kabekode V.S. Bhat ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 242 KB

In this paper we present an O((V( . loglV() algorithm forfinding an optimum path between two nodes in an edge-sparse network using a new approach. The method exploits the data structure and a simple breadth-first search process.