We propose new burst assembly techniques that aim at reducing the average delay experienced by the packets during the burstification process in optical burst switched (OBS) networks, for a given average size of the bursts produced. These techniques use a linear prediction filter to estimate the number of packet arrivals at the ingress node in the following interval, and launch a new burst into ...

Efficient heavy haul operations require accurate predictions of terminal arrival times and equipment cycle times. Most analytical and parametric approaches for railway capacity evaluation and operations planning focus on predicting average train delay and not the performance of individual trains and their delay distribution. In practice, train delay varies about this average according to some d...

In this paper we give an example of Markus-Yamabe instability in a constant coefficient delay differential equation with time-varying delay. For all values of the range of the delay function, the characteristic function of the associated autonomous delay equation is exponentially stable. Still, the fundamental solution of the time-varying system is unbounded. We also present a modified example ...

The optimal tradeoff between average service cost rate, average utility rate, and averagedelay is addressed for a state dependent M/M/1 queueing model, with controllable queue lengthdependent service rates and arrival rates. For a model with a constant arrival rate λ for all queuelengths, we obtain an asymptotic characterization of the minimum average delay, when theaverage serv...

In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respectively, the expected time to reach a target. These games are concurrent since at each step of the game both players choose a timed move (a time delay and action under their control), and the transition of the game is ...

ATM networks being a connection-oriented technology are providing service for real-time communication. Before two hosts can communicate, a connection has to be established between them. After a connection is established, messages are divided into fixed size packets called cells and are being sent from a source host to a destination host. Real-time communication service requires the underlying n...

H astad has shown that functions like PARITY cannot be computed by unbounded fanin circuits of small depth and polynomial size. We generalize this result in two directions. First, we obtain the same tight lower bound for the average case. This is done by estimating the average delay { the natural generalization of circuit depth to an average case measure { of unbounded fanin circuits of polynom...

In this paper, we present a systematic framework to identify delay marginalities in a design during first silicon validation. Our method guarantees the excitation of the worst-case delay of the chips in the first silicon batch without introducing any pessimism. It embodies several innovations, including a resilient gate delay model to capture process variations, new conditions that vectors must...

stract We introduce a capacity reservation scheme for multimedia trac. We compare it to other algorithms in the literature. It has been implemented and its worst-case performance has been analysed. It appears to give a noticeably improved quality of service to delay-sensitive trac.