Exact sampling of TCP window states

Proceedings - IEEE INFOCOM - Tập 1 - Trang 259-265 vol.1
A. Goel1, M. Mitzenmacher2
1Department of Computer Science, University of Southern California, USA
2The Division of Engineering and Applied Sciences, Harvard University, USA

Tóm tắt

We demonstrate how to apply Coupling from the Past, a simulation technique for exact sampling, to Markov chains based on TCP variants. This approach provides a new, statistically sound paradigm for network simulations: instead of simulating a protocol over long times, or explicitly finding the stationary distribution of a Markov chain, use Coupling from the Past to quickly obtain samples from the stationary distribution. Coupling from the Past is most efficient when the underlying state space satisfies a partial order and certain monotonicity conditions. To efficiently apply this general paradigm to TCP, we demonstrate that the states of a simple TCP model possess a monotonic partial order; this order appears interesting in its own right. Preliminary simulation results indicate that this approach is quite efficient, and produces results which am similar to those obtained by simulating a TCP-Tahoe connection.

Từ khóa

#Sampling methods #State-space methods #Equations #Physics #Protocols #Stochastic processes #Throughput #Distributed computing #Computational modeling #Solid modeling

Tài liệu tham khảo

padhye, 1998, Modeling TCP throughput: A simple model and its empirical validation, ACM SIGCOMM '98 Conference on Applications Technologies Architectures and Protocols for Computer Communication, 303, 10.1145/285243.285291 10.1109/49.857929 0 padhye, 1999, A stochastic model of TCP Reno congestion avoidance and control misra, 2000, Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED, SIGCOMM, 151, 10.1145/347057.347421 mitzenmacher, 2001, Towards more complete models of tcp latency and throughput, Journal of Supercomputing, 10.1023/A:1011126701791 jerrum, 1996, The Markov chain Monte Carlo method: An approach to approximate counting and integration, Approximation Algorithms for NP-Hard Problems lova?sz, 1995, Exact mixing in an unknown Markov chain, Electronic Journal of Combinatorics, 2 10.1145/276698.276709 10.1145/52325.52356 stevens, 1995, TCP/IP Illustrated Volume 3 TCP for Transactions HTTP NNTP and the UNIX Domain Protocols 10.1109/TNET.2005.845536 10.1002/(SICI)1098-2418(199608/09)9:1/2<223::AID-RSA14>3.3.CO;2-R 10.17487/rfc2581 10.1137/0403039 10.1214/aoap/1027961037 10.1007/3-540-44666-4_23 10.1109/INFCOM.2000.832574 10.1109/SFCS.1989.63516 10.1145/137926.137932 10.1145/235160.235162 10.1145/225058.225095