Abstract
A low-cost parallel QoS Sensitive domain, which supports load balancing network architecture, is developed in the paper. To deal with the scaling problem, a large network, thus, is structured by grou** nodes into parallel domains. Different from traditional approaches, especially hierarchical structure, parallel structure aggregates the topologies of domains in a new way. The corresponding routing algorithm, which adopts two skills for low-cost routing, QoS line segment and swap** matrix, is to emphasize particularly on load balancing within networks. Finally, Simulation results show appealing performances in terms of different metrics.
Chapter PDF
Similar content being viewed by others
References
The ATMForum: Private Network-to-network Interface Specification Version 1.0 (pnni 1.0). fpnni-0055.000 (1996)
Lui, K.-S., Nahrstedt, K.: Topology Aggregation and Routing in Bandwidth-delay Sensitive Networks. In: Proceedings of GLOBECOM 2000, IEEE, Los Alamitos (2000)
Wang, Z., Crowcroft, J.: Quality-of-service Routing for Supporting Multimedia Applications. IEEE Journal on Selected Areas in Communications 14 (1996)
Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NPCompleteness. Freeman, California (1979)
Estrin, D., Rekhter, Y., Hotz, S.: Scalable Inter-Domain Routing Architecture. In: Proceedings of ACM SIGCOMM 1992, Maryland (1992)
Korkmaz, T., Krunz, M., Tragoudas, S.: An Efficient Algorithm for Find-ing a Path Subject to Two Additive Constraints. Computer Communications Journal 25, 225–238 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this paper
Cite this paper
Wang, F., Wu, Y. (2004). Load Balancing Routing in Low-Cost Parallel QoS Sensitive Network Architecture. In: **, H., Gao, G.R., Xu, Z., Chen, H. (eds) Network and Parallel Computing. NPC 2004. Lecture Notes in Computer Science, vol 3222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30141-7_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-30141-7_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23388-6
Online ISBN: 978-3-540-30141-7
eBook Packages: Springer Book Archive