Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
23,903
• Bursty traffic:
, 2005
"... • Multiple non-cooperative users sharing a common channel have to send information to a common receiver. • Fixed/assigned multiple access techniques like: ..."
Abstract
- Add to MetaCart
• Multiple non-cooperative users sharing a common channel have to send information to a common receiver. • Fixed/assigned multiple access techniques like:
Impact of Bursty Traffic on Queues
, 2001
"... 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 resu ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
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
Raman Amplifier Simulations with Bursty Traffic
"... 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 ..."
Abstract
- Add to MetaCart
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
Bursty Traffic over Bursty Links
"... Accurate estimation of link quality is the key to enable efficient routing in wireless sensor networks. Current link estimators focus mainly on identifying long-term stable links for routing. They leave out a potentially large set of intermediate links offering significant routing progress. Fine-gra ..."
Abstract
-
Cited by 31 (5 self)
- Add to MetaCart
-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 protocol to forward
Bursty Traffic and Finite Capacity Queues
- Annals of Operations Research
, 1996
"... 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 settin ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
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
Pricing Differentiated Services Networks: Bursty Traffic
- In Proceedings of IEEE INFOCOM ’01
, 2001
"... We study the role of pricing in Differentiated Services (DiffServ) networks. We model DiffServ as a priority service, where users are given the freedom to choose the priorities of their traffic, but are charged accordingly. Using a game theoretic framework, we study the case where users choose an al ..."
Abstract
-
Cited by 32 (0 self)
- Add to MetaCart
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
Rokicki: How Much Adaptivity is Required for Bursty Traffic
- In Proceedings of Seventh International Conference on Parallel and Distributed Computing, Las-Vegas
, 1994
"... Deterministic routing strategies are cheap and fast to implement but suffer from increased message latency due to contention for resources in a packet switching fabric. Adaptive routing strategies are inherently more complex which may result in slower routing. Our goal is to investigate the trade-of ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
-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. 1
The Performance of Routing Algorithms under Bursty Traffic Loads
- In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’03
, 2003
"... Routing algorithms are traditionally evaluated under Poisson-like traffic distributions. This type of traffic is smooth over large time intervals and has been shown not necessarily to be representative to that of real network loads in parallel processing and communication environments. Bursty traffi ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Routing algorithms are traditionally evaluated under Poisson-like traffic distributions. This type of traffic is smooth over large time intervals and has been shown not necessarily to be representative to that of real network loads in parallel processing and communication environments. Bursty
Results 1 - 10
of
23,903
