Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees (2002)
by
Hsueh-i Lu
| Venue: | In: 8 th Annual International Computing & Combinatorics Conference (COCOON). Volume 2387 of LNCS |
| Citations: | 10 - 3 self |
BibTeX
@INPROCEEDINGS{Lu02improvedcompact,
author = {Hsueh-i Lu},
title = {Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees},
booktitle = {In: 8 th Annual International Computing & Combinatorics Conference (COCOON). Volume 2387 of LNCS},
year = {2002},
pages = {57--66},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We address the problem of designing compact routing tables for an unlabeled connected n-node planar network G. For each node r of G, the designer is given a routing spanning tree Tr of G rooted at r, which speci es the routes for sending packets from r to the rest of G.
