INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
IEEE/ACM Transactions on Networking (TON)
Scalable QoS provision through buffer management
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Optimal buffer management policies for shared-buffer ATM switches
IEEE/ACM Transactions on Networking (TON)
Performance and fluid simulations of a novel shared buffer management system
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Prioritized resource allocation for stressed networks
IEEE/ACM Transactions on Networking (TON)
A game-theoretic approach towards congestion control in communication networks
ACM SIGCOMM Computer Communication Review
Explicit window adaptation: a method to enhance TCP performance
IEEE/ACM Transactions on Networking (TON)
REFWA: an efficient and fair congestion control scheme for LEO satellite networks
IEEE/ACM Transactions on Networking (TON)
Backpressure in shared-memory-based ATM switches under multiplexed bursty sources
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Performance study of buffer management schemes under multicasting traffic in ATM switching nodes
Computer Communications
Multi-level active queue management with dynamic thresholds
Computer Communications
Review: Review of recent shared memory based ATM switches
Computer Communications
| Hi-index | 0.00 |
Buffer management schemes are needed to fairly regulate the sharing of memory among different output port queues in a shared memory ATM switch. Of the conventional schemes, Static Threshold is simple but does not adapt to changing traffic conditions while Pushout is efficient and adaptive but difficult to implement. We propose a novel scheme called Dynamic Threshold which combines the simplicity of Static Threshold and the adaptability of Pushout. The key idea is that the maximum permissible length, for any individual queue at any instant of time, is proportional to the unused buffering in the switch. A queue whose length equals or exceeds the current threshold value may accept no more new cells. The Dynamic Threshold procedure presented here improves fairness and switch eflciency by guaranteeing access to the buffer space for all output queues. Computer simulation is used to compare the loss performance of the Dynamic Threshold technique with that of Static Threshold and Pushout. The Dynamic Threshold scheme is shown to, be a good compromise: while neady as simple as Static Threshold control, it offers most of the performance benefits of Pushoat. Like Pushout, the Dynamic Threshold method is adaptive, so it is more robust to uncertainties and changes in trafic conditions than Static Threshold control.