MAC protocol and traffic scheduling for wireless ATM networks
Mobile Networks and Applications - Special issue on wireless LANs
Round-Robin Scheduling Algorithm with Multiple Distributed Windows
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
An Algorithm for Traffic Enforcement in Multi-Tasks Operating Systems
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Intelligent MBWIMA/UMTS Protocol Using SDMA Scheduling in UTRA TDD Mode
Wireless Personal Communications: An International Journal
Proceedings of the 2nd ACM workshop on Quality of protection
Towards user-centric metrics for denial-of-service measurement
Proceedings of the 2007 workshop on Experimental computer science
A user-centric metric for denial-of-service measurement
ecs'07 Experimental computer science on Experimental computer science
Buffer management for lossless service in shared buffer switches
Journal of Parallel and Distributed Computing
Bandwidth problems in high-speed networks
IBM Journal of Research and Development
Benchmarks for DDoS defense evaluation
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Research: Design and analysis of delay control for CBR services in ATM networks
Computer Communications
Research: Delay priorities enhance utilisation of ATM PON access systems
Computer Communications
Quality of service for Internet traffic over ATM service categories
Computer Communications
Hi-index | 0.00 |
This article derives a rationale for the service architecture of the ATM Forum's Traffic Management 4.0 specification. This model distinguishes a small number of general ways to provide quality of service (QoS) which are appropriate for different classes of applications. We construct the set of ATM service categories by first analyzing the QoS and traffic requirements for a reasonably comprehensive list of applications. The most important application properties and the complexity of the related network mechanisms are used to structure the services. This method has the desirable property that the number of service categories does not expand rapidly with the introduction of new applications. We also discuss packet scheduling as the key component for realizing such a set of services, and report on an experimental realization of a fair queuing scheduler