Network-Tree routing model for large scale networks: theories and algorithms

Authors:
Guozhen Tan;Dong Li;Xiaohui Ping;Ningning Han;Yi Liu
Affiliations:
Department of Comupter Science, Dalian University of Technology, Dalian, P.R.China;Department of Comupter Science, Dalian University of Technology, Dalian, P.R.China;Department of Comupter Science, Dalian University of Technology, Dalian, P.R.China;Department of Comupter Science, Dalian University of Technology, Dalian, P.R.China;Department of Comupter Science, Dalian University of Technology, Dalian, P.R.China
Venue:
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Year:
2005

Citing 5
Cited 0

The landmark hierarchy: a new hierarchy for routing in very large networks

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A path-finding algorithm for loop-free routing

IEEE/ACM Transactions on Networking (TON)
QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Hierarchical Routing Overhead in Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.