Maximum entropy and the G/G/1/N queue
Acta Informatica
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Entropy maximised queueing networks with blocking and multiple job classes
Performance Evaluation - Special issue on queueing networks with finite capacity
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
End-to-end Internet packet dynamics
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
IEEE/ACM Transactions on Networking (TON)
Advances in internet congestion control
IEEE Communications Surveys & Tutorials
A report on recent developments in TCP congestion control
IEEE Communications Magazine
Hi-index | 0.00 |
This paper begins with a brief literature review of various approaches to congestion avoidance and control of Internet traffic. It focuses mainly on one of Active Queue Management (AQM) schemes known as Random Early Detection (RED) mechanism for congestion control at routers. Towards the end of paper, an approximate analytical performance model has been proposed based on standard RED mechanism as an effective congestion control technique. Methodology adopted is based on Principle of Maximum Entropy (ME) to model RED mechanism. To model the bursty input traffic, Generalized Exponential (GE) distribution has been used. Closed form expressions for the state and blocking probabilities have also been presented. Numerical examples have been presented. By comparing results obtained from ME (Analytical Model) and Simulation in QNAP-2 [22], it validates the credibility of ME solution.