Dynamic queue length thresholds for shared-memory packet switches
IEEE/ACM Transactions on Networking (TON)
IEEE Journal on Selected Areas in Communications
A Fokker-Planck equation method predicting Buffer occupancy in a single queue
Computer Networks: The International Journal of Computer and Telecommunications Networking
An effective approach to adaptive bandwidth allocation with QoS enhanced on IP networks
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Cross Layer QoS Guarantees in Multiuser WLAN Systems
Wireless Personal Communications: An International Journal
Joint optimization of a dynamic queue scheduling scheme for the provision of QoS in WLAN
Proceedings of the 5th International ICST Mobile Multimedia Communications Conference
A QoS-based dynamic queue length scheduling algorithm in multiantenna heterogeneous systems
EURASIP Journal on Wireless Communications and Networking - Special issue on advances in quality and performance assessment for future wireless communication services
QoS enhancements and performance analysis for delay sensitive applications
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Buffer management schemes are needed in shared-memory packet switches to regulate the sharing of memory among different output port queues and among traffic classes with different loss priorities. Earlier we proposed a single-priority scheme called Dynamic Threshold (DT), in which the maximum permissible queue length is proportional to the unused buffering in the switch. A queue whose length equals or exceeds the current threshold value may accept no new arrivals. In this paper, we propose, analyze, and simulate several ways of incorporating loss priorities into the DT scheme. The analysis models sources as deterministic fluids. We determine how each scheme allocates buffers among the competing ports and loss priority classes under overload conditions. We also note how this buffer allocation induces an allocation of bandwidth among the loss priority classes at each port. We find that minor variations in the DT control law can produce dramatically different resource allocations. Based on this study, we recommend the scheme we call OWA, which gives some buffers and bandwidth to every priority class at every port. Scheme OWA has tunable parameters, which we give rules of thumb for setting. Another scheme, called AWA, is also a good choice. It has an allocation philosophy more akin to strict priority and hence is not tunable.