Asynchronous transfer mode: solution for broadband ISDN
Asynchronous transfer mode: solution for broadband ISDN
A reservation principle with applications to the ATM traffic control
Computer Networks and ISDN Systems - Special issue on the ATM—asynchronous transfer mode
IEEE/ACM Transactions on Networking (TON)
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
Computer Networks and ISDN Systems
Open issues and challenges in providing quality of service guarantees in high-speed networks
ACM SIGCOMM Computer Communication Review
A new approach to service provisioning in ATM networks
IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Analysis, modeling and generation of self-similar VBR video traffic
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
RCBR: a simple and efficient service for multiple time-scale traffic
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A measurement-based admission control algorithm for integrated service packet networks
IEEE/ACM Transactions on Networking (TON)
Predictive dynamic bandwidth allocation for efficient transport of real-time VBR video over ATM
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Statistical multiplexing of multiple time-scale Markov streams
IEEE Journal on Selected Areas in Communications
A decision-theoretic approach to call admission control in ATM networks
IEEE Journal on Selected Areas in Communications
A Rate-Based Borrowing Scheme for QoS Provisioning in Multimedia Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Simulation and Analysis of Packet Loss in User Datagram Protocol Transfers
The Journal of Supercomputing
Hi-index | 0.00 |
We investigate the importance of understanding traffic characteristics for admission-control policies in packet networks. We compare the network utilization achieved with admission policies based on a partial knowledge of admitted traffic against the utilization that could be achieved with complete knowledge of traffic characteristics. Our quantitative study demonstrates that for realistic traffic traces the level of traffic knowledge dramatically affects admission control and improves network utilization. Indeed, the knowledge of only a few elementary traffic characteristics can produce substantial improvement. Yet, at least for one trace, this improvement based on elementary traffic knowledge is modest in comparison with the improvement that could be produced with additional traffic knowledge and if traffic characterization on more than one time scale were available.