The output of a switch, or, effective bandwidths for networks
Queueing Systems: Theory and Applications
Large Deviations for Small Buffers: An Insensitivity Result
Queueing Systems: Theory and Applications
Tail Asymptotics for HOL Priority Queues Handling a Large Number of Independent Stationary Sources
Queueing Systems: Theory and Applications
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
On deterministic traffic regulation and service guarantees: a systematic approach by filtering
IEEE Transactions on Information Theory
Large deviations approximation for fluid queues fed by a large number of on/off sources
IEEE Journal on Selected Areas in Communications
Network decomposition: theory and practice
IEEE/ACM Transactions on Networking (TON)
Quality of service parameters and link operating point estimation based on effective bandwidths
Performance Evaluation - Performance modelling and evaluation of heterogeneous networks
Fast overflow probability estimation tool for MPLS networks
LANC '05 Proceedings of the 3rd international IFIP/ACM Latin American conference on Networking
End-to-end quality of service-based admission control using the fictitious network analysis
Computer Communications
The search for QoS in data networks: a statistical approach
Network performance engineering
| Hi-index | 0.00 |
In this paper, we obtain the overflow asymptotics in a network with small buffers when the resources are accessed by a large number of stationary independent sources. Under the assumption that the network is loop-free with respect to source–destination routes, we identify the precise large deviations rate functions for the buffer overflow at each node in terms of the external input characteristics. It is assumed that each type of source requires a Quality of Service (QoS) defined by bounds on the fraction of offered work lost. We then obtain the admissible region for sources which access the network based on these QoS requirements. When all the sources require the same QoS, we show that the admissible region asymptotically corresponds to that which is obtained by assuming that flows pass through each node unchanged.