Abstract
Many studies explored the guaranteed TCP throughput problem in DiffServ networks. Several new marking schemes have been proposed in order to solve this problem. Even if these marking schemes give good results in the case of per-flow conditioning, they need complex measurements. In this paper we propose a conditioning method to reduce these complex measurements and an AIMD Penalty Shaper (APS) which is able to profile a set of TCP flows so as to improve its conformance to a desired target rate. The main novelty of this shaper is that the shaping applies an AIMD penalty delay which depends on the out-profile losses in a DiffServ network. This penalty shaping can be used with any classic conditionner such as a token bucket marker (TBM) or a time sliding window marker. We made an evaluation of the APS on a real testbed and showed that the proposed scheme is easily deployable and allows for a set of TCP flows to achieve its target rate.
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.
Similar content being viewed by others
References
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An architecture for differentiated services. In: Request For Comments. IETF, vol. 2475 (1998)
Seddigh, N., Nandy, B., Pieda, P.: Bandwidth assurance issues for TCP flows in a differentiated services network. In: Proc. of IEEE GLOBECOM, Rio De Janeiro, Brazil, p. 6 (1999)
Goyal, M., Durresi, A., Jain, R., Liu, C.: Performance analysis of assured forwarding. Internet draft, IETF, draft-goyal-diffserv-afstdy-00.txt (2000)
Park, E.C., Choi, C.H.: Proportionnal bandwidth allocation in diffserv networks. In: Proc. of IEEE INFOCOM, Hong Kong (2004)
Alves, I., de Rezende, J.F., de Moraes, L.F.: Evaluating fairness in aggregated traffic marking. In: Proc. of IEEE GLOBECOM (2000)
El-Gendy, M., Shin, K.: Assured forwarding fairness using equation-based packet marking and packet separation. Computer Networks 41, 435–450 (2002)
Kumar, K., Ananda, A., Jacob, L.: A memory based approach for a TCP-friendly traffic conditioner in diffserv networks. In: Proc. of the IEEE International Conference on Network Protocols - ICNP, Riverside, California, USA (2001)
Feroz, A., Rao, A., Kalyanaraman, S.: A TCP-friendly traffic marker for IP differentiated services. In: Proc. of IEEE/IFIP International Workshop on Quality of Service - IWQoS (2000)
Habib, A., Bhargava, B., Fahmy, S.: A round trip time and time-out aware traffic conditioner for differentiated services networks. In: Proc. of the IEEE International Conference on Communications - ICC, New-York, USA (2002)
Floyd, S., Fall, K.: Promoting the use of end-to-end congestion control in the Internet. IEEE/ACM Transactions on Networking 7, 458–472 (1999)
Yeom, I., Reddy, N.: Realizing throughput guarantees in a differentiated services network. In: Proc. of IEEE International Conference on Multimedia Computing and Systems- ICMCS, Florence, Italy, vol. 2, pp. 372–376 (1999)
Clark, D., Fang, W.: Explicit allocation of best effort packet delivery service. IEEE/ACM Transactions on Networking 6, 362–373 (1998)
Ramakrishnan, K., Floyd, S.: A proposal to add explicit congestion notification. Request for comments, IETF (1998)
Fang, W., Seddigh, N.: A time sliding window three colour marker. In: Request For Comments. IETF, vol. 2859 (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
Lochin, E., Anelli, P., Fdida, S. (2005). AIMD Penalty Shaper to Enforce Assured Service for TCP Flows. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-31957-3_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25338-9
Online ISBN: 978-3-540-31957-3
eBook Packages: Computer ScienceComputer Science (R0)