Výsledky vyhľadávania - "time to buffer overflow"
-
1
On the Time to Buffer Overflow in a Queueing Model with a General Independent Input Stream and Power-Saving Mechanism Based on Working Vacations
ISSN: 1424-8220, 1424-8220Vydavateľské údaje: Basel MDPI AG 16.08.2021Vydané v Sensors (Basel, Switzerland) (16.08.2021)“…A single server GI/M/1 queue with a limited buffer and an energy-saving mechanism based on a single working vacation policy is analyzed. The general…”
Získať plný text
Journal Article -
2
Distribution of the time to buffer overflow in the M/G/1/N-type queueing model with batch arrivals and multiple vacation policy
ISSN: 0160-5682, 1476-9360Vydavateľské údaje: Taylor & Francis 03.03.2020Vydané v The Journal of the Operational Research Society (03.03.2020)“…A single-channel FIFO queueing model with finite buffer capacity and the multiple vacation policy is investigated, in which jobs arrive according to a compound…”
Získať plný text
Journal Article -
3
On time-to-buffer overflow distribution in a single-machine discrete-time system with finite capacity
ISSN: 1392-6292, 1648-3510Vydavateľské údaje: Vilnius Vilnius Gediminas Technical University 01.03.2020Vydané v Mathematical modelling and analysis (01.03.2020)“…A model of a single-machine production system with finite magazine capacity is investigated. The input flow of jobs is organized according to geometric…”
Získať plný text
Journal Article -
4
Distribution of time to buffer overflow in a finite-buffer manufacturing model with unreliable machine
ISSN: 2261-236X, 2274-7214, 2261-236XVydavateľské údaje: Les Ulis EDP Sciences 01.01.2017Vydané v MATEC web of conferences (01.01.2017)“…One of the most important characteristic of each queueing model is time to buffer overflow…”
Získať plný text
Journal Article Konferenčný príspevok.. -
5
On the distribution of the time to buffer overflow in a queueing system with a general-type input stream
ISBN: 9781467311175, 1467311170Vydavateľské údaje: IEEE 01.07.2012Vydané v 2012 35th International Conference on Telecommunications and Signal Processing (01.07.2012)“…A finite-buffer queueing system with a generally distributed interarrival times and exponential service times is considered. A compact formula for the Laplace…”
Získať plný text
Konferenčný príspevok.. -
6
Level-Crossing Characteristics of an Actively Managed Buffer
ISSN: 2224-2708, 2224-2708Vydavateľské údaje: Basel MDPI AG 01.04.2024Vydané v Journal of sensor and actuator networks (01.04.2024)“… Second, we calculate the distribution of the amount of time needed to cross level L, the buffer overflow probability, and the average time to buffer overflow…”
Získať plný text
Journal Article -
7
A Unified Method of Analysis for Queues with Markovian Arrivals
ISSN: 1024-123X, 1563-5147Vydavateľské údaje: Cairo, Egypt Hindawi Limiteds 01.01.2012Vydané v Mathematical Problems in Engineering (01.01.2012)“… The method can be used for finding all basic characteristics like queue size distribution, workload distribution, loss ratio, time to buffer overflow, and so forth…”
Získať plný text
Journal Article -
8
Large deviations theory and efficient simulation of excessive backlogs in a GI/GI/m queue
ISSN: 0018-9286Vydavateľské údaje: New York, NY IEEE 01.12.1991Vydané v IEEE transactions on automatic control (01.12.1991)“…The problem of using importance sampling to estimate the average time to buffer overflow in a stable GI/GI/m queue is considered…”
Získať plný text
Journal Article -
9
Correctness within a constant of an optimal buffer allocation rule of thumb
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York IEEE 01.05.1994Vydané v IEEE transactions on information theory (01.05.1994)“… associated with the time to buffer overflow, such as maximizing its mean or maximizing the probability that it exceeds some value…”
Získať plný text
Journal Article -
10
The optimal buffer allocation problem
ISSN: 0018-9448Vydavateľské údaje: New York, NY IEEE 01.07.1989Vydané v IEEE transactions on information theory (01.07.1989)“… The goal is to optimize some performance criterion associated with the time to buffer overflow, such as its mean or the probability that it exceeds some value…”
Získať plný text
Journal Article Konferenčný príspevok.. -
11
Large deviations theory and efficient simulation of excessive backlogs in a < e1 > GI < /e1 > / < e1 > GI < /e1 > / < e1 > m < /e1 > queue
ISSN: 0018-9286Vydavateľské údaje: 01.12.1991Vydané v IEEE transactions on automatic control (01.12.1991)“…The problem of using importance sampling to estimate the average time to buffer overflow in a stable < e1 > GI < /e1 > / < e1 > GI < /e1 > / < e1 > m < /e1…”
Získať plný text
Journal Article

