Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
Performance analysis of statistical multiplexing of VBR sources
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
TCP/IP illustrated (vol. 2): the implementation
TCP/IP illustrated (vol. 2): the implementation
Forward acknowledgement: refining TCP congestion control
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
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
Comparative performance analysis of versions of TCP in a local network with a lossy link
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
System performance evaluation
Fluid analysis of TCP connections over ABR VCs
System performance evaluation
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
TCP is max-plus linear and what it tells us on its throughput
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A stochastic model of TCP/IP with stationary random losses
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
TCP in presence of bursty losses
Performance Evaluation - Special issue on internet performance modelling
TCP performance over end-to-end rate control and stochastic available capacity
IEEE/ACM Transactions on Networking (TON)
A Discrete-Time Model of TCP Reno with Background Traffic Interference
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Modeling IP traffic using the batch Markovian arrival process
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Modeling multiple IP traffic streams with rate limits
IEEE/ACM Transactions on Networking (TON)
Analytic models for the latency and steady-state throughput of TCP tahoe, Reno, and SACK
IEEE/ACM Transactions on Networking (TON)
Efficient solution of multiple server queues with application to the modeling of ATM concentrators
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
TCP/IP modeling and validation
IEEE Network: The Magazine of Global Internetworking
IEEE/ACM Transactions on Networking (TON)
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
This paper introduces a discrete-time model which captures the essential protocol features of the congestion control mechanism used by the TCP Reno protocol, subject to interference from other sources. Under this model, a single target session is modeled according to the TCP Reno mechanism, including slow start, congestion avoidance, fast retransmit and fast recovery. At the same time, other sources are modeled as a background process using a discrete batch Markov arrival process (D-BMAP). The D-BMAP process has been modified such that the transitions between the phases are dependent on the number of lost packets from the background process. This introduces a feedback process, which can be used to model an aggregation of TCP sources. In order to capture all the TCP Reno protocol features, two levels of Markov process modeling are used: a microscopic level, at the packet transmission time boundaries, and a macroscopic one, at the start of the new transmission windows. In addition, it is shown how the model can be extended to model networks with RED-based routers. Several performance measures are derived, and numerical examples which demonstrate the protocol features are presented.