, the network must offer a service which can provide deterministic guarantees for the maximum delay ofpackets from all connections, referred to as bounded delay service. The admission control functions in a network with a bounded delay service must have available schedulability conditions that detect violations

; Upfal have shown a protocol which is stable for a positive request rate; their main result is that for every resource request, its expected delay (time to get serviced) is O(log n). Assuming that the initial clock times of the processes are within a known bound of each other, we present a stable

We investigate new classes of graphs which guarantee constant delays even in the case of multiple edge failures. This means the following: as long as two vertices remain connected if some edges have failed, then the distance between these vertices in the faulty graph is at most a constant factor k

-distributed service time, queueing theory techniques could be used to determine the expected packet delay. However, it is not known how to compute the average packet delay for all but the simplest networks with constant time servers. It has been conjectured that to get an upper bound on expected packet delay

Contents 1 Introduction 2 1.1 Weighted Round Robin Resource Allocation : : : : : : : : : : 2 1.2 System Configuration and Assumptions : : : : : : : : : : : : : 4 2 Results 6 2.1 Sliding Window Shaper and Block WRR Scheduler : : : : : : 6 2.1.1 Analysis : : : : : : : : : : : : : : : : : : : : : : : : : : 6 2.1.2 Validation by Simulation : : : : : : : : : : : : : : : : : 12 2.2 Sliding Window Shaper and Distributed WRR Scheduler : : : : : 18 2.2.1 Analysis : : : : : : : : : : : : : : : : : : : : : : : : : : 18 2.2.2 Validation by Simulation : : : : : : : : : : : : : : : : : 19 2.3 Leaky Bucket Shaper and Block WRR Scheduler : : : : : : : : : 21 2.3.1 Analysis : : : : : : : : : : : : : : : : : : : : : : : : : : 21 2.3.2 Validation by Simulation : : : : : : :

Jahromizadeh, Soroush (2013). Join rate control and scheduling for providing bounded delay with high efficiency in multihop wireless networks. (Unpublished Doctoral thesis, City University London)

, and are derived from stringent delay constraints posed by the application. The figure of merit in such environments is maximizing the system’s goodput, namely, the number of frames successfully delivered. We study online algorithms for the problem of maximizing goodput of delay-bounded traffic with inter

Contents 1 Introduction 2 2 Description of Burst Crediting 2 3 Results 10 3.1 Maximum Delay for Bursty Sources :::::::::::::::: 10 3.1.1 Sliding Window Shaper :::::::::::::::::: 10 3.1.2 Leaky Bucket Shaper ::::::::::::::::::: 17 3.2 Maximum Delay for Nonbursty Sources :::::::::::::: 22 3

::::::::::::::::: 25 2.4 Leaky Bucket Shaper and Distributed WRR Scheduling :::::: 29 2.4.1 Analysis :::::::::::::::::::::::::: 29 2.4.2 Validation by Simulation ::::::::::::::::: 33 1 Introduction Average delay is a common measurement in determining whether or not telecommunication network customers are getting

In this paper, we extend the verification method based on the failure semantics of process algebra and the resulting trace theory by Dill et al. for bounded delay asynchronous circuits. We define a timed conformance relation between trace structures which allows to express both safety