Abstract
The paper describes a new admission control (AC) algorithm for greedy TCP connections. The algorithm has passed positive tests in pre-production QoS EP network [2], developed inside European IST project AQUILA1 network. The algorithm operates per single TCP flow and it assumes the setting of advertised receiver TCP window size for maintaining ideal TCP behaviour (no packet losses). The QoS objective is to guarantee the requested bit rate, say Rreq, a user demands from the network. Furthermore, on the basis of the Rreq and information about round trip time (RTT), the user request is mapped into the form of single token bucket parameters, i.e. token accumulating rate (R) and bucket size (BS), constituting input parameters for AC decision. For admitted TCP connection the Rreq is guaranteed, even if running connections differ in Rreq and RTTmin| Included simulation results confirm the efficiency of the algorithm.
European IST project „AQUILA — Adaptive Resource Control for QoS in IP-based Layered Architecture“ (2000–2003)
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
Allman, M., Paxson, V., Stevens, W.: TCP Congestion Control. Internet RFC 2581, April 1999
Bak, A, Burakowski, W., Ricciato, F., Salsano, S., Tarasiuk, H.: Traffic handling in AQUILA QoS IP Networks. Qxiality of Future Internet Services, Lecture Notes in Computer Science 2156, Springer 2001
Benameur, M., Ben Fredj, S., Delcoigne, F., Oueslati-Boulahia, S., and Roberts, J.W.: Integrated Admission Control for Streaming and Elastic Traffic. Quality of Future Internet Services, Lecture Notes in Computer Science 2156, Springer 2001
Blake, S. et al.: An Architecture for Differentiated Services. Internet RFC 2475, December 1998
Bemet, Y. et al.: An Informal Management Model for Diffserv Routers. Internet Draft, draft-ietf-diffserv-model-06.txt, February 2001
ElAarag, H., Bassiouni, M.: Performance evaluation of TCP connections in ideal and non-ideal network environments. Computer Communications 24(2001), pp. 1769–1776
Padhye, J., Firoiu, V., Towsley, D., Kurose, J.: Modeling TCP Throughput: A Simple Model and its Empirical Validation. Proc. ACM SIGCOM’98, August 1998
Roberts, J., Mocci, U., Virtamo J. (eds.): Final report COST 242, Broadband network teletraffic: Performance evaluation and design of broadband multiservice networks. Lectures Notes in Computer Science 1155, Springer 1996
Sahu, S., Nain, P., Towsley, D., Diot, C, Firoiu, V.: On Achievable Service Differentiation with Token Bucket Marking for TCP. Proc. ACM SIGMETRICS’00, Santa Clara, CA, June 2000
Stevens, W.R.: TCP/IP Illustrated, Volumel: The Protocols. Addison-Wesley Publishing Company, 1996
Stevens, W.R.: TCP/IP Illustrated, Volume2: The Implementation. Addison-Wesley Publishing Company, 1996
Stevens, W.R.: TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms. Internet RFC 2001, January 1997
Mortier, R, Pratt, I., Clark, C, and Crosby, S.: Implicit Admission Control. IEEE Journal on Selected Areas in Communications, Vol. 18, No. 12, December 2000
Brichet, F., Mandjes, M., Sanchez-Canabate, M.F.: Admission control in multiservice networks. Proceeding of the Mid-Term Seminar, 1999, Villamora, Portugal
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burakowski, W., Tarasiuk, H. (2003). Admission Control for TCP Connections in QoS IP Network. In: Chung, CW., Kim, CK., Kim, W., Ling, TW., Song, KH. (eds) Web and Communication Technologies and Internet-Related Social Issues — HSI 2003. HSI 2003. Lecture Notes in Computer Science, vol 2713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45036-X_39
Download citation
DOI: https://doi.org/10.1007/3-540-45036-X_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40456-9
Online ISBN: 978-3-540-45036-8
eBook Packages: Springer Book Archive