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
Closed queueing network models of interacting long-lived TCP flows
IEEE/ACM Transactions on Networking (TON)
Modeling the Burstiness of TCP
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
A Markov model of TCP throughput, goodput and slow start
Performance Evaluation - Special issue: Distributed systems performance
Measuring the evolution of transport protocols in the internet
ACM SIGCOMM Computer Communication Review
Simple Analytical Formulation of the TCP Send Rate in Optical Burst-Switched Networks
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
An Analytical Approach to Optical Burst Switched Networks
An Analytical Approach to Optical Burst Switched Networks
Transport control protocol in optical burst switched networks: issues, solutions, and challenges
IEEE Communications Surveys & Tutorials
Amplification effects of the send rate of TCP connection through an optical burst switching network
Optical Switching and Networking
Performance analyses of optical burst-switching networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This work proposes a stochastic model to characterize the transmission control protocol (TCP) over optical burst switching (OBS) networks which helps to understand the interaction between the congestion control mechanism of TCP and the characteristic bursty losses in the OBS network. We derive the steady-state throughput of a TCP NewReno source by modeling it as a Markov chain and the OBS network as an open queueing network with rejection blocking. We model all the phases in the evolution of TCP congestion window and evaluate the number of packets sent and time spent in different states of TCP. We model the mixed assembly process, burst assembler and disassembler modules, and the core network using queueing theory and compute the burst loss probability and end-to-end delay in the network. We derive expression for the throughput of a TCP source by solving the models developed for the source and the network with a set of fixed-point equations. To evaluate the impact of a burst loss on each TCP flow accurately, we define the burst as a composition of per-flow-bursts (which is a burst of packets from a single source). Analytical and simulation results validate the model and highlight the importance of accounting for individual phases in the evolution of TCP congestion window.