Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
A control theoretic approach to active queue management
Computer Networks: The International Journal of Computer and Telecommunications Networking
Random Early Marking: An Optimization Approach to Internet Congestion Control
ICON '99 Proceedings of the 7th IEEE International Conference on Networks
ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Network Congestion Control: Managing Internet Traffic (Wiley Series on Communications Networking & Distributed Systems)
IEEE Network: The Magazine of Global Internetworking
Per-stream loss behavior of ΣMAP/M/1/K queuing system with a random early detection mechanism
Information Sciences: an International Journal
Proceedings of the 6th International Conference on Queueing Theory and Network Applications
Analytical modeling of a multi-queue nodes network router
International Journal of Automation and Computing
ISIICT'09 Proceedings of the Third international conference on Innovation and Information and Communication Technology
Hi-index | 0.00 |
Due to the rapid development in computer networks, congestion becomes a critical issue. Congestion usually occurs when the connection demands on network resources, i.e. buffer spaces, exceed the available ones. We propose in this paper a new discrete-time queueing network analytical model based on dynamic random early drop (DRED) algorithm to control the congestion in early stages. We apply our analytical model on two-queue nodes queueing network. Furthermore, we compare between the proposed analytical model and three known active queue management (AQM) algorithms, including DRED, random early detection (RED) and adaptive RED, in order to figure out which of them offers better quality of service (QoS). We also experimentally compare the queue nodes of the proposed analytical model and the three AQM methods in terms of different performance measures, including, average queue length, average queueing delay, throughput, packet loss probability, etc., aiming to determine the queue node that offers better performance.