Modeling TCP/RED - approximate performance evaluation using an analytical queueing approach

• Autorzy: Świderski, J.
• Języki publikacji: EN

Abstrakty

EN

This paper is concerned with the approximate performance analysis of TCP Reno connections coexisting with flows that are not TCP-friendly (i.e. flows that use more bandwidth than would any conformant TCP implementation in the same circumstances). The network model is based on two earlier models. The first model enables one to calculate the TCP send rate which is the amount of data sent by the sender in unit time. This model has been presented in [6] and captures the behavior of both the fast retransmit and time-out mechanisms. The send rate for a given TCP connection can be calculated assuming that the round trip time, the time-out and the loss probability are known for this connection. These quantities can be determined using the second model – the queueing network model that represents an IP network and has been introduced in [13]. It enables one to include the Random Early Detection (RED) queue based active queue management (AQM) scheme that can be met in today’s routers.

Słowa kluczowe

EN

TCP protocol; RED; queueing analysis; performance evaluation

• Czasopismo: Systems Science
• Rocznik: 2006
• Tom: Vol. 32, no 3
• Strony: 109-117
• Opis fizyczny: Bibliogr. 13 poz., wykr.

Twórcy

autor

Świderski, J.

• Institute of Power Engineering, Gdańsk Division, ul. M. Reja 27, 80-870 Gdańsk, Poland,

Bibliografia

• [1] Cardwell N., Savage S., Modelling TCP latency, Proc. IEEE Infocom 2000.
• [2] Floyd S., Promoting the use of end-to end congestion control in the Internet, IEEE/ACM Trans. Networking, Vol. 7, No. 4, 1999, pp. 458-472.
• [3] Floyd S., Jacobson V., Random Early Detection gateways for congestion avoidance, IEEE/ACM Trans. Networking, Vol. 1, No. 4, 1993, pp. 397-413.
• [4] Jacobson V., Congestion avoidance and control, Computer Communication Review, Vol. 18, No. 4, 1988, pp. 314-329.
• [5] Kleinrock L., Communication Nets. StochasticMessage Flow and Delay, McGraw Hill Book Company, 1964.
• [6] Kwon M., Fahmy S., A comparison of load-based and queue-based active queue management active queue management algorithms, Proc. SPIE ITCom, Vol. 4866, August 2002.
• [7] Ott T.J.. Lakshman T.V., Wong L., SRED: Stabilized RED, Proc. IEEE Infocom, March 1999.
• [8] Padhye J., Firoiu V., Towsley D.F., Kurose J.F., Modeling TCP Reno performance: A simple model and its empirical validation. IEEE/ACM Trans. Networking, Vol. 8, No. 2, 2000, pp. 133-145.
• [9] Padhye J., Floyd S.. On inferring TCP behavior, ACM SIGCOMM Commun. Review, Vol. 31, No. 4, 2001, pp. 287-298.
• [10] Reiser M., Kobayashi H., Queueing networks with multiple closed chains: theory and computational algorithms, IBM Journal of Research and Development, Vol. 19, 1975, pp. 283-294.
• [11] RFC 2309, Recommendations on queue management and congestion avoidance in the Internet, April 1998.
• [12] Sikdar B., Kalyanaraman S., Vastola K.S., Analytic models for the latency and steady-state throughput of TCP Tahoe, Reno and SACK, IEEE/ACM Trans. Networking, Vol. 11, No. 6, 2003, pp. 959-971.
• [13] Świderski J., Unified analysis of local flow control mechanisms in message-switched networks, IEEE Trans. Commun., Vol. COM-32, 1984, pp. 1286-1293.