Abstract
TCP flows generated by applications such as the web or ftp require a minimum network throughput to satisfy users. To build this service, we propose a scheme with Admission Control (AC) using a small set of packet classes in a core-stateless network. At the ingress 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 it requires flows to be sent at a minimum rate. The scheme is able to provide different throughput to different flows and protection against non-responsive sources. We evaluate the scheme through simulation in several network topologies with different traffic loads consisting of TCP flows that carry files of varying sizes. In the simulation, TCP uses a new algorithm to keep the short-term sending rate above a minimum value. The results prove that the scheme guarantees the throughput to accepted flows and achieves high utilization of resources, similar to the ideal results of a classical hop-by-hop AC.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brownlee, N., Claffy, K. C.: Understanding Internet Traffic Streams: Dragonflies and Tortoises. IEEE Communications Magazine (2002)
Jacobson, V.: Congestion Avoidance and Control. ACM Computer Communication Review (1998)
Roberts, J. W., Massoulié, L.: Arguments in Favour of Admission Control for TCP flows. In: 16th ITC (1999)
Fàbrega, L.l., Jové, T., Donoso, Y.: Throughput Guarantees for Elastic Flows using End-to end Admission Control. IFIP/ACM LANC (2003)
Clark, D. D., Fang, W.: Explicit Allocation of Best-effort Packet Delivery Service. IEEE/ACM Transactions on Networking (1998)
Blake, S., Black, D., Carlson, M., Davies, E., Weiss, W., Wang, Z.: An Architecture for Differentiated Services. RFC 2475 (1998)
Mortier, R., Pratt, I., Clark, C., Crosby, S.: Implicit Admission Control. IEEE Journal on Selected Areas in Communications (2000)
Kumar, A., Hegde, M., Anand, S.V.R., Bindu, B.N., Thirumurthy, D., Kherani, A.A.: Nonintrusive TCP Connection Admission Control for Bandwidth Management of an Internet Access Link. IEEE Communications Magazine (2000)
Fredj, S. B., Oueslati-Boulahia, S., Roberts, J.W.: Measurement-based Admission Control for Elastic Traffic. ITC 17 (2001)
Bianchi, G., Capone, A., Petrioli, C.: Throughput Analysis of End-to-end Measurementbased Admission Control in IP. INFOCOM (2000)
Breslau, L., Knightly, E., Shenker, S., Stoica, I., Zhang, H.: Endpoint Admission Control: Architectural Issues and Performance. In: ACM SIGCOMM (2000)
Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol Label Switching Architecture. RFC 3031 (2001)
UCB/LBL/VINT Network Simulator – ns (version 2), http://www.isi.edu/nsnam/ns/
Fredj, S. B., Bonald, T., Proutière, A., Régnié, G., Roberts, J.W.: Statistical Bandwidth Sharing: a Study of Congestion at Flow Level. In: ACM SIGCOMM (2001)
Law, A.M., Kelton, W.D.: Simulation Modelling and Analysis. MacGraw-Hill, New York (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fàbrega, L., Jové, T., Vilà, P., Marzo, J. (2005). A Packet Class-Based Scheme for Providing Throughput Guarantees to TCP Flows. In: Magedanz, T., Madeira, E.R.M., Dini, P. (eds) Operations and Management in IP-Based Networks. IPOM 2005. Lecture Notes in Computer Science, vol 3751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11567486_9
Download citation
DOI: https://doi.org/10.1007/11567486_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29356-9
Online ISBN: 978-3-540-32096-8
eBook Packages: Computer ScienceComputer Science (R0)