Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing

Performance Evaluation Review

Volumn 33, Issue 1, 2005, Pages 217-228

  Kortebi, A ^a   Muscariello, L ^b   Oueslati, S ^a   Roberts, J ^a  

^a ORANGE LABS   (France)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

Analytical traffic model; Fair queueing; Statistical bandwidth sharing; Trace simulations

Indexed keywords

BANDWIDTH; COMPUTER NETWORKS; COMPUTER SIMULATION; DATA ACQUISITION; INTERNET; TELECOMMUNICATION TRAFFIC;

ANALYTICAL TRAFFIC MODEL; FAIR QUEUEING; STATISTICAL BANDWIDTH SHARING; TRACE SIMULATIONS;

STATISTICAL METHODS;

EID: 33244461769     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/1071690.1064237     Document Type: Conference Paper

References (28)

1. D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, Englwood Cliffs, N.J., 1992.
2. E. L. Hahne, Round-Robin Scheduling for Max-Min Fairness in Data Networks, IEEE Journal on Selected Areas in Communications, Vol. 9, No. 7, Sep. 1991, Pages: 1024-1039.
3. B. Suter, T.V. Lakshman, D. Stiliadis, A.K. Choudhury; Buffer Management Schemes for Supporting TCP in Gigabit Routers with Per-Flow Queueing, IEEE Journal on Selected Areas in Communications, Aug. 1999.
4. F. P. Kelly, A.K. Maulloo and D.K.H. Tan, Rate Control in Communication Networks: Shadow Prices, Proportional Fairness and Stability, Journal of the Operational Research Society 49 (1998), Pages: 237-252.
5. T. Bonald, L. Massoulié, Impact of Fairness on Internet Performance, In Proc. of ACM SIGMETRICS / IFIP Performance, 2001.
6. J. Nagle, On Packet Switches with Infinite Storage, RFC 970, IETF, 1985.
7. P. Goyal, H. Vin, H. Cheng. Start-time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks, IEEE/ACM Transactions on Networking, Vol. 5, No. 5, Oct 1997, Pages: 690-704.
8. M. Shreedhar, G. Varghese, Efficient Fair Queueing Using Deficit Round Robin, IEEE/ACM Transactions on Networking, Vol. 4, No. 3, June 1996.
9. D. Lin, R. Morris, Dynamics of Random Early Detection, In Proc. of ACM SIGCOMM 1997.
10. R. Mahajan, S. Floyd, D. Weatherall, Controling High-Bandwidth Flows at the Congested Router, In Proc. of IEEE ICNP 2001.
11. R. Pan, L. Breslau, B. Prabhakar and S. Shenker, A Flow Table-Based Design to Approximate Fairness, In Proc. of Hot Interconnects, Palo Alto, California, Aug. 2002.
12. N. Brownlee, KC Claffy, Understanding Internet Traffic Streams: Dragonflies and Tortoises, IEEE Communications Magazine, Vol. 40, No. 10, Oct. 2002, Pages: 110-117.
13. S. Sarvotham, R. Riedi, R. Baraniuk, Connection-Level Analysis and Modeling of Network Traffic, In Proc. of ACM Internet Measurement Workshop 2001.
14. Y. Zhang, L. Breslau, V. Paxson, S. Shenker, On the Characteristics and Origins of Internet Flow Rates, In Proc. of ACM SIGCOMM 2002.
15. A. Kortebi, S. Oueslati, J. Roberts, Cross-protect: Implicit Service Differentiation and Admission Control, In Proc. of IEEE HPSR 2004.
16. A. Kortebi, L. Muscariello, S. Oueslati, J. Roberts, On the Scalability of Fair Queueing, In Proc. of ACM HotNets III 2004.
17. S. Floyd, V. Paxson. Difficulties in Simulating the Internet, IEEE/ACM Transactions on Networking, Vol. 9, No. 4, Aug. 2001, Pages: 392-403.
18. C. Fraleigh, S. Moon, B. Lyles, C. Cotton, M. Khan, D. Moll, R. Rockell, T. Seely, C. Diot, Packet-Level Traffic Measurements from the Sprint IP Backbone, IEEE Network, Vol. 17, No. 6, Nov.-Dec. 2003, Pages: 6-16.
19. L. Takàcs, Introduction to the Theory of Queues, Oxford University Press, 1962, New York.
20. S. Niu, R. Cooper, Duality and Other Results for M/G/1 and GI/M/1 Queues, via a New Ballot Theorem. Mathematics of Operations Research, Vol. 14, No. 2, 1989, Pages: 281-293.
21. T. Bonald, A. Proutière, Insensitivity in Processor Sharing Networks, In Proc. of IFIP Performance 2002.
22. T. Bonald, J. Virtamo, A recursive formula for multirate systems with elastic traffic, To appear in IEEE Communications Letters.
23. I. Stoica, S. Shenker, H. Zhang, Core-Stateless Fair Queueing: A scalable Architecture to Approximate Fair Bandwidth Allocations in High-Speed Networks.IEEE/ACM Transactions on Networking, Vol. 11, No. 1, Feb. 2003, Pages: 33-46.
24. G. Appenzeller, I. Keslassy, N. McKeown, Sizing router buffers, In Proc. of ACM Sigcomm, 2004.
25. A. Dhamdhere, H. Jiang, C. Dovrolis, Buffer sizing for congested Internet links, In Proc. of IEEE Infocom 2005.
26. S. Floyd, Highspeed TCP for Large Congestion Windows, IETF RFC 3649, December 2003.
27. T. Kelly, Scalable TCP: Improving Performance in Highspeed Wide Area Networks. Computer Communication Review 32(2), April 2003.
28. C. Jin, D. X. Wei, S. H. Low, FAST TCP: Motivation, Architecture, Algorithms, Performance, In Proc. of IEEE Infocom 2004.