On the higher moments of TCP
| Autor: | Avi Berman, Fabian Wirth, Robert Shorten, Arieh Schlote |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Discrete mathematics
Kronecker product Numerical Analysis Algebra and Number Theory Markov chain Transmission Control Protocol Stochastic modelling Telecommunications network symbols.namesake Computer Science::Networking and Internet Architecture symbols Additive increase/multiplicative decrease Discrete Mathematics and Combinatorics Applied mathematics Geometry and Topology Closed-form expression Asymptote Mathematics |
| Zdroj: | Linear Algebra and its Applications. 439:899-913 |
| ISSN: | 0024-3795 |
| DOI: | 10.1016/j.laa.2012.07.046 |
| Popis: | In this paper we describe the moments of a stochastic model of the Additive Increase Multiplicative Decrease (AIMD) algorithm. AIMD is the algorithm that underpins the Transmission Control Protocol (TCP), which is used extensively in the internet. We prove that the Markov chain describing TCP has the remarkable property that all moments converge to their asymptotes at exactly the same rate. Further, we illustrate how a closed form solution can be obtained from the network properties, and this formula is explicitly calculated for the case of the third moment. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect