In this paper, we investigate the problem of providing worst-case end-to-end delay guarantee to a leaky-bucket constrained ow traversing a series of N packet schedulers. We consider a network of routers that support the Guaranteed (G) Service class of the IETF Integrated Services (IntServ) Working Group; this service class is proposed to provide Quality of Service (QoS) in the Internet. Under t...

While the real-time systems community has developed very valuable approaches to timing and scheduling analysis for processors and buses over the last four decades, another very relevant issue has received only limited attention: end-to-end timing. Most of the known work poses restrictions on specific task activation and communication mechanisms, e.g. unbounded FIFO queues along event-triggered ...

An essential issue in designing, operating and managing a modern network is to assure end-to-end QoS from users perspective, and in the meantime to optimize a certain average performance objective from the systems perspective. So in the first part of this paper, we address the above issue by using the rerouting approach, where the objective is to minimize the average cross-network packet delay ...

Fair queuing is the mechanism by which routers schedule packets on output links in order to guarantee fairness and latency bounds. Fair queuing, along with with address lookup and switching, is one of the major bottlenecks for routers today. We describe an eecient fair queuing scheme, Leap Forward Virtual Clock , that provides end-to-end delay bounds and throughput fairness comparable to the be...

Bounding node-to-sink latency is an important issue of wireless sensor networks (WSNs) with a quality of service requirement. This paper proposes to deploy multiple sinks to control the worst case node-to-sink data latency in WSNs. The end-to-end latency in multihop wireless networks is known to be proportional to the hop length of the routing path that the message moves over. Therefore, we for...

There are many factors governing the performance of TCP-based applications traversing satellite channels. The end-to-end performance of TCP is known to be degraded by the delay, noise and asymmetry inherent in geosynchronous systems. This result has been largely based on experiments that evaluate the performance of TCP in single flow tests. While single flow tests are useful for deriving inform...

Recent results on Network Calculus applied to FIFO networks show that, in the general case, end-to-end delay bounds cannot be computed in a closed form, whereas solving non-linear programming problems is instead required. Furthermore, it has been shown that these bounds may be larger than the actual worst-case delay, which also calls for computing lower bounds on the latter. This paper presents...

In many distributed real-time systems, the workload can be modeled as a set of periodic tasks, each of which consists of a chain of subtasks executing on different processors. Synchronization protocols are used to govern the release of subtasks so that the precedence constraints among subtasks are satisfied and the schedulabilityof the resultant system is analyzable. When different protocols ar...

In the context of Diffserv networks some services should be characterized by end-to-end quantitative QoS guarantees. In order to provide such guarantees to single flows (or flow aggregates), the end-to-end analysis of delay and loss performance in a Diffserv domain is needed. The impact of jitter should be considered in the performance analysis at the successive nodes along the path of a flow (...

This paper presents an evaluation of the impact of the so-called OS latencies on the performance of a synchronous network based on global time coordination. The concept of end-to-end latency is first defined, by extending the concept of latency used to evaluate the performance of real-time systems, and the end-to-end latency provided by a general-purpose OS is measured as a benchmark. Finally, ...