Results 261 to 270 of about 4,313,566 (342)
Some of the next articles are maybe not open access.
Age of Information of Jackson Networks With Finite Buffer Size
IEEE Wireless Communications Letters, 2021We investigate the Age of Information (AoI) of Jackson Networks with finite buffer size. We provide a closed form expression of an upper bound of the average AoI by using Stochastic Hybrid Systems (SHS) along with linear algebra tools.
J. Doncel, Mohamad Assaad
semanticscholar +1 more source
On finite-buffer batch-size-dependent bulk service queue with queue-length dependent vacation
Quality Technology & Quantitative Management, 2020This paper considers a single server finite-buffer batch-size-dependent bulk service queue with queue-length dependent vacation. Customers arrive at the system according to the Poisson process and are served in batches of maximum size ‘b’ with a minimum ...
G. K. Gupta, A. Banerjee, U. C. Gupta
semanticscholar +1 more source
Caching With Finite Buffer and Request Delay Information: A Markov Decision Process Approach
IEEE Transactions on Wireless Communications, 2020Edge caching has become a promising technology in future wireless networks owing to its remarkable ability to reduce peak data traffic. However, the storage resource can be limited in practice hence only a small amount of files can be cached.
Haiming Hui, Wei Chen, L. xilinx Wang
semanticscholar +1 more source
Relay Selection for Energy-Harvesting Relays With Finite Data Buffer and Energy Storage
IEEE Internet of Things Journal, 2021Buffer-aided relaying can fully utilize the available selection gain of relay channels by allowing relays to store the received packets in the data buffers when the first-hop and second-hop channels are mismatched in quality.
C.I. Lin, Kuang-Hao Liu
semanticscholar +1 more source
Scheduling with Finite Capacity Output Buffers
Operations Research, 1998In many scheduling problems, a job that completes processing may need to be held in an output buffer until the customer is ready to accept delivery. Buffer capacity is usually assumed to be infinite. We study a number of the best known single machine scheduling problems, under several alternative assumptions about the capacity of the output buffer ...
Nicholas G. Hall +2 more
openaire +2 more sources
Scheduling with Finite Capacity Input Buffers
Operations Research, 1998In many scheduling problems, a newly released job must be stored in an input buffer while it waits to begin processing. The lack of attention given to these buffers in the classical scheduling literature results from the implicit assumption that they have infinite capacity.
Nicholas G. Hall +2 more
openaire +2 more sources
Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042), 2003
We consider a queue with finite buffer where the buffer size limits the amount of work that can be stored in the queue. The arrival process is a Poisson or a Markov modulated Poisson process. The service times (packet lengths) are i.i.d. with a general distribution. Our queue models the systems in the Internet more realistically than the usual M/GI/1/K
V. Sharma, J.T. Virtamo
openaire +1 more source
We consider a queue with finite buffer where the buffer size limits the amount of work that can be stored in the queue. The arrival process is a Poisson or a Markov modulated Poisson process. The service times (packet lengths) are i.i.d. with a general distribution. Our queue models the systems in the Internet more realistically than the usual M/GI/1/K
V. Sharma, J.T. Virtamo
openaire +1 more source
Burst ratio in the finite-buffer queue with batch Poisson arrivals
Applied Mathematics and Computation, 2018We study the burst ratio in the queueing system with finite buffer and batch arrivals. The study is motivated by computer networking, in which packet losses occur due to queueing mechanisms and buffer overflows. First, we derive the formula for the burst
A. Chydzinski +2 more
semanticscholar +1 more source
Throughput Region of Finite-Buffered Networks
IEEE Transactions on Parallel and Distributed Systems, 2007Most of the current communication networks, including the Internet, are packet switched networks. One of the main reasons behind the success of packet switched networks is the possibility of performance gain due to multiplexing of network bandwidth. The multiplexing gain crucially depends on the size of the buffers available at the nodes of the network
GIACCONE, PAOLO +2 more
openaire +3 more sources
On a synchronization queue with two finite buffers
Queueing Systems, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Misa Takahashi +2 more
openaire +2 more sources