Golden ratio scheduling for flow control with low buffer requirements

A method of flow control that requires very few buffers to be allocated at each node to virtual circuits (or sessions) that have to transverse many links is described. Transmissions are scheduled using the golden ratio policy of A. Itai and Z. Rosberg (1984). It is shown that the buffer requirements...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 1992-04, Vol.40 (4), p.765-772
Main Authors: Panwar, S.S., Philips, T.K., Chen, M.-S.
Format: Article
Language:English
Subjects:
Applied sciences
Asynchronous transfer mode
Circuits
Communication networks
Communication system traffic control
Computer networks
Delay
Exact sciences and technology
Packet switching
Processor scheduling
Proportional control
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
Time division multiple access
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A method of flow control that requires very few buffers to be allocated at each node to virtual circuits (or sessions) that have to transverse many links is described. Transmissions are scheduled using the golden ratio policy of A. Itai and Z. Rosberg (1984). It is shown that the buffer requirements of a session grow at most logarithmically with the number of slots allotted to it. As an immediate consequence, intra-network delays are bounded.< >
ISSN:0090-6778
1558-0857
DOI:10.1109/26.141432