Approximating optimal spare capacity allocation by successive survivable routing

The design of survivable mesh based communication networks has received considerable attention in recent years. One task is to route backup paths and allocate spare capacity in the network to guarantee seamless communications services survivable to a set of failure scenarios. This is a complex multi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE/ACM transactions on networking 2005-02, Vol.13 (1), p.198-211
Hauptverfasser:	Yu Liu, Tipper, D., Siripongwutikorn, P.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Bandwidth Communication networks Computer networks Flow control MPLS traffic engineering multi-commodity flow Multiprotocol label switching network planning and optimization network survivability Peer to peer computing Protection protection and restoration Route optimization Routing Scanning probe microscopy Signal restoration spare capacity allocation Spine Studies survivable routing Telecommunication traffic
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!