Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping

Sivaraman, Vijay; Chiussi, F.M.

doi:10.1109/infcom.2000.832237

Cited by 51 publications

(27 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors in [2] prove that in a deterministic setting, EDF is the optimal scheduling policy at a single switch. However, the computation complexity of EDF is very high [3], mostly since a search operation is required whenever a new packet arrives at the scheduler (for sorting packets according to their deadlines) [4]. To reduce the computational load of EDF, Liebeherr et al propose Rotating Priority Queue (RPQ) [4].…”

Section: B Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Quality-of-Experience Driven Acceleration of Thin Client Connections

Arumaithurai¹,

Seedorf²,

Dusi³

et al. 2013

2013 IEEE 12th International Symposium on Network Computing and Applications

View full text Add to dashboard Cite

Abstract-Thin-client based solutions allow users to connect to remote servers and access content that is running on these servers within a virtual PC. With the advent of cloud based solutions, thin-client deployments running on remote Data-centers are increasingly popular. Unfortunately, since the traffic has to traverse through the Internet, issues such as latency, packet drops, and potentially congestion are introduced, which in turn affect the Quality of Experience (QoE) for the user. Our objective is to provide preferential treatment to certain thin-client flows over the rest of the thin-client flows traversing the same intermediate node, based on the application that the user is using at a given point in time. This is not straightforward, as it is not easy to identify what actual application is running inside a given thin client session, given that thin client protocols essentially only send bitmaps of the desktop to the client and in addition are often encrypting traffic. Assuming that some statistical mechanisms for application identification for thin client connections exists, the challenge we address is how to exploit this information for QoE-driven scheduling.We present a scheme that allows the prioritization of thinclient flows that are serving delay-sensitive applications, i.e., prioritizing flows based on the specific QoE requirements of the dynamically changing individual applications running within persistent thin client traffic flows. Our solution is essentially a hybrid scheduling scheme that takes into account the dynamically changing delay and bandwidth requirements of inner (i.e., tunneled in the thin client protocol) applications to prioritize flows that are close to an application-dependent QoE threshold. Our evaluation based on a prototype implementation reveals that our algorithm is indeed effective in dynamically prioritizing persistent thin-client flows based on the dynamically changing inner applications running within the flows.

show abstract

Section: B Resultsmentioning

confidence: 99%

“…However, regular EDF is not directly applicable to our scenario for two reasons: First, when resource utilization is higher than 100% (as in our target scenario), EDF cannot guarantee that some flows will not starve [2]. Second, a per-packet computation of the Delay Budget is computationally not feasible and does not scale [3] [4].…”

Section: Scheduling Algorithmmentioning

confidence: 99%

Quality-of-Experience Driven Acceleration of Thin Client Connections

Arumaithurai¹,

Seedorf²,

Dusi³

et al. 2013

2013 IEEE 12th International Symposium on Network Computing and Applications

View full text Add to dashboard Cite

show abstract

“…On the other hand, EDF is a dynamic scheduling algorithm. EDF and its several extensions were proposed to guarantee the end-to-end delay of packets, e.g., EDF with traffic shaper [15]- [17] that can regulate the distorted traffic from the EDF scheduler to deal with the bursty traffic. Unfortunately, using optimal traffic shaper is, in general, infeasible and introduces additional packet delays.…”

Section: A Real-time Schedulingmentioning

confidence: 99%

Efficient Scheduling for Periodic Aggregation Queries in Multihop Sensor Networks

Wan

et al. 2012

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-In this paper, we study periodic query scheduling for data aggregation with minimum delay under various wireless interference models. Given a set of periodic aggregation queries, each query has its own period and the subset of source nodes containing the data. We first propose a family of efficient and effective real-time scheduling protocols that can answer every job of each query task within a relative delay under resource constraints by addressing the following tightly coupled tasks: routing, transmission plan constructions, node activity scheduling, and packet scheduling. Based on our protocol design, we further propose schedulability test schemes to efficiently and effectively test whether, for a set of queries, each query job can be finished within a finite delay. Our theoretical analysis shows that our methods achieve at least a constant fraction of the maximum possible total utilization for query tasks, where the constant depends on wireless interference models. We also conduct extensive simulations to validate the proposed protocol and evaluate its practical performance. The simulations corroborate our theoretical analysis.

show abstract

“…Most comparative evaluations of scheduling algorithms investigate only a single link scenario, e.g., [26]. Analytical comparisons between Generalized Processor Sharing (GPS) and Earliest Deadline First (EDF) scheduling over a multi-hop path have been presented for worst-case arrival scenarios [10] and for statistically multiplexed traffic [23], [17]. These works highlight the differences between end-to-end delays with these schedulers, but do not study how the differences evolve as the number of nodes of a network path is increased.…”

Section: Introductionmentioning

confidence: 99%

On the Impact of Link Scheduling on End-to-End Delays in Large Networks

Liebeherr

Ghiassi-Farrokhfal

Burchard

2011

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-We seek to provide an analytical answer whether the impact of link scheduling algorithms on end-to-end delays diminishes on long network paths. The answer is provided through a detailed multi-hop delay analysis, which is applicable to a broad class of scheduling algorithms, and which can account for statistical multiplexing. The analysis is enabled by two contributions: (1) We derive a function that can characterize the available bandwidth at a buffered link for various scheduling algorithms. This characterization is sharp enough to provide necessary and sufficient conditions for satisfying worst-case delay bounds at a single link; (2) We obtain end-to-end delay bounds by solving an optimization problem, in which the service received on a multi-hop path is subsumed into a single function. Since our analysis captures the properties of a broad group of schedulers in a single parameter, it can provide insight how the choice of scheduling algorithms impacts end-to-end delay bounds. An important finding of this paper is that schedulers may exhibit noticeable performance differences which persist in a network setting with long paths.

show abstract

Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping

Cited by 51 publications

References 23 publications

Quality-of-Experience Driven Acceleration of Thin Client Connections

Quality-of-Experience Driven Acceleration of Thin Client Connections

Efficient Scheduling for Periodic Aggregation Queries in Multihop Sensor Networks

On the Impact of Link Scheduling on End-to-End Delays in Large Networks

Contact Info

Product

Resources

About