Loading...
Please wait, while we are loading the content...
A hierarchical fair service curve algorithm for link-sharing, real-time and priority services (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Zhang, Hui Stoica, Ion Ng, T. S. Eugene |
| Abstract | Abstract — In this paper, we study hierarchical resource management models and algorithms that support both link-sharing and guaranteed realtime services with priority (decoupled delay and bandwidth allocation). We extend the service curve based QoS model, which defines both delay and bandwidth requirements of a class in a hierarchy, to include fairness, which is important for the integration of real-time and hierarchical link-sharing services. The resulting Fair Service Curve link-sharing model formalizes the goals of link-sharing, real-time and priority services and exposes the fundamental tradeoffs between these goals. In particular, with decoupled delay and bandwidth allocation, it is impossible to simultaneously provide guaranteed real-time service and achieve perfect link-sharing. We propose a novel scheduling algorithm called Hierarchical Fair Service Curve (H-FSC) that approximates the model closely and efficiently. The algorithm always guarantees the service curves of leaf classes, thus ensures real-time and priority services, while minimizing the discrepancy between the actual services provided to and the services defined by the Fair Service Curve link-sharing model for the interior classes. We have implemented the H-FSC scheduler in NetBSD. By performing simulation and measurement experiments, we evaluate the link-sharing and real-time performances of H-FSC, and determine the computation overhead. I. |
| File Format | |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Bandwidth Requirement Service Curve Priority Service Hierarchical Fair Service Curve Algorithm Decoupled Delay Real-time Performance Leaf Class Guaranteed Real-time Service Hierarchical Resource Management Model Hierarchical Fair Service Curve Guaranteed Realtime Service Hierarchical Link-sharing Service Computation Overhead Actual Service Measurement Experiment Bandwidth Allocation Interior Class Fair Service Curve Link-sharing Model Novel Scheduling Algorithm Qos Model H-fsc Scheduler Fundamental Tradeoff |
| Content Type | Text |
