Buffer allocation strategies with blocking requirements
Performance Evaluation
A finite buffer two class queue with different scheduling and push-out schemes
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
A buffer allocation scheme for ATM networks: complete sharing based on virtual partition
IEEE/ACM Transactions on Networking (TON)
Dynamic queue length thresholds for shared-memory packet switches
IEEE/ACM Transactions on Networking (TON)
Resource sharing for book-ahead and instantaneous-request calls
IEEE/ACM Transactions on Networking (TON)
Quality-of-service in packet networks: basic mechanisms and directions
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on Internet telephony
Optimal buffer management policies for shared-buffer ATM switches
IEEE/ACM Transactions on Networking (TON)
Buffer management for shared-memory ATM switches
IEEE Communications Surveys & Tutorials
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
A new approach is proposed to studying queuing systems with request-specific channels and a common finite buffer for requests of different types. For sharing the common buffer, a virtual partitioning strategy is used. Explicit formulas for blocking probabilities of different requests are derived and optimization problems are solved. The results of numerical experiments are presented.