Golden ratio scheduling for low delay flow control in computer networks

Shivendra Panwar, T. K. Philips, M. S. Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The authors present a scheme for flow control based on the golden ratio policy of A. Itai and Z. Rosberg (1984) that requires very few buffers and guarantees low end-to-end delays. Messages are formed into equal length packets and then transmitted in accordance with a cyclic schedule. The scheme is very well suited to an asynchronous time-division multiplexing (ATM) environment as it allows the network capacity to be allotted to sessions in any desired proportion. It is concluded that the implementation is quite simple.

Original languageEnglish (US)
Title of host publicationIEEE Global Telecommun Conf and Exhib Commun for the Inf Age Conf Rec
PublisherPubl by IEEE
Pages1113-1118
Number of pages6
StatePublished - 1988

Fingerprint

Time division multiplexing
Computer networks
Flow control
Scheduling

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Panwar, S., Philips, T. K., & Chen, M. S. (1988). Golden ratio scheduling for low delay flow control in computer networks. In IEEE Global Telecommun Conf and Exhib Commun for the Inf Age Conf Rec (pp. 1113-1118). Publ by IEEE.

Golden ratio scheduling for low delay flow control in computer networks. / Panwar, Shivendra; Philips, T. K.; Chen, M. S.

IEEE Global Telecommun Conf and Exhib Commun for the Inf Age Conf Rec. Publ by IEEE, 1988. p. 1113-1118.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Panwar, S, Philips, TK & Chen, MS 1988, Golden ratio scheduling for low delay flow control in computer networks. in IEEE Global Telecommun Conf and Exhib Commun for the Inf Age Conf Rec. Publ by IEEE, pp. 1113-1118.
Panwar S, Philips TK, Chen MS. Golden ratio scheduling for low delay flow control in computer networks. In IEEE Global Telecommun Conf and Exhib Commun for the Inf Age Conf Rec. Publ by IEEE. 1988. p. 1113-1118
Panwar, Shivendra ; Philips, T. K. ; Chen, M. S. / Golden ratio scheduling for low delay flow control in computer networks. IEEE Global Telecommun Conf and Exhib Commun for the Inf Age Conf Rec. Publ by IEEE, 1988. pp. 1113-1118
@inproceedings{411094817c85472f8f428314fbd76a05,
title = "Golden ratio scheduling for low delay flow control in computer networks",
abstract = "The authors present a scheme for flow control based on the golden ratio policy of A. Itai and Z. Rosberg (1984) that requires very few buffers and guarantees low end-to-end delays. Messages are formed into equal length packets and then transmitted in accordance with a cyclic schedule. The scheme is very well suited to an asynchronous time-division multiplexing (ATM) environment as it allows the network capacity to be allotted to sessions in any desired proportion. It is concluded that the implementation is quite simple.",
author = "Shivendra Panwar and Philips, {T. K.} and Chen, {M. S.}",
year = "1988",
language = "English (US)",
pages = "1113--1118",
booktitle = "IEEE Global Telecommun Conf and Exhib Commun for the Inf Age Conf Rec",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Golden ratio scheduling for low delay flow control in computer networks

AU - Panwar, Shivendra

AU - Philips, T. K.

AU - Chen, M. S.

PY - 1988

Y1 - 1988

N2 - The authors present a scheme for flow control based on the golden ratio policy of A. Itai and Z. Rosberg (1984) that requires very few buffers and guarantees low end-to-end delays. Messages are formed into equal length packets and then transmitted in accordance with a cyclic schedule. The scheme is very well suited to an asynchronous time-division multiplexing (ATM) environment as it allows the network capacity to be allotted to sessions in any desired proportion. It is concluded that the implementation is quite simple.

AB - The authors present a scheme for flow control based on the golden ratio policy of A. Itai and Z. Rosberg (1984) that requires very few buffers and guarantees low end-to-end delays. Messages are formed into equal length packets and then transmitted in accordance with a cyclic schedule. The scheme is very well suited to an asynchronous time-division multiplexing (ATM) environment as it allows the network capacity to be allotted to sessions in any desired proportion. It is concluded that the implementation is quite simple.

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

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

M3 - Conference contribution

SP - 1113

EP - 1118

BT - IEEE Global Telecommun Conf and Exhib Commun for the Inf Age Conf Rec

PB - Publ by IEEE

ER -