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)
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Proportional differentiated services: delay differentiation and packet scheduling
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Static priority scheduling for ATM networks
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Efficient Admission Control for EDF Schedulers
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Achieving Per-Flow Weighted Rate Fairness in a Core Stateless Network
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Scalable QoS Guaranteed Communication Services for Real-Time Applications
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Endpoint Admission Control: Network Based Approach
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Design and Implementation of QoS-Provisioning System for Voice over IP
IEEE Transactions on Parallel and Distributed Systems
Quality-of-service differentiation on the internet: a taxonomy
Journal of Network and Computer Applications - Special issue: Network and information security: A computational intelligence approach
Multiconstrained QoS multipath routing in wireless sensor networks
Wireless Networks
Fair bandwidth sharing and delay differentiation: Joint packet scheduling with buffer management
Computer Communications
Delay bounds for FIFO aggregates: a case study
Computer Communications
Essay on teletraffic models (I)
ACACOS'10 Proceedings of the 9th WSEAS international conference on Applied computer and applied computational science
ICHIT'11 Proceedings of the 5th international conference on Convergence and hybrid information technology
A quantitative qos routing model for diffserv aware MPLS networks
IPOM'06 Proceedings of the 6th IEEE international conference on IP Operations and Management
An admission control and traffic engineering model for Diffserv-MPLS networks
APNOMS'06 Proceedings of the 9th Asia-Pacific international conference on Network Operations and Management: management of Convergence Networks and Services
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
A real-time and reliable approach to detecting traffic variations at abnormally high and low rates
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Modeling two-windows TCP behavior in differentiated services networks
Computer Communications
Resource management of distributed virtual machines
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
In this paper, we propose and analyze a methodology for providing absolute differentiated services for real-time applications. We develop a method that can be used to derive delay bounds without specific information on flow population. With this new method, we are able to successfully employ a utilization-based admission control approach for flow admission. This approach does not require explicit delay computation at admission time and, hence, is scalable to large systems. We assume the underlying network to use static-priority schedulers. We design and analyze several priority assignment algorithms and investigate their ability to achieve higher utilization bounds. Traditionally, schedulers in differentiated services networks assign priorities on a class-by-class basis, with the same priority for each class on each router. In this paper, we show that relaxing this requirement, that is, allowing different routers to assign different priorities to classes, achieves significantly higher utilization bounds.