TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
A stochastic model of TCP/IP with stationary random losses
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A mean-field model for multiple TCP connections through a buffer implementing RED
Performance Evaluation
Predicting bottleneck bandwidth sharing by generalized TCP flows
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance sensitivity and fairness of ECN-aware 'modified TCP'
Performance Evaluation
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
STOCHASTIC DIFFERENTIAL EQUATION FOR TCP WINDOW SIZE: ANALYSIS AND EXPERIMENTAL VALIDATION
Probability in the Engineering and Informational Sciences
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Stationarity of some processes in transport protocols
ACM SIGMETRICS Performance Evaluation Review
TCP and iso-stationary transformations
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
This article derives the transient behavior of the stochastic process X(t) for which in earlier articles it was proven that for αX(t))1/(1−α) (approximately, under low drop probability or ECN marking probability) describes the behavior of the congestion windows in certain transport protocols in the so-called TCP paradigm. The transient distribution is found explicitly and is particularly transparent for moments like E[(X(t))k |X(0)]. The purpose of this article is to be part of the mathematical foundation when comparing the many protocols in the TCP paradigm.