(Enter summary)
Abstract: This paper studies a simple strategy, proposed independently by Gallager [1] and Katevenis [2], for
fairly allocating link capacity in a point-to-point packet network with virtual circuit routing. Each link
offers its packet transmission slots to its user sessions by polling them in round-robin order. In addition,
window flow control is used to prevent excessive packet queues at the network nodes. As the window
size increases, the session throughput rates are shown to approach limits that are... (Update)
Cited by: More
HG-RCP: A Rate-Based Traffic Management Mechanism for.. - Hassan, Breen (1997)
(Correct)
A Congestion Control Algorithm for Max-Min Resource.. - Lestas, Ioannou, al.
(Correct)
Analysis of Binary Adjustment Algorithms in Fair.. - Sergey Gorinsky Harrick (2000)
(Correct)
Active bibliography (related documents): More All
1.3: Why is Flow Control Hard: Optimality, Fairness, Partial and.. - Korilis, Lazar (1992)
(Correct)
0.9: Packet-Pair Flow Control - Keshav (1994)
(Correct)
0.6: A Class of End-to-End Congestion Control Algorithms for.. - Golestani, Bhattacharyya (1998)
(Correct)
Similar documents based on text: More All
0.2: Multipoint-to-Point Session Fairness in the Internet - Karbhari, Zegura, Ammar (2003)
(Correct)
0.1: A Theory Of Maxmin Bottleneck Ordering - Ros, Tsai (2000)
(Correct)
0.1: An Optimal Distributed Protocol For Fast Convergence To Maxmin.. - Ros, Tsai (2000)
(Correct)
Related documents from co-citation: More All
23: Analysis and simulation of a fair queueing algorithm (context) - Demers, Keshav et al. - 1990
18: An algorithm for rate allocation in a packet-switching network with feedback
- Charny - 1994
16: A generalized processor sharing approach to flow control - the single node case (context) - Parekh, Gallager - 1992
BibTeX entry: (Update)
E. Hahne. Round-Robin Scheduling for MaxMin Fairness in Data Networks. IEEE Journal on Selected Areas in Communications, 9(7), September 1991. http://citeseer.ist.psu.edu/hahne91roundrobin.html More
@article{ hahne91roundrobin,
author = "Ellen L. Hahne",
title = "Round-Robin Scheduling for Max-Min Fairness in Data Networks",
journal = "IEEE Journal of Selected Areas in Communications",
volume = "9",
number = "7",
pages = "1024-1039",
year = "1991",
url = "citeseer.ist.psu.edu/hahne91roundrobin.html" }
Citations (may not include all citations):
1330
Congestion Avoidance and Control
- Jacobson - 1988
790
Analysis and Simulation of a Fair Queueing Algorithm (context) - Demers, Keshav et al. - 1989
223
A Binary Feedback Scheme for Congestion Avoidance in Compute..
- Ramakrishnan, Jain - 1988
186
Rate Controlled Servers for Very High-Speed Networks
- Kalmanek, Kanakia et al. - 1990
96
A Delay-Based Approach for Congestion Avoidance in Interconn..
- Jain - 1989
70
Bottleneck Flow Control (context) - Jaffe - 1981
64
A New Architecture for Packet Switching Network Protocols (context) - Zhang - 1989
62
Flow Control: A Comparative Survey (context) - Gerla, Kleinrock - 1980
46
Dynamic Adaptive Windows for High Speed Data Networks: Theor.. (context) - Mitra, Seery - 1990
46
Dynamic Adaptive Windows for High Speed Data Networks with M.. (context) - Mitra, Seery - 1991
45
Open, Closed, and Mixed Networks of Queues with Different Cl.. (context) - Baskett - 1975
40
A Timeout-Based Congestion Control Scheme for Window Flow-Co..
- Jain - 1986
38
New York: Wiley (context) - Billingsley, Measure - 1986
37
Round Robin Scheduling for Fair Flow Control in Data Communi.. (context) - Hahne - 1986
37
Round Robin Scheduling for Fair Flow Control in Data Communi.. (context) - Hahne, Gallager - 1986
37
A Simulation Study of Fair Queueing and Policy Enforcement (context) - Davin, Heybey - 1990
37
Finite Markov Processes and Their Applications (context) - Iosifescu - 1980
29
Dynamic Control of Session Input Rates in Communication Netw.. (context) - Gafni, Bertsekas - 1984
23
Voice Flow Control in Integrated Packet Networks (context) - Hayden - 1981
22
A Technique for Adaptive Voice Flow Control in Integrated Pa.. (context) - Bially, Gold et al. - 1980
19
A New Approach to Performance-Oriented Flow Control (context) - Bharath-Kumar, Jaffe - 1981
14
Fast Switching and Fair Control of Congested Flow in Broadba.. (context) - Katevenis - 1987
13
Design and Analysis of a Flow Control Algorithm for a Networ.. (context) - Keshav, Agrawala et al.
13
Flow Control and Routing Algorithms for Data Networks (context) - Gallager, Golestaani - 1980
13
Flow Control Power is Nondecentralizable (context) - Jaffe - 1981
13
Queueing Disciplines and Passive Congestion Control in Byte-.. (context) - Morgan - 1989
13
Towards a Universal Data Transport System (context) - Fraser - 1983
12
A Queueing Network Analysis of Computer Communication Networ.. (context) - Reiser - 1979
11
The Integration of Routing and Flow-Control for Voice and Da.. (context) - Gafni - 1982
10
Fairness and Congestion Control on a Large ATM Data Network (context) - Hahne, Kalmanek et al. - 1991
9
A Proof of the Queueing Formula L=lW (context) - Little - 1961
7
Asynchronous Distributed Flow Control Algorithms (context) - Mosely - 1984
6
Fairness in Computer Networks (context) - Gerla, Chan et al. - 1985
3
Fairness in Flow Controlled Networks (context) - Gerla, Staskauskas - 1981
3
Routing, Flow Control and Fairness in Computer Networks (context) - Gerla, Chan et al. - 1984
3
Interactions Between Routing and Flow Control Algorithms (context) - Thaker, Cain - 1986
3
Throughput Analysis of a Window-Based Flow Control Subject t.. (context) - Luan, Lucantoni - 1988
2
Window Flow Control on a Trunked Byte-Stream Virtual Circuit (context) - Morgan - 1988
2
A Unified Theory of Flow Control and Routing in Data Communi.. (context) - Golestaani - 1980
2
Maximum Delay in Buffered Multistage Interconnection Network.. (context) - Cruz - 1988
2
A Schedule-Based Approach for Flow-Control in Data Communica.. (context) - Mukherji - 1986
2
A Schedule-Based Approach for Flow-Control in Data Communica.. (context) - Mukherji - 1986
2
Resource Allocation among Competing Activities: A Lexicograp.. (context) - Luss, Smith - 1986
2
Comparison of a Fair Queueing Discipline to Processor Sharin.. (context) - Greenberg, Madras - 1990
1
A Decentralized (context) - Jaffe - 1980
1
Golden Ratio Scheduling for Low Delay Flow Control in Comput.. (context) - Panwar, Philips et al. - 1988
1
Overload Performance of an Adaptive, Buffer-Window Allocatio.. (context) - Doshi, Heffes - 1991
1
Use of Fair Rate Assignment Algorithms in Networks with Burs.. (context) - Oshinsky - 1984
1
Round-Robin Scheduling and Window Flow Control for Max-Min F.. (context) - Hahne - 1987
1
On Throughput and Fairness in Packet Switching Networks with.. (context) - Sauve, Wong et al. - 1981
1
Improving Total Throughput in Packet Switching Networks with.. (context) - Sauve, Wong et al. - 1982
1
Flow Control and Routing in an Integrated Voice and Data Com.. (context) - Ibe - 1981
1
Adaptive Session-Level Pacing (context) - Barzilai - 1988
1
Networks of Queues --- A Survey of Equilibrium Analysis (context) - Lemoine - 1977
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.bell-labs.com/user/hahne/index.html): More
Multi-Access Mesh (Multimesh) Networks - Todd, Hahne (1997)
(Correct)
DQDB Networks with and without Bandwidth Balancing - Hahne, Choudhury, Maxemchuk (1992)
(Correct)
New Implementation of Multi-Priority Pushout for Shared.. - Choudhury, Hahne (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC