Results 291 to 300 of about 4,313,566 (342)

Finite buffers for fast multicast

Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 1989
When many or all of the recipients of a multicast message respond to the multicast's sender, their responses may overflow the sender's available buffer space. Buffer overflow is a serious, known problem of broadcast-based protocols, and can be troublesome when as few as three or four recipients respond.
openaire   +1 more source

Regenerative analysis of a finite buffer fluid queue

International Congress on Ultra Modern Telecommunications and Control Systems, 2010
We discuss the application of the regenerative simulation of estimate the loss probability in a queueing system with finite buffer which is fed by a Gaussian input. We mainly consider queue with Brownian input. Stability analysis is discussed and some numerical examples are also included.
Ruslana S. Goricheva, Oleg V. Lukashenko, Evsey V. Morozov, Michele Pagano   +3 more
openaire   +3 more sources

On the Design of Optimal Policy for Sharing Finite Buffers

IEEE Transactions on Communications, 1984
An important analytic model of finite buffer systems is a multiclass single queue with typed servers. In the context of such a model, we address the problem of selecting an optimal buffer sharing policy. We show that with respect to weighted throughput, an optimal policy must be a stationary delayed resolution policy.
Ashok K. Thareja, Ashok K. Agrawala
openaire   +1 more source

A new selective ARQ scheme with a finite buffer

European Transactions on Telecommunications, 1995
AbstractAutomatic repeat request (ARQ) techniques with error‐detecting codes are commonly used in communication systems. Of these, selective protocols, while the most efficient, have the notable drawback of requiring large buffers at the receiver side. A new selective ARQ protocol with a finite‐length buffer is described in this paper.
BENELLI, GIULIANO, GARZELLI, ANDREA
openaire   +3 more sources

Analysis of finite buffered multistage combining networks

IEEE Transactions on Parallel and Distributed Systems, 1995
Analyzing the performance of finite buffered multistage networks has been considered a difficult task because of dynamic blocking effects due to finite sized buffers. With the multistage networks enhanced with combining capability, in which multiple requests directed to a shared location combine together to form a single request to be forwarded, the ...
Gyungho Lee, Byung-Chang Kang, Richard Y. Kain   +2 more
openaire   +1 more source

Capacity Achieving Distributed Scheduling With Finite Buffers

IEEE/ACM Transactions on Networking, 2015
In this paper, we propose a distributed cross-layer scheduling algorithm for wireless networks with single-hop transmissions that can guarantee finite buffer sizes and meet minimum utility requirements. The algorithm can achieve a utility arbitrarily close to the optimal value with a tradeoff in the buffer sizes.
Dongyue Xue, Robert Murawski, Eylem Ekici   +2 more
openaire   +1 more source

Smoothed perturbation analysis for queues with finite buffers

Queueing Systems, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael C. Fu 0001, Jian-Qiang Hu
openaire   +2 more sources

Solving finite-buffer queues with Markovian arrivals

ACM SIGMETRICS Performance Evaluation Review, 2007
In this report we study queueing systems satisfying the following conditions: • finite buffer (waiting room) • the left-skip-free queue size process at departure epochs • arrival process with Markovian ...
openaire   +2 more sources

Overload control in a finite message storage buffer

IEEE Transactions on Communications, 1989
An approach to the analysis of overload control in a finite buffer is introduced in which the original queuing process is modeled by a birth-and-death (BD) or quasi-birth-and-death (QBD) process. Overload control means to adapt the input process or the service process during the time period when the buffer content exceeds a certain level until it drops
openaire   +1 more source

Queue Size in a BMAP Queue with Finite Buffer

2006
The paper presents an analysis of the queue size distribution in a finite-buffer queue fed by a BMAP (Batch Markovian Arrival Process). In particular, the time-dependent and steady-state solutions are given as closed-form formulas. In addition, computational issues are discussed and a numerical example based on IP traffic is presented.
openaire   +2 more sources