Space-Efficiency for Routing Schemes of Stretch Factor Three


We deal with deterministic distributed routing algorithms on arbitrary n-node networks. For each router, we want to minimize the amount of routing information that must be stored in order to implement the local routing algorithm, even if the names of the routers can be chosen in advance. We take also into account the length of the routing paths and consider… (More)
DOI: 10.1006/jpdc.2000.1705


1 Figure or Table


Citations per Year

86 Citations

Semantic Scholar estimates that this publication has 86 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics