Effective bandwidths with priorities
IEEE/ACM Transactions on Networking (TON)
Prioritized resource allocation for stressed networks
IEEE/ACM Transactions on Networking (TON)
Procedures and tools for analysis of network traffic measurements
Performance Evaluation
A most probable path approach to queueing systems with general Gaussian input
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Advances in modeling and engineering of Longe-Range dependent traffic
A framework for performance evaluation and optimization of an emerging multimedia DS-CDMA network
WOWMOM '01 Proceedings of the 4th ACM international workshop on Wireless mobile multimedia
Most Probable Path Techniques for Gaussian Queueing Systems
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Continuous Bandwidth, Non-Blocking, Multirate Switching in 3-Stage Clos Networks
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
On Resource Management in Multi-Service Network
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Granular differentiated queueing services for QoS: structure and cost model
ACM SIGCOMM Computer Communication Review
Preemptive and delay-based mechanisms to provide preference to emergency traffic
Computer Networks and ISDN Systems
Efficient blocking probability computation of complex traffic flows for network dimensioning
Computers and Operations Research
Wireless Personal Communications: An International Journal
Preemptive and delay-based mechanisms to provide preference to emergency traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Geometric tail of queue length of low-priority customers in a nonpreemptive priority MAP/PH/1 queue
Queueing Systems: Theory and Applications
Balancing reliability and utilization in dynamic spectrum access
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.25 |
ATM switches are now being designed to allow connections to be partitioned into priority classes, with packets being emitted for higher priority classes before packets are emitted for lower priority classes. Accordingly, allocation of network resources based on different priority levels is becoming a realistic possibility. Thus, we need new methods for connection admission control and capacity planning that take account of the priority structure. We show that the notion of effective bandwidths can be used for these purposes when appropriately extended. The key is to have admissibility of a set of connections determined by a linear constraint for each priority level, involving a performance criterion for each priority level. For this purpose, connections are assigned more than one effective bandwidth, one for its own priority level and one for each lower priority level. Candidate effective bandwidths for each priority level can be determined by using previous methods associated with the first-in first-out discipline. The proposed effective bandwidth structure makes it possible to apply product-form stochastic loss network models to perform dimensioning