Analysis of a Window-Constrained Scheduler for Real-Time and Best-Effort Packet Streams
نویسندگان
چکیده
This paper describes how Dynamic WindowConstrained Scheduling (DWCS) can guarantee real-time service to packets from multiple streams with different performance objectives. We show that: (1) DWCS can guarantee that no more than x packets miss their deadlines for every y consecutive packets requiring service, as long as the minimum aggregate bandwidth requirement of all real-time packet streams does not exceed the available bandwidth, (2) using DWCS, the delay of service to realtime packet streams is bounded even when the scheduler is overloaded, (3) DWCS can ensure that the delay bound of any given stream is independent of other streams, and (4) a fast response time for best-effort packet streams, in the presence of real-time packet streams, is possible. Furthermore, if a feasible schedule exists, each stream is guaranteed a minimum fraction of available bandwidth over a finite window of time.
منابع مشابه
Analysis of a Window-constrained Scheduler for Real-time and Best-eeort Packet Streams
This paper describes how Dynamic Window-Constrained Scheduling (DWCS) can guarantee real-time service to packets from multiple streams with diierent performance objectives. We show that: (1) DWCS can guarantee that no more than x packets miss their deadlines for every y consecutive packets requiring service, (2) using DWCS, the delay of service to real-time packet streams is bounded even when t...
متن کاملDynamic Window-Constrained Scheduling for Real-Time Media Streaming
This paper describes an algorithm for scheduling packets in real-time multimedia data streams. Common to these classes of data streams are service constraints in terms of bandwidth and delay. However, it is typical for realtime multimedia streams to tolerate bounded delay variations and, in some cases, finite losses of packets. We have therefore developed a scheduling algorithm that assumes str...
متن کاملScalable Scheduling Support for Loss and Delay Constrained Media Streams
Real-time media servers need to service hundreds and, possibly, thousands of clients, each with their own quality of service (QoS) requirements. To guarantee such diverse QoS requires fast and efficient scheduling support at the server. This paper describes the practical issues concerned with the implementation of a scalable real-time packet scheduler resident on a server, designed to meet serv...
متن کاملBest-Effort Scheduling of (m, k)-Firm Real-Time Streams in Multihop Networks
In this paper, we address the problem of best-e ort scheduling of (m; k)rm real-time streams in multihop networks. The existing solutions for the problem ignore scalability considerations because the solutions maintain a separate queue for each stream. In this context, we propose a scheduling algorithm, EDBP, which is scalable ( xed scheduling cost) with little degradation in performance. The p...
متن کاملMining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows
Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...
متن کامل