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:
Centralized control
Computer networks
Computer science
Decision making
Distributed computing
Distributed databases
Intelligent networks
Load management
Network topology
Polynomials
ISBN:0818620870, 9780818620874
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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.< >
AbstractList 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.< >
Author Xiaotie Deng
Bing Xiao
Hai-Ning Liu
Author_xml – sequence: 1
  surname: Xiaotie Deng
  fullname: Xiaotie Deng
  organization: Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada
– sequence: 2
  surname: Hai-Ning Liu
  fullname: Hai-Ning Liu
– sequence: 3
  surname: Bing Xiao
  fullname: Bing Xiao
BookMark eNotT8tqwzAQFLSBNo976Uk_4ERrvY8laZNCoIHkHmR5HdTacrBcSv--gnQuwwzD7syU3Mc-IiFPwJYAzK6Oh81hCdZmKbhk6o5MmQGjSmY0eyCLlD5ZhpTZEo8ENjji0IUY0hg8bXtX08q1LvoQLzRE6vvu-p0jNOL40w9faU4mjWsTLv55Rk5vr6f1rth_bN_XL_siGDsWWqDKb6uSK4daVU2jwDiTqzBXS69kVTaC11ICr8F6LY3W3IPnRhgFFvmMPN_OBkQ8X4fQueH3fNvE_wAtDELM
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SPDP.1990.143506
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEL
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEL
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 57
ExternalDocumentID 143506
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i89t-74e6818b236ae76bff618a80810ad5c65b2f43d5513d19c758773c1c3848619e3
IEDL.DBID RIE
ISBN 0818620870
9780818620874
IngestDate Tue Aug 26 17:03:01 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i89t-74e6818b236ae76bff618a80810ad5c65b2f43d5513d19c758773c1c3848619e3
PageCount 8
ParticipantIDs ieee_primary_143506
PublicationCentury 1900
PublicationDate 19900000
PublicationDateYYYYMMDD 1990-01-01
PublicationDate_xml – year: 1990
  text: 19900000
PublicationDecade 1990
PublicationTitle Parallel and Distributed Processing, 2nd IEEE Symposium On
PublicationTitleAbbrev SPDP
PublicationYear 1990
Publisher IEEE Comput. Soc. Press
Publisher_xml – name: IEEE Comput. Soc. Press
SSID ssj0000558624
Score 1.220473
Snippet The paper presents theoretical analysis of the deterministic complexity of the load balancing problem (LBP). Because of difficulty of the general problem,...
SourceID ieee
SourceType Publisher
StartPage 50
SubjectTerms Centralized control
Computer networks
Computer science
Decision making
Distributed computing
Distributed databases
Intelligent networks
Load management
Network topology
Polynomials
Title Deterministic load balancing in computer networks
URI https://ieeexplore.ieee.org/document/143506
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagYmAqlCIoD3lgNY0bvzJTKqYqEh26VX6cpUgoQX3w-7GdpAiJhc2OZCvnxDrf-b7vQ-jJW2-NkEDC6cIQJrgjOjMZgcJxGg6oJvc-iU3I5VKt10XZ8WwnLAwApOIzeI7NdJfvGnuIqbJp9O2RXvtUStFCtY7plIzzCHVIDI80tLLwH3b8On2f9beUWTF9L-dlBOqFbprzl7ZKci2L4b9e6gKNfyB6uDw6n0t0AvUIDXuNBtxt2StE5129SyJkxh-NdtjEckYbhuGqxrYfUrcF4bsxWi1eVy9vpJNJIJUq9kQyEMFEM8uFBimM94IqHc3OtONWcDPzLHdRyMXRwob4QMrcUpsrpkL0BPk1GtRNDTcIa-Mk99yBA8V4QZUEy4wL_otzHWKXWzSK9m8-WyKMTWv65M-nd-g8rm-brbhHg_32AA_ozH7tq932MX28b62Alrk
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5SBT1Va8X6zMFr7Ka7eezZWirWsmAPvZU8JlCQrfTh7zfJ7lYEL96ShYSd7IbJTOb7PoQenHFGcwHEny40yTizRCU6IZBbRv0BVafORbEJMZ3K-Twvap7tiIUBgFh8Bo-hGe_y7crsQqqsH3x7oNc-DMJZNVhrn1BJGAtgh8jxSH0r8X9izbDT9LPmnjLJ--_FsAhQPd-Ns_5SV4nOZdT-12udou4PSA8Xe_dzhg6g7KB2o9KA6017juiwrniJlMz4Y6Us1qGg0fhheFli0wwpq5LwTRfNRs-zpzGphRLIUuZbIjLg3kQ9SLkCwbVznEoVzE6UZYYzPXBZaoOUi6W58RGCEKmhJpWZ9PETpBeoVa5KuERYaSuYYxYsyIzlVAowmbbegzGmfPTSQ51g_-KzosJYVKZf_fn0Hh2PZ2-TxeRl-nqNTsJaV7mLG9Tarndwi47M13a5Wd_FD_kNvnqaAg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Parallel+and+Distributed+Processing%2C+2nd+IEEE+Symposium+On&rft.atitle=Deterministic+load+balancing+in+computer+networks&rft.au=Xiaotie+Deng&rft.au=Hai-Ning+Liu&rft.au=Bing+Xiao&rft.date=1990-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818620874&rft.spage=50&rft.epage=57&rft_id=info:doi/10.1109%2FSPDP.1990.143506&rft.externalDocID=143506
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/sc.gif&client=summon&freeimage=true