Optimal Offline TCP Sender Buffer Management Strategy

Mugurel Ionut Andreica (1) , Nicolae Tapus (1)

1 Parallel and Distributed Systems Laboratory [Bucarest]

The Transmission Control Protocol (TCP) uses a sliding window in order to enforce flow control. The receiver advertises its available buffer space to the sender, which cannot transmit more data than the advertised space. Transmitted data is first copied from application buffers into TCP buffers and from there it is sent through the network. In this paper we propose a model which characterizes the sender's behavior throughout the duration of a TCP conversation. The model is suitable in the case of powerful, but variably loaded senders, slow receivers, fast connections and moderate amounts of data transmitted. For this model we present an O(n∙log2n) algorithm which computes the minimum processing time spent by the sender, if the window sizes advertised by the receiver and the sender's load are known in advance. The solution is based on an algorithmic framework for the segment tree data structure, which we introduce in this paper.

Domaines: Algorithme et structure de données [cs.DS]; Réseaux et télécommunications [cs.NI]

Mugurel Ionut Andreica, Nicolae Tapus. Optimal Offline TCP Sender Buffer Management Strategy. 1st IARIA/IEEE International Conference on Communication Theory, Reliability, and Quality of Service (CTRQ), Jun 2008, Bucharest, Romania. pp.41-46, ⟨10.1109/CTRQ.2008.11⟩. ⟨hal-00874062⟩