The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
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
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Window flow control in FIFO networks with cross traffic
Queueing Systems: Theory and Applications
A Stochastic Model of TCP Reno Congestion Avoidence and Control
A Stochastic Model of TCP Reno Congestion Avoidence and Control
Impact of TCP-like congestion control on the throughput of multicast groups
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno with RED-based routers
ACM SIGMETRICS Performance Evaluation Review
Quantifying the Dynamic Behavior of Process Algebras
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Performance analysis of routers with TCP and UDP connections with priority and RED control
ICCC '02 Proceedings of the 15th international conference on Computer communication
Analysis of the Random Flow Generated by the Feedback Transport Protocol in a Data Transfer Network
Automation and Remote Control
Closed queueing network models of interacting long-lived TCP flows
IEEE/ACM Transactions on Networking (TON)
A Markov model of TCP throughput, goodput and slow start
Performance Evaluation - Special issue: Distributed systems performance
Performance Evaluation - Special issue: Distributed systems performance
Integrating network-calculus-based simulation with packet-level simulation for TCP-operated networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
TCP/IP Performance over 3G wireless links with rate and delay variation
Wireless Networks
Scalability of fork/join queueing networks with blocking
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Enabling network calculus-based simulation for TCP congestion control
Computer Networks: The International Journal of Computer and Telecommunications Networking
WSEAS Transactions on Information Science and Applications
Probabilistic model of the algorithms of distributed control protocol in the internet network
Automation and Remote Control
Delay-based TCP congestion avoidance: A network calculus interpretation and performance improvements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Model Checking for a Class of Weighted Automata
Discrete Event Dynamic Systems
Memory Loss Property for Products of Random Matrices in the Max-Plus Algebra
Mathematics of Operations Research
Queue dynamics with window flow control
IEEE/ACM Transactions on Networking (TON)
Forty data communications research questions
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
We give a representation of the packet-level dynamical behavior of the Reno and Tahoe variants of TCP over a single end-to-end connection. This representation allows one to consider the case when the connection involves a network made of several, possibly heterogeneous, deterministic or random routers in series. It is shown that the key features of the protocol and of the network can be expressed via a linear dynamical system in the so called max-plus algebra. This opens new ways of both analytical evaluation and fast simulation based on products of matrices in this algebra. This also leads to closed form formulas for the throughput allowed by TCP under natural assumptions on the behavior of the routers and on the detection of losses and timeouts; these new formulas are shown to refine those obtained from earlier models which either assume that the network could be reduced to a single bottleneck router and/or approximate the packets by a fluid.