Routing Tables for Planar Network in Optimal Space
碩士 === 國立臺灣大學 === 資訊網路與多媒體研究所 === 96 === We address the problem of designing compact routing tables for an unlabeled n-node connected planar graph G. For each node r of G, a routing spanning tree T_r rooted at r is given. T_r describes how node r forwards packets to the rest of G. For node r of T_{...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/40154936821770701403 |