Paper Info
Title
A Theory of Temporal-Spatial Flow Control: The Case of Single Bottleneck Link
Abstract
This paper presents a theory of spatial-temporal flow control, the case of a single bottleneck link, for a network with dynamic available bandwidth. For this class of flow control, when the sources receive the feedback from the network, they schedule their rates considering both the amount of available resources as well as a timely allocation of these resources. With the theory developed in this paper, a protocol which ensures maximal utilization of the bandwidth, minimal queue size in the link and fairness among the sources is proposed. With this protocol, the sources estimate the amount of congestion they are producing at the bottleneck and the queue size at the bottleneck can be remotely controlled.
Year
DOI
Venue
1999
10.1109/ICON.1999.796160
Networks, 1999.
Keywords
Field
DocType
minimal queue size,queue size,temporal-spatial flow control,available resource,timely allocation,maximal utilization,flow control,dynamic available bandwidth,single bottleneck link,spatial-temporal flow control,bandwidth allocation,time allocation,protocols,queueing theory,feedback,scheduling
Max-min fairness,Bottleneck,Computer science,Bandwidth allocation,Computer network,Queueing theory,Flow control (data),Dynamic bandwidth allocation,Network traffic control,Bandwidth management,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-0243-1
1
0.37
References 
Authors
5
2
Name
Order
Citations
PageRank
jordi ros1193.54
Wei K. Tsai210311.47