Distributed Admission Control for Anycast Flows with QoS Requirements
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Energy-efficient soft real-time CPU scheduling for mobile multimedia systems
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Design and Implementation of QoS-Provisioning System for Voice over IP
IEEE Transactions on Parallel and Distributed Systems
Energy-efficient CPU scheduling for multimedia applications
ACM Transactions on Computer Systems (TOCS)
Journal of Systems and Software
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We propose and analyze a methodology for providingabsolute differentiated services with statistical performanceguarantees for real-time applications in networksthat use class-based (as opposed to flow-aware) static-priorityschedulers.We develop a method that can be usedto derive statistical delay guarantees in a flow-unawarefashion.Traditionally, both deterministic and statistical de-layanalysis methods either depend on schedulers that keepper-flow state information, or require detailed informationabout flow population at delay analysis time.The fact thatno such information is needed for delay analysis allows usto perform deadline tests during system (re-)configurationtime.We are so able to reduce the runtime admission controlto a simple utilization test.No explicit delay computationis necessary at admission time, making this approachscalable to large systems.