Share Email Print
cover

Proceedings Paper

Load balancing and robustness in complex network systems
Author(s): S. Shabbih. U. H. Jafri; P. Johnson; A. T. Bendiab
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A constrained preferential attachment mechanism is proposed for the load balancing and the constrained preferential attachment mechanism [16] is explored for the robustness in large and complex network systems. The constrained preferential attachment policy method applied to optimize the load balancing of services or resources in grid computing environment for quality of services. It is presented how uniform utilization of resources can be achieved by using constrained preferential attachment policy method. A mathematical model is designed to work with constrained preferential attachment mechanism [16] for the network nodes/load re-balancing in case of attack or failure. Network graph theory reviewed to answer the important questions related to complex network systems load balancing and robustness.

Paper Details

Date Published: 19 November 2007
PDF: 9 pages
Proc. SPIE 6784, Network Architectures, Management, and Applications V, 678433 (19 November 2007); doi: 10.1117/12.742047
Show Author Affiliations
S. Shabbih. U. H. Jafri, Liverpool John Moores Univ. (United Kingdom)
P. Johnson, Liverpool John Moores Univ. (United Kingdom)
A. T. Bendiab, Liverpool John Moores Univ. (United Kingdom)


Published in SPIE Proceedings Vol. 6784:
Network Architectures, Management, and Applications V
Jianli Wang; Gee-Kung Chang; Yoshio Itaya; Herwig Zech, Editor(s)

© SPIE. Terms of Use
Back to Top