Effective bandwidths at multi-class queues
Queueing Systems: Theory and Applications
Effective bandwidths for the multi-type UAS channel
Queueing Systems: Theory and Applications
On computing per-session performance bounds in high-speed multi-hop computer networks
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking (TON)
A new approach to service provisioning in ATM networks
IEEE/ACM Transactions on Networking (TON)
Charging and accounting for bursty connections
Internet economics
Resource allocation in multi-service networks via pricing: statistical multiplexing
Computer Networks and ISDN Systems - Special issue: trends in formal description techniques
IEEE/ACM Transactions on Networking (TON)
Queueing at large resources driven by long-tailed M/G/\infty-modulated processes
Queueing Systems: Theory and Applications
The output of a switch, or, effective bandwidths for networks
Queueing Systems: Theory and Applications
Investigations of the Performance of a Measurement-based Connection Admission Control Algorithm
Proceedings of the IFIP TC6 WG6.3/WG6.4 Fifth International Workshop on Performance Modelling and Evaluation of ATM Networks: Performance Analysis of ATM Networks
Source Time Scale and Optimal Buffer/Bandwidth Trade-off for Regulated Traffic in an ATM Node
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
IEEE Journal on Selected Areas in Communications
Pricing congestible network resources
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We examine the relation between cost and quality in networks which carry aggregate traffic. A powerful tool in this is the burstiness or indifference curve associated with a stochastic traffic flow. We relate burstiness to quality and use this relation to explore the quality experienced by aggregated flows under various rules for allocating resources to them. An example is motivated by the controlled load service specification. We show how the imposition of costs associated with buffer space and service capacity leads to the notion of a cost-optimal allocation of resources. This defines the cheapest operating point in a network where resources are commodities to be purchased as necessary to satisfy quality requirements. We define a notion of cost-based admission control: a linear admission rule which can be based on declared or measured traffic parameters.