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.
This work is supported by the National Science Foundation of China(60373094).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chen, S., Nahrstedt, K.: An Overview Of Quality Of Service Routing For Next-Generation High-Speed Networks: Problems And Solutions. In: Network, vol. 12, pp. 64–79. IEEE, Los Alamitos (1998)
McQuillan, J.: Adaptive routing algorithms for distributed computer networks. Bolt Beranek and Newman Inc., Cambridge (1974)
Tsuchiya, P.: The landmark hierarchy: A new hierarchy for routing invery large networks. Computer Communications Review 18(4), 43–54 (1988)
Garcia-Luna-Aceves, J., Murthy, S.: A path finding algorithm for loopfree routing. IEEE/ACM Transactions on Networking 5(1), 148–160 (1997)
Hao, F., Zegura, E.: On Scalable Qos Routing: Performance Evaluation of Topology Aggregation. In: Proceedings INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, pp. 26–30. IEEE, Los Alamitos (2000)
Luo, Y., Bai, Y.: Topology aggregation with multiple QoS parameters for scalable routing problem. In: International Conference on Communication Technology Proceedings, ICCT 2003, vol. 1, pp. 458–461 (2003)
Guerin, R., Orda, A.: Qos-based Routing in Networks with Inaccurate Information:Theory and Algorithms. In: Proceedings INFOCOM 1997. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, pp. 75–83. IEEE, Los Alamitos (1997)
Sucec, J., Marsic, I.: Hierarchical routing overhead in mobile ad hoc networks. Mobile Computing, IEEE Transactions 3(1), 46–56 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, G., Li, D., Ping, X., Han, N., Liu, Y. (2005). Network-Tree Routing Model for Large Scale Networks: Theories and Algorithms . In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-31957-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25338-9
Online ISBN: 978-3-540-31957-3
eBook Packages: Computer ScienceComputer Science (R0)