A new buffer management scheme for hierarchical shared memory switches
IEEE/ACM Transactions on Networking (TON)
Dynamic queue length thresholds for shared-memory packet 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)
Fair Scheduling in Internet Routers
IEEE Transactions on Computers
Dynamic queue length thresholds for multiple loss priorities
IEEE/ACM Transactions on Networking (TON)
Admission control of multi-class traffic with service priorities in high-speed networks
Queueing Systems: Theory and Applications
Pushout with virtual thresholds buffer management scheme in a shared buffer ATM switch
International Journal of Network Management
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
State Space Merging Approach to Optimization of Push-Out Strategies in Packet Switching Networks
Cybernetics and Systems Analysis
Cybernetics and Systems Analysis
A Fokker-Planck equation method predicting Buffer occupancy in a single queue
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal buffer allocation in ATM switches by effective cell loss
Journal of High Speed Networks
Queueing Systems: Theory and Applications
Transform-domain analysis of packet delay in network nodes with QoS-aware scheduling
Network performance engineering
Wireless Personal Communications: An International Journal
A new shared-buffer packet switch in ATM networks
Computer Communications
| Hi-index | 0.08 |
We address the problem of designing optimal buffer management policies in shared memory switches when packets already accepted in the switch can be dropped (pushed-out). Our goal is to maximize the overall throughput, or equivalently to minimize the overall loss probability in the system. For a system with two output ports, we prove that the optimal policy is of push-out with threshold type (POT). The same result holds if the optimality criterion is the weighted sum of the port loss probabilities. For this system, we also give an approximate method for the calculation of the optimal threshold, which we conjecture to be asymptotically correct. For the N-ported system, the optimal policy is not known in general, but we show that for a symmetric system (equal traffic on all ports) it consists of always accepting arrivals when the buffer is not full, and dropping one from the longest queue to accommodate the new arrival when the buffer is full. Numerical results are provided which reveal an interesting and somewhat unexpected phenomenon. While the overall improvement in loss probability of the optimal POT policy over the optimal coordinate-convex policy is not very significant, the loss probability of an individual output port remains approximately constant as the load on the other port varies and the optimal POT policy is applied, a property not shared by the optimal coordinate-convex policy