A survey on interval routing (Q1575744)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1493513
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A survey on interval routing |
scientific article; zbMATH DE number 1493513 |
Statements
A survey on interval routing (English)
0 references
21 August 2000
0 references
We survey in this paper the classical results, and also the most recent results, in the field of Interval Routing, a well-known strategy to code in a compact way distributed routing algorithms. These results are classified in several themes: characterization, compactness and shortest path, dilation and stretch factor, specific classes of graphs (interconnection networks, bounded degree, planar, chordal rings, random graphs, etc.), and the other recent extensions proposed in the literature: dead-lock free, congestion, non-deterministic, and distributed problems related to Interval Routing. For each of these themes we review the state of the art and propose several open problems.
0 references
compact routing
0 references
routing tables
0 references
interval routing
0 references
broadcasting
0 references
networks
0 references
0 references
0 references
0.8618521094322205
0 references
0.8608972430229187
0 references
0.8528642654418945
0 references
