We present and prove a delay guarantee for the Virtual Clock service discipline. The guarantee has several desirable properties, including the following firewall property: The guarantee to a flow is unaffected by the behavior of other flows sharing the same server. There is no assumption

. In this paper, we present a polling mechanism that provides delay guarantees in an efficient manner, and we evaluate this polling mechanism by means of simulation. It is shown that this polling mechanism is able to provide de-lay guarantees while saving as much as possible resources, which can be used

This paper proposes a new formulation for the bandwidth packing problem, assuring maximum service delay in telecommunications networks. The bandwidth packing problem is one of selecting calls, from a list of requests, to be routed in the network. We limit the maximum queueing delay, while

's links and routers. Standard routing protocols can be viewed as a restricted instance of such network load balancing techniques. For network paths with delay guarantee, there is a separate dimension along which network resource provision algorithms can optimize to increase resource usage efficiency: end

-packet (per-cell) delay guarantees are an important QoS requirement for real-time applications. Although several methods have been proposed to provide delay guarantees in packet-switching networks, they are either too complex for ATM networks which allow only very simple operations to achieve high bandwidths

incorporates delay guarantee into energy efficient routing by limiting the length of the routing paths from each sensor node to the collection node. Simulations reveal that the lifetime of the network increases significantly by optimal routing and there is not always a tradeoff between the delay guarantee

guarantees (Le., frame delivery time and frame delay variation). The method combines service-based variable sleep pe riod and a queueing theory model to compute the optimal sleep time. Simulation results prove the ef fectiveness of the method for a Poisson frame arrival process. Index Terms-Energy saving

the statistical multiplexing nature of input tra#c. While existing measurement-based admission control algorithms utilize statistical multiplexing along the bandwidth dimension, they do not satisfactorily exploit statistical multiplexing along the delay dimension to guarantee distinct per-QVPN delay bounds

This work studies the delay performance of policed traf-fic to provide real-time guarantees over wireless networks. A number of models have been presented in the literature to describe wireless (radio or optical) networks in terms of the wireless channel and the underlying error control mecha

Abstract—This paper presents a new approach to provide stochastic delay guarantees via fully distributed model-based call admission control for IEEE 802.11 single-hop ad hoc networks. We propose a novel stochastic link-layer channel model to characterize the variations of the channel service