DocumentCode
1855899
Title
The Stratified Shortest-Paths Problem (invited paper)
Author
Griffin, Timothy G.
Author_Institution
Comput. Lab., Univ. of Cambridge, Cambridge, UK
fYear
2010
fDate
5-9 Jan. 2010
Firstpage
1
Lastpage
10
Abstract
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.
Keywords
Internet; data communication; routing protocols; Internet routing protocols; data networking; global optimality; local optimality; stratified shortest-paths problem; Algebra; Internet; Laboratories; Operations research; Routing protocols; Shortest path problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication Systems and Networks (COMSNETS), 2010 Second International Conference on
Conference_Location
Bangalore
Print_ISBN
978-1-4244-5487-7
Type
conf
DOI
10.1109/COMSNETS.2010.5432000
Filename
5432000
Link To Document