• Multiple non-cooperative users sharing a common channel have to send information to a common receiver. • Fixed/assigned multiple access techniques like:

The impact of bursty traffic on queues is investigated in this paper. We consider a discrete-time single server queue with an infinite storage room, that releases customers at the constant rate of c customers/slot. The queue is fed by an M/G/1 process. The M/G/1 process can be seen as a process

Introduction This white paper addresses the behavior of Raman amplifiers when subject to bursty traffic. Bursty traffic is defined as traffic where the string of zeros can last from nanoseconds to seconds. Such bursty traffic might arise if sensors or satellite down-links input are placed directly

To my mom and dad

Abstract not found

progress. Fine-grained analysis of link qualities reveals that such intermediate links are bursty, i.e., stable in the short term. In this paper, we use short-term estimation of wireless links to accurately identify short-term stable periods of transmission on bursty links. Our approach allows a routing

Traffic on high-speed networks is expected to be `bursty'. This has spurred interest in the queueing properties of bursty traffic models, such as Markov additive processes. These processes have by now been studied extensively by many authors, but almost exclusively in the infinite buffer

ABSTRACT Quality of Service (QoS)

an allocation of priorities to packets in order to optimize their net benefit. For the case where users with bursty traffic access a single link, we show that there always exists an equilibrium for the corresponding non-cooperative game. Furthermore we show that pricing can be used to provide relative Qo

-offs involved in using different routing strategies. This paper presents the results of a simulation study designed to answer this question for realistic bursty traffic workloads.