Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
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
An analytical framework for the performance evaluation of TCP Reno connections
Computer Networks: The International Journal of Computer and Telecommunications Networking - QoS for IP networks
Modelling with Generalized Stochastic Petri Nets
Modelling with Generalized Stochastic Petri Nets
Analysis of two competing TCP/IP connections
Performance Evaluation
Discrete-Event Simulation of Fluid Stochastic Petri Nets
IEEE Transactions on Software Engineering
SPNP: Stochastic Petri Net Package
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
FSPNs: Fluid Stochastic Petri Nets
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Fluid models and solutions for large-scale IP networks
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Versatile stochastic models for networks with asymmetric TCP sources
Performance Evaluation
Analysis of signalling pathways using continuous time markov chains
Transactions on Computational Systems Biology VI
Versatile stochastic models for networks with asymmetric TCP sources
Performance Evaluation
| Hi-index | 0.00 |
In this paper we use stochastic Petri nets (SPNs) to study the interaction of multiple TCP sources that share one or two buffers. No analytical nor numerical results have been presented for such cases yet. We use SPNs in an unconventional way: the tokens in the SPN do not represent the packets being sent in the network, but merely model fractions of buffer occupancy and the congestion window sizes. In this way, we use the SPNs to obtain a discretisation of a fluid model for TCP dynamics. Thus, we pair the modelling flexibility of SPNs with the modelling efficiency of fluid models. In doing so, our approach also avoids the (numerical) solution of partial differential equations; instead, just the steady-state solution of a (large) continuous-time Markov chain is required. We first consider two TCP sources sharing a single buffer and evaluate the consequences of two popular assumptions for the loss process in terms of fairness and link utilization. The results obtained with this model are in agreement with existing analytic models. A comparison with (more costly) simulations in ns2 shows that the real loss process is somewhere in between the two loss models. Secondly, we consider a network consisting of three sources and two buffers and study how the sources share the capacity of the links. This leads to an interesting conjecture on fairness in large TCP networks.