RETRIAL NETWORKS WITH FINITE BUFFERS AND THEIR APPLICATION TO INTERNET DATA TRAFFIC
- 25 September 2008
- journal article
- research article
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 22 (4) , 519-536
Abstract
Data on the Internet is sent by packets that go through a network of routers. A router drops packets either when its buffer is full or when it uses the Active Queue Management. Currently, the majority of the Internet routers use a simple Drop Tail strategy. The rate at which a user injects the data into the network is determined by transmission control protocol (TCP). However, most connections in the Internet consist only of few packets, and TCP does not really have an opportunity to adjust the sending rate. Thus, the data flow generated by short TCP connections appears to be some uncontrolled stochastic process. In the present work we try to describe the interaction of the data flow generated by short TCP connections with a network of finite buffers. The framework of retrial queues and networks seems to be an adequate approach for this problem. The effect of packet retransmission becomes essential when the network congestion level is high. We consider several benchmark retrial network models. In some particular cases, an explicit analytic solution is possible. If the analytic solution is not available or too entangled, we suggest using a fixed-point approximation scheme. In particular, we consider a network of one or two tandem M/M/1/K-type queues with blocking and with an M/M/1/∞-type retrial (orbit) queue. We explicitly solve the models with particular choices of K, derive stability conditions for K≥1, and present several graphs based on numerical results.Keywords
This publication has 18 references indexed in Scilit:
- TWO QUEUES IN TANDEM WITH RETRIAL CUSTOMERSProbability in the Engineering and Informational Sciences, 2001
- On a bivariate Markov process arising in the theory of single‐server retrial queuesStatistica Neerlandica, 2000
- Optimization flow control. I. Basic algorithm and convergenceIEEE/ACM Transactions on Networking, 1999
- Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and StabilityJournal of the Operational Research Society, 1998
- Some decomposition formulae for M/M/r/r+d queues with constant retrial rateCommunications in Statistics. Stochastic Models, 1998
- End-to-end routing behavior in the InternetIEEE/ACM Transactions on Networking, 1997
- Steady state solution of a single-server queue with linear repeated requestsJournal of Applied Probability, 1997
- Fixed Point Approximations for Retrial NetworksProbability in the Engineering and Informational Sciences, 1996
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993
- A survey of retrial queuesQueueing Systems, 1990