Improved Succinct Routing Tables for Planar Networks (via Orderly Spanning Trees)
碩士 === 國立清華大學 === 資訊工程學系 === 90 === We address problem of designing compact routing tables for an n-node unlabeled connected network G. For each node r of G, we are given a spanning tree Tr of G rooted at r. Each node r of G are equipped with ports 1,2,…,dr, where dr is the degree of r in...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/66653278991441171243 |