Throughput Guarantees for TCP Flows in a Network Based on Packet Classes Using Edge-to-Edge Per Flow Measurements

Abstract

TCP flows generated by applications such as the Web or FTP require a minimum network throughput and can also benefit from an extra throughput due to their rate-adaptive algorithms. To build a guaranteed minimum throughput service, the authors propose a scheme with Admission Control (AC) using a small set of packet classes in a core-stateless network. At the ingress of the network, each flow packet is marked as one of the set of classes, and within the network, each class is assigned a different discarding priority. The AC method is based on edge-to-edge per flow measurements and requires flows to be sent at a minimum rate. The scheme is able to provide different minimum throughput to different users and protection against nonresponsive sources. The authors evaluate the scheme through simulation using different traffic loads consisting of TCP flows that carry files of varying sizes. In the simulation, TCP uses a new algorithm that forces the source to keep the short-term sending rate above a desired minimum rate. The authors study the influence of several parameters on the performance of the scheme in different network topologies. The results show that the scheme guarantees the requested throughput to accepted flows and achieves a high utilization of network resources, similar to the ideal results of a classical hop-by-hop AC.

Keywords

Quality of service TCP guaranteed throughput service admission control elastic traffic

Get full access to this article

View all access options for this article.

References

Brownlee, N. , and K. C. Claffy . 2002. Understanding Internet traffic streams: Dragonflies and tortoises . IEEE Communications Magazine 40(10): 110-117 .

Jacobson, V. 1998. Congestionavoidanceandcontrol . ACM Computer Communication Review 18(4): 314-329 .

Roberts, J. W. , and L. Massoulié . 1999. Arguments in favor of admission control for TCP flows . In Proceedings of the 1999 16th ITC.

Fàbrega, Ll. , T. Jové , and Y. Donoso . 2003. Throughput guarantees for elastic flows using end-to-end admission control . In Proceedings of the 2003 IFIP/ACM LANC.

Clark, D. D. , and W. Fang . 1998. Explicit allocation of best-effort packet delivery service . In IEEE/ACM Transactions on Networking.

Blake, S. , D. Black , M. Carlson , E. Davies , W. Weiss , and Z. Wang . 1998. An architecture for Differentiated Services. RFC 2475.

Mortier, R. , I. Pratt , C. Clark , and S. Crosby . 2000. Implicit admission control . IEEE Journal on Selected Areas in Communications 18(12): 2629-2639 .

Kumar, A. , M. Hegde , S. V. R. Anand , B. N. Bindu , D. Thirumurthy , and A. A. Kherani . 2000. Nonintrusive TCP connection admission control for bandwidth management of an Internet access link . IEEE Communications Magazine 38(5): 160-167 .

Ben Fredj, S. , S. Oueslati-Boulahia , and J. W. Roberts . 2001. Measurement-based admission control for elastic traffic . In Proceedings of the 2001 ITC 17.

10.

Bianchi, G. , A. Capone , and C. Petrioli . 2000. Throughput analysis of end-to-end measurement-based admission control in IP . In Proceedings of the 2000 INFOCOM.

11.

Breslau, L. , E. Knightly , S. Shenker , I. Stoica , and H. Zhang . 2000. Endpoint admission control: Architectural issues and performance . In Proceedings of the 2000 ACM SIGCOMM.

12.

Rosen, E. , A. Viswanathan , and R. Callon . 2001. Multiprotocol label switching architecture. RFC 3031.

13.

[13] UCB/LBL/VINT Network Simulator—ns (version 2). http://www.isi.edu/nsnam/ns/

14.

Ben Fredj, S. , T. Bonald , A. Proutière , G. Régnié , and J. W. Roberts . 2001. Statistical bandwidth sharing: A study of congestion at flow level . In Proceedings of the 2001 ACM SIGCOMM.

15.

Law, A. M. , and W. David Kelton . 2000. Simulation modeling and analysis. New York: McGraw-Hill .