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...

Full description

Saved in:
Bibliographic Details
Published in:Parallel and Distributed Processing, 2nd IEEE Symposium On pp. 50 - 57
Main Authors: Xiaotie Deng, Hai-Ning Liu, Bing Xiao
Format: Conference Proceeding
Language:English
Published: IEEE Comput. Soc. Press 1990
Subjects:
ISBN:0818620870, 9780818620874
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first