Results 271 to 280 of about 4,313,566 (342)
Some of the next articles are maybe not open access.
A Low-Complexity Coded Transmission Scheme Over Finite-Buffer Relay Links
IEEE Transactions on Communications, 2018Relay transmissions play an important role in many types of communication systems. In this paper, we consider packet-level coded transmissions over lossy relay links with the finite-buffer and coding coefficients delivery cost constraints.
Ye Li +5 more
semanticscholar +1 more source
On the Performance of Bluetooth Scatternets with Finite Buffers
25th IEEE International Conference on Distributed Computing Systems Workshops, 2005The paper discusses the impact of finite buffers on the performance of Bluetooth scatternets operating under E-limited intra-piconet polling and walk-in bridge scheduling without rendezvous points. Simulation results demonstrate the impact of finite buffer sizes. Some practical recommendations as to the buffer size are given.
Jelena V. Misic +2 more
openaire +2 more sources
Performance of Bluetooth piconets with finite buffers
First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, 2004We analyze the performance of E-limited scheduling in Bluetooth piconets under bursty traffic finite buffer case. We model the joint probability distributions of uplink and downlink queues using M/sup [x]//G/1/K model and derive buffer blocking probabilities at slaves and at the master. Wd also derive access delays at slaves' buffers.
Jelena V. Misic, Vojislav B. Misic
openaire +2 more sources
Heuristics for Finite-Buffer Queues
Probability in the Engineering and Informational Sciences, 1992The approximation of the loss probability in finite-buffer queues is a practical problem of considerable interest. A new heuristic is given. This heuristic is based on the equilibrium distribution of the corresponding infinite-buffer queue. Numerical results show an excellent performance of the heuristic.
openaire +1 more source
On the maximal throughput of networks with finite buffers and its application to buffered crossbars
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., 2005The advent of packet networks has motivated many researchers to study the performance of networks of queues in the last decade or two. However, most of the previous work assumes the availability of infinite queue-size. Instead, in this paper, we study the maximal achievable throughput in a flow-controlled lossless network with finite-queue size.
GIACCONE, PAOLO +2 more
openaire +3 more sources
The oscillating queue with finite buffer
Performance Evaluation, 2004The idea of the recently introduced oscillating queueing system is based on two threshold values. Roughly speaking, the service process in this system is organized in such a way that the queue length is kept between these values. The oscillating queueing system has the advantage of making better use of the available resources and is applicable in many ...
openaire +2 more sources
Optimal pricing for tandem queues with finite buffers
Queueing Systems, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xinchang Wang +2 more
openaire +1 more source
Delay analysis for a finite buffer TDMA model
IEEE International Conference on Communications, 2003. ICC '03., 2004This paper provides an efficient solution for the derivation of the delay distribution for a TDMA system with a finite buffer. Assuming successive intervals of length equal to the duration of a slot, the density is expressed as (finite) linear combinations of gamma densities and beta densities with positive coefficients.
Marcel F. Neuts +3 more
openaire +2 more sources
On the Optimal Buffer Allocation of an FMS with Finite In-Process Buffers
2006This paper considers a buffer allocation problem of flexible manufacturing system composed of several parallel workstations each with both limited input and output buffers, where machine blocking is allowed and two automated guided vehicles are used for input and output material handling.
openaire +2 more sources
A parallel priority queueing system with finite buffers
Journal of Parallel and Distributed Computing, 2006In this paper we pose and analyze a novel model of a priority queueing system that represents a conveyor model. What is novel in this model is that priority is designed to minimize the idleness of the system. Thus, we discussed a general parallel finite buffer multi-server priority queueing system with balking and reneging and analyze a two-station ...
Aliakbar Montazer-Haghighi +1 more
openaire +2 more sources