Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
Effective bandwidths at multi-class queues
Queueing Systems: Theory and Applications
Effective bandwidths for the multi-type UAS channel
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
A new approach to service provisioning in ATM networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
ATM network design and optimization: a multirate loss network framework
IEEE/ACM Transactions on Networking (TON)
Correction to "A new approach to service provisioning in ATM networks"
IEEE/ACM Transactions on Networking (TON)
H-BIND: a new approach to providing statistical performance guarantees to VBR traffic
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
| Hi-index | 0.01 |
We present an approach to Service Provisioning with Quality ofService (QoS) requirements in ATM networks. The ATM networkprovides services to users every \widehat{T} units of time. Eachservice is characterized by its one way route, its input trafficconstraints and its provided QoS. The input traffic constraintsconsist of the maximum input rate and an upper bound on theburstiness curve. The QoS provided is defined by the maximumpercentage of cell loss along the route and the maximum end-to-endcell delay. The service provisioning problem is defined asfollows: determine the amount, price and requiredresources (bandwidth and buffers) for each type of service, thatmaximize a social welfare function that consists of the networksrevenue and the users surplus. This problem is solved every\widehat{T} units of time and the allocation is made only over theavailable resources, that is, those that are not used byconnections that are still active. We prove the existence of asolution to the Service Provisioning Problem and we also suggest aniterative procedure that interprets the solution. The networkadjusts the prices to maximize the welfare function and also toguarantee that the allocated resources do not exceed the availableresources. Based on these prices, users request a new allocationthat minimizes their cost and the network adjusts again the pricesbased on the new allocation. The above procedure has the followingfeatures: (i) the network needs to know only the average requestrate for each type of service, their route and the resourcesrequested by the users; (ii) users need to know only their privateinformation (input traffic constraints and QoS requirements), theirroute, and the prices for resources announced by the network.