FAIRNESS UNDER SUSTAINED OVERLOAD IN A DQDB SUBNETWORK WITH ERASER NODES

Leith H. CAMPBELL, Philip G. POTTER, Moshe ZUKERMAN

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

Fairness criteria are proposed for the apportionment of throughput among the different stations for a DQDB (distributed-queue dual-bus) subnetwork involving eraser nodes under sustained overload. These criteria are based on maximizing the minimum throughput available to any station. Idealistic values of capacity apportionment for each active station are analytically computed by a recursive procedure. These idealistic values provide a quantitative standard against which the fairness of proposed eraser node protocols may be assessed. A numerical example is used to provide a detailed demonstration of the method for capacity apportionment.
Original languageEnglish
Title of host publicationIEEE International Conference on Communications, 1991 (ICC '91) - Conference Record
PublisherIEEE
Pages1038-1042
Volume2
ISBN (Print)0780300068
DOIs
Publication statusPublished - Jun 1991
Externally publishedYes
EventInternational Conference on Communications (ICC 91) - Denver, United States
Duration: 23 Jun 199126 Jun 1991

Publication series

Name
ISSN (Electronic)0536-1486

Conference

ConferenceInternational Conference on Communications (ICC 91)
PlaceUnited States
CityDenver
Period23/06/9126/06/91

Fingerprint

Dive into the research topics of 'FAIRNESS UNDER SUSTAINED OVERLOAD IN A DQDB SUBNETWORK WITH ERASER NODES'. Together they form a unique fingerprint.

Cite this