The Stratified Shortest-Paths Problem (invited paper)

The Stratified Shortest-Paths Problem (invited paper)

In the last ten years it has become clear that some Internet routing protocols do not compute globally optimal paths, but only locally optimal ones. This represents something rather novel in the context of the vast literature on routing protocols for data networking. This paper introduces the Strati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Griffin, T.G.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algebra
Internet
Laboratories
Operations research
Routing protocols
Shortest path problem
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In the last ten years it has become clear that some Internet routing protocols do not compute globally optimal paths, but only locally optimal ones. This represents something rather novel in the context of the vast literature on routing protocols for data networking. This paper introduces the Stratified Shortest-Paths Problem as a tool for exploring the borderline between local and global optimality problems. The paper contains a tutorial overview of the algebraic concepts used.
ISSN:2155-2487
2155-2509
DOI:10.1109/COMSNETS.2010.5432000