We study the throughput vs. window-size behavior of the sliding-window protocolon a trunked byte-stream virtual circuit where the node service discipline is processor sharing, background traffic is Poisson with exponentially distributed message lengths, propagation times are a significant fraction of the total delay, and the channel error rate is negligible. For small windows, the throughput is...

We develop a model for TCP that accounts for both sublinearity and limitation of window increase. Sublinear window growth is observed when the round-trip time of the connection increases with the window size. The limitation is due to the window advertised by the receiver. First, we derive the required conditions for the stability of the model. Then, we write the Kolmogorov equation under Markov...