Deterministic load balancing in computer networks

The paper presents theoretical analysis of the deterministic complexity of the load balancing problem (LBP). Because of difficulty of the general problem, research in the area mostly restricts itself to probabilistic or approximation algorithms, or to the average behavior of a network. The paper pro...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel and Distributed Processing, 2nd IEEE Symposium On S. 50 - 57
Hauptverfasser: Xiaotie Deng, Hai-Ning Liu, Bing Xiao
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE Comput. Soc. Press 1990
Schlagworte:
Centralized control
Computer networks
Computer science
Decision making
Distributed computing
Distributed databases
Intelligent networks
Load management
Network topology
Polynomials
ISBN:0818620870, 9780818620874
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The paper presents theoretical analysis of the deterministic complexity of the load balancing problem (LBP). Because of difficulty of the general problem, research in the area mostly restricts itself to probabilistic or approximation algorithms, or to the average behavior of a network. The paper provides deterministic analysis of the problem for general networks. It focuses on the worst-case complexity analysis of the problem. It shows certain cases of the LBP to be NP-complete. The paper also discusses situations closely related to computer networks, where there is a global view of load distribution in the network; it provides a polynomial algorithm for solving the load balancing problem in this network.< >
ISBN:0818620870
9780818620874
DOI:10.1109/SPDP.1990.143506