A simple telephone exchange with delayed feedbacks
Proc. of the international seminar on Teletraffic analysis and computer performance evaluation
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Tandem behavior of a telecommunication system with finite buffers and repeated calls
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
An introduction to difference equations
An introduction to difference equations
End-to-end routing behavior in the Internet
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
TWO QUEUES IN TANDEM WITH RETRIAL CUSTOMERS
Probability in the Engineering and Informational Sciences
Accessible bibliography on retrial queues
Mathematical and Computer Modelling: An International Journal
Finite-source M/M/S retrial queue with search for balking and impatient customers from the orbit
Computer Networks: The International Journal of Computer and Telecommunications Networking
On tandem blocking queues with a common retrial queue
Computers and Operations Research
Automation and Remote Control
Queues in tandem with customer deadlines and retrials
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
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.