Partial characterizations of networks supporting shortest path interval labeling schemes

In this paper, we consider the problem of shortest path interval routing, a space‐efficient strategy for routing in distributed networks. In this scheme, an ordering of the vertices is chosen so that the edges of the network can be labeled with one or more subintervals of the vertex ordering: The re...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Networks Ročník 32; číslo 2; s. 103 - 113
Hlavní autoři: Narayanan, Lata, Shende, Sunil
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Wiley Subscription Services, Inc., A Wiley Company 01.09.1998
John Wiley & Sons
Témata:
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
graph theory
Information retrieval. Graph
interval routing algorithms
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Theoretical computing
theory of parallel and distributed computation
Interval graph
Optimal strategy
Network
Shortest path
Routing
Parallel computation
Graph theory
Distributed computing
ISSN:0028-3045, 1097-0037
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we consider the problem of shortest path interval routing, a space‐efficient strategy for routing in distributed networks. In this scheme, an ordering of the vertices is chosen so that the edges of the network can be labeled with one or more subintervals of the vertex ordering: The resulting routing tables must be deterministic and route along shortest paths between all pairs of vertices. We first show constructively that any interval graph can be labeled with one circular subinterval on each edge; this extends a known result for proper interval graphs. We also provide a partial characterization for networks that admit linear interval routing when edges are labeled with exactly one interval, in terms of the biconnected components of any such network. This is the first such characterization when the paths are required to be shortest paths under the distance metric. Finally, we show that the class of networks that can be labeled with k ≥ 1 subintervals per edge is closed under composition with a certain class of graphs. © 1998 John Wiley & Sons, Inc. Networks 32: 103–113, 1998
Bibliografie:ArticleID:NET3
NSERC, Canada
istex:1BAD71E73C74A5F64FEE6C4A29F69DF0F2C28686
ark:/67375/WNG-LS2Z8PCN-P
Concordia University
ISSN:0028-3045
1097-0037
DOI:10.1002/(SICI)1097-0037(199809)32:2<103::AID-NET3>3.0.CO;2-F