点击次数：

论文类型：会议论文

发表时间：2005-04-17

收录刊物：EI

卷号：3421

期号：II

页面范围：184-191

摘要：For the first time, we propose Network-tree Model and its theorem of routing optimization, which greatly narrows the searching space of the routing procedure within much smaller sub-networks. We then show the routing scheme for Network-tree Model. Based on the communication capability of links, we design a network-tree clustering algorithm by employing the idea of multi-hierarchy partition and anomalistic regional partition and the network-tree routing algorithm (NTRA) which includes an aggregation scheme for network-tree (NTAS) that follows the network-tree Theorem of Routing Optimization. The work achieves a logarithmical reduction in communication complexity. Meanwhile, routing in network-tree reaches a high accuracy. While satisfying the two conditions which we finally addressed, NTRA can get the optimal routes. By simulations, we find that NTRA obtains high performance in convergence, routing accuracy and average throughput, as expected. © Springer-Verlag Berlin Heidelberg 2005.