Load Balancing Routing in Low-Cost Parallel QoS Sensitive Network Architecture

Furong Wang²⁰ &
Ye Wu²⁰

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3222))

Included in the following conference series:

IFIP International Conference on Network and Parallel Computing

885 Accesses

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 grouping 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 swapping matrix, is to emphasize particularly on load balancing within networks. Finally, Simulation results show appealing performances in terms of different metrics.

Download to read the full chapter text

Chapter PDF

GHDC: a dual-centric data center network architecture by using multi-port servers with greater incremental scalability

Article 23 January 2023

HHS: an efficient network topology for large-scale data centers

Article 21 January 2016

Adaptive Workload-Based Partitioning and Replication for RDF Graphs

References

The ATMForum: Private Network-to-network Interface Specification Version 1.0 (pnni 1.0). fpnni-0055.000 (1996)
Google Scholar
Lui, K.-S., Nahrstedt, K.: Topology Aggregation and Routing in Bandwidth-delay Sensitive Networks. In: Proceedings of GLOBECOM 2000, IEEE, Los Alamitos (2000)
Google Scholar
Wang, Z., Crowcroft, J.: Quality-of-service Routing for Supporting Multimedia Applications. IEEE Journal on Selected Areas in Communications 14 (1996)
Google Scholar
Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NPCompleteness. Freeman, California (1979)
MATH Google Scholar
Estrin, D., Rekhter, Y., Hotz, S.: Scalable Inter-Domain Routing Architecture. In: Proceedings of ACM SIGCOMM 1992, Maryland (1992)
Google Scholar
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)
Article Google Scholar

Download references

Author information

Authors and Affiliations

Huazhong University of Science and Technology, Wuhan, Hubei, China
Furong Wang & Ye Wu

Authors

Furong Wang
View author publications
You can also search for this author in PubMed Google Scholar
Ye Wu
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology, Huazhong University of Science and Technology, 430074, Wuhan, China
Hai Jin
University of Delaware, Newark, DE, USA
Guang R. Gao
Institute of Computing Technology, Chinese Academy of Sciences, 100080, Beijing, China
Zhiwei Xu
Software Engineering Institute, East China Normal University, 20062, Shanghai, China
Hao Chen

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Wang, F., Wu, Y. (2004). Load Balancing Routing in Low-Cost Parallel QoS Sensitive Network Architecture. In: Jin, 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

Publish with us

Policies and ethics