On the relative behavior of source and distributed routing in NOWs using Up*/Down* routing schemes

2002 ◽  
Author(s):  
J.C. Sancho ◽  
A. Robles ◽  
J. Duato
Keyword(s):  
Distributed Routing ◽  
Routing Schemes

Distributed routing schemes for ad hoc networks using d-SPR sets

2004 ◽  
Vol 28 (8) ◽  
pp. 427-437 ◽  
Author(s):  
Subhankar Dhar ◽  
Michael Q. Rieck ◽  
Sukesh Pai ◽  
Eun Jik Kim
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Distributed Routing ◽  
Routing Schemes ◽  
Hoc Networks

VLSI implementation of greedy-based distributed routing schemes for ad hoc networks

2006 ◽  
Vol 11 (9) ◽  
pp. 865-872 ◽  
Author(s):  
Alberto Aloisio ◽  
Vincenzo Izzo ◽  
Salvatore Rampone
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Vlsi Implementation ◽  
Distributed Routing ◽  
Routing Schemes ◽  
Hoc Networks

scholarly journals Interval Routing Schemes for Circular-Arc Graphs

2017 ◽  
Vol 28 (01) ◽  
pp. 39-60
Author(s):  
Frank Gurski ◽  
Patrick Gwydion Poullie
Keyword(s):  
Shortest Path ◽  
Shortest Paths ◽  
Global Order ◽  
Circular Arc ◽  
Distributed Routing ◽  
Routing Schemes ◽  
Routing Scheme ◽  
Interval Routing ◽  
Circular Arc Graphs ◽  
Open Question

Interval routing is a space efficient method to realize a distributed routing function. In this paper we show that every circular-arc graph allows a shortest path strict 2-interval routing scheme, i.e., by introducing a global order on the vertices and assigning at most two (strict) intervals in this order to the ends of every edge allows to depict a routing function that implies exclusively shortest paths. Since circular-arc graphs do not allow shortest path 1-interval routing schemes in general, the result implies that the class of circular-arc graphs has strict compactness 2, which was a hitherto open question. Additionally, we show that the constructed 2-interval routing scheme is a 1-interval routing scheme with at most one additional interval assigned at each vertex and we outline an algorithm to calculate the routing scheme for circular-arc graphs in 𝒪(n2) time, where n is the number of vertices.

Sign in / Sign up

Export Citation Format

Share Document