Load balancing characteristics of networks

Alfred Boals, Naveed A. Sherwani, Eltayeb Abuelyaman, Hesham H. Ali

Research output: Contribution to conferencePaper

Abstract

Not much attention has been paid to the design of networks that can tolerate failure of one or more processor and perform efficiently in the presence of faulty processor(s). As computer networks of the future will be required to support several (hundred) users concurrently, not only functionality but also performance must be guaranteed by the network. In case of single or multiple processor failure, the network must automatically rebalance the load and the system throughput must be minimally affected. However, due the structural limitations of the network, such load balancing of jobs or tasks may be impossible. In this context, a natural question arises: how to measure the load balancing characteristics of a network? In this paper, we propose new parameters that measure the load balancing characteristics of a network. Our parameters take into consideration the existence and structure of replacement subnetworks. We show that many existing networks like rings, trees, meshes and hypercubes have very poor load balancing characteristics. We believe that these parameters will enhance our understanding of fault tolerant and load balanced high performance computer networks.

Original languageEnglish (US)
Pages1409-1413
Number of pages5
StatePublished - Dec 1 1990
EventProceedings of the Twenty-First Annual Pittsburgh Conference Part 4 (of 5) - Pittsburgh, PA, USA
Duration: May 3 1990May 4 1990

Other

OtherProceedings of the Twenty-First Annual Pittsburgh Conference Part 4 (of 5)
CityPittsburgh, PA, USA
Period5/3/905/4/90

Fingerprint

Resource allocation
Computer networks
Throughput

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Boals, A., Sherwani, N. A., Abuelyaman, E., & Ali, H. H. (1990). Load balancing characteristics of networks. 1409-1413. Paper presented at Proceedings of the Twenty-First Annual Pittsburgh Conference Part 4 (of 5), Pittsburgh, PA, USA, .

Load balancing characteristics of networks. / Boals, Alfred; Sherwani, Naveed A.; Abuelyaman, Eltayeb; Ali, Hesham H.

1990. 1409-1413 Paper presented at Proceedings of the Twenty-First Annual Pittsburgh Conference Part 4 (of 5), Pittsburgh, PA, USA, .

Research output: Contribution to conferencePaper

Boals, A, Sherwani, NA, Abuelyaman, E & Ali, HH 1990, 'Load balancing characteristics of networks', Paper presented at Proceedings of the Twenty-First Annual Pittsburgh Conference Part 4 (of 5), Pittsburgh, PA, USA, 5/3/90 - 5/4/90 pp. 1409-1413.
Boals A, Sherwani NA, Abuelyaman E, Ali HH. Load balancing characteristics of networks. 1990. Paper presented at Proceedings of the Twenty-First Annual Pittsburgh Conference Part 4 (of 5), Pittsburgh, PA, USA, .
Boals, Alfred ; Sherwani, Naveed A. ; Abuelyaman, Eltayeb ; Ali, Hesham H. / Load balancing characteristics of networks. Paper presented at Proceedings of the Twenty-First Annual Pittsburgh Conference Part 4 (of 5), Pittsburgh, PA, USA, .5 p.
@conference{a956be54cbf34af6930a90b1bc52358c,
title = "Load balancing characteristics of networks",
abstract = "Not much attention has been paid to the design of networks that can tolerate failure of one or more processor and perform efficiently in the presence of faulty processor(s). As computer networks of the future will be required to support several (hundred) users concurrently, not only functionality but also performance must be guaranteed by the network. In case of single or multiple processor failure, the network must automatically rebalance the load and the system throughput must be minimally affected. However, due the structural limitations of the network, such load balancing of jobs or tasks may be impossible. In this context, a natural question arises: how to measure the load balancing characteristics of a network? In this paper, we propose new parameters that measure the load balancing characteristics of a network. Our parameters take into consideration the existence and structure of replacement subnetworks. We show that many existing networks like rings, trees, meshes and hypercubes have very poor load balancing characteristics. We believe that these parameters will enhance our understanding of fault tolerant and load balanced high performance computer networks.",
author = "Alfred Boals and Sherwani, {Naveed A.} and Eltayeb Abuelyaman and Ali, {Hesham H.}",
year = "1990",
month = "12",
day = "1",
language = "English (US)",
pages = "1409--1413",
note = "Proceedings of the Twenty-First Annual Pittsburgh Conference Part 4 (of 5) ; Conference date: 03-05-1990 Through 04-05-1990",

}

TY - CONF

T1 - Load balancing characteristics of networks

AU - Boals, Alfred

AU - Sherwani, Naveed A.

AU - Abuelyaman, Eltayeb

AU - Ali, Hesham H.

PY - 1990/12/1

Y1 - 1990/12/1

N2 - Not much attention has been paid to the design of networks that can tolerate failure of one or more processor and perform efficiently in the presence of faulty processor(s). As computer networks of the future will be required to support several (hundred) users concurrently, not only functionality but also performance must be guaranteed by the network. In case of single or multiple processor failure, the network must automatically rebalance the load and the system throughput must be minimally affected. However, due the structural limitations of the network, such load balancing of jobs or tasks may be impossible. In this context, a natural question arises: how to measure the load balancing characteristics of a network? In this paper, we propose new parameters that measure the load balancing characteristics of a network. Our parameters take into consideration the existence and structure of replacement subnetworks. We show that many existing networks like rings, trees, meshes and hypercubes have very poor load balancing characteristics. We believe that these parameters will enhance our understanding of fault tolerant and load balanced high performance computer networks.

AB - Not much attention has been paid to the design of networks that can tolerate failure of one or more processor and perform efficiently in the presence of faulty processor(s). As computer networks of the future will be required to support several (hundred) users concurrently, not only functionality but also performance must be guaranteed by the network. In case of single or multiple processor failure, the network must automatically rebalance the load and the system throughput must be minimally affected. However, due the structural limitations of the network, such load balancing of jobs or tasks may be impossible. In this context, a natural question arises: how to measure the load balancing characteristics of a network? In this paper, we propose new parameters that measure the load balancing characteristics of a network. Our parameters take into consideration the existence and structure of replacement subnetworks. We show that many existing networks like rings, trees, meshes and hypercubes have very poor load balancing characteristics. We believe that these parameters will enhance our understanding of fault tolerant and load balanced high performance computer networks.

UR - http://www.scopus.com/inward/record.url?scp=0025543910&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025543910&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0025543910

SP - 1409

EP - 1413

ER -