1 Part of the content of this report has appeared as [1] and [2]. ABSTRACT This paper addresses the problem of estimating the worst-case endto-end delay for a flow in a tandem of FIFO multiplexing nodes, following up our previous work [14]. We consider the state-of-theart method for computing delay bounds, i.e. upper bounds on the worst-case delay, called the Least Upper Delay Bound (LUDB) meth...

We address the problem of providing quality-of-service (QoS) guarantees in a multiple hop packet/cell switched environment while providing high link utilization in the presence of bursty tra c. A scheme based on bandwidth and bu er reservations at the Virtual Path level is proposed for ATM networks. This approach enables us to provide accurate end-to-end QoS guarantees while achieving high util...

Compression is widely used to reduce data transmission costs, but its impact on the performance of network entities such as web caches has not yet been studied. In this paper, we evaluate the impact of compression on cache performance when the cache compresses content and the client decompresses it. We further determine the performance bounds by benchmarking the best-case (server compression-cl...

Bounds on the end-to-end delay of data flows play a crucial role in di↵erent areas, ranging from certification of hard real-time communication capabilities to quality of experience assurance for end users. Deterministic Network Calculus (DNC) allows to derive worst-case delay bounds; for instance, DNC is applied by the avionics industry to formally verify aircraft networks against strict delay ...

In this paper we present a measurement-based worst-case execution time (WCET) analysis method. Exhaustive end-to-end execution-time measurements are computationally intractable in most cases. Therefore, we propose to measure execution times of subparts of the application code and then compose these times into a safe WCET bound. This raises a number of challenges to be solved. First, there is th...

A major challenge for the design of multiservice networks with quality of service guarantees is an e cient implementation of a bounded delay service, that is, a service that guarantees maximum end-to-end delays for every packet from a single tra c stream. A crucial component of a bounded delay service is the packet multiplexing technique employed at network switches that must keep the variable ...

Many packet schedulers for QoS networks are equipped with a rate control mechanism. The function of a rate control mechanism (rate controller) is to bu er packets from ows which exceed their negotiated tra c pro le. It has been established that rate controllers lead to reduced bu er requirements at packet switches, and do not increase the worst-case delays in a deterministic service. On the oth...

The issue of Quality of Service (QoS) performance analysis in packet-switched net-works has drawn a lot of attention in the networking community. There is a lot ofwork including an elegant theory under the name of network calculus, which focuseson analysis of deterministic worst case QoS performance bounds. In the meantime,researchers have studied stochastic QoS performance ...

Many approaches have been developed so far to give an estimation of the upper bound of the end-to-end delay or the response-time for real time applications. There are two main approaches developed to perform this analysis. The first one is Liu and Layland theory, and gives which is called the worst-case response time for a given set of periodic sources. The second approach made by R. Cruz gives...

A non-work-conserving server is one that may be idle even when there are packets available to be sent. Since they do not provide the optimal average performance, non-work-conserving disciplines were seldom studied in the past. For the guaranteed performance service class in integrated services networks, the main performance index is the end-to-end delay bound, instead of the average delay. Prov...