TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
Simulation-based comparisons of Tahoe, Reno and SACK TCP
ACM SIGCOMM Computer Communication Review
Forward acknowledgement: refining TCP congestion control
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Fixed point approximations for TCP behavior in an AQM network
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
TCP westwood: end-to-end congestion control for wired/wireless networks
Wireless Networks
On the Use of Queueing Network Models to Predict the Performance of TCP Connections
IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
Modeling Short-Lived TCP Connections with Open Multiclass Queuing Networks
PIHSN '02 Proceedings of the 7th IFIP/IEEE International Workshop on Protocols for High Speed Networks
Sender-Side TCP Modifications: An Analytical Study
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
An efficient technique to analyze the impact of bursty TCP traffic in wide-area networks
Performance Evaluation
| Hi-index | 0.00 |
Protocol design and modification was traditionally based on heuristic processes and decisions. In particular several new versions of TCP have been proposed which not always stand up to their expectations when they are deployed or simply simulated in a real scenario. The closed-loop, nonlinear characteristics of TCP makes it very difficult to predict its performance in even simple scenarios. This papers analyses the process of modeling TCP-SACK with an Open Multiclass Queueing Network (OMQN) model, showing that sometimes simple implementation choices can have a non-marginal impact on the performance and discussing how an analytical model can be used to design and study TCP (or other protocols) modifications and improvements. As an example we present a modified, more robust implementation of TCP-SACK, named R-SACK, that significantly reduces the protocol timeout probability in presence of bursty losses.