Увійти

Готові списки джерел за темами / Distributions à queues lourdes / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Distributions à queues lourdes.

Статті в журналах з теми "Distributions à queues lourdes"

Автор: Grafiati

Опубліковано: 26 жовтня 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Distributions à queues lourdes".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Tahiananirina, RAZAFINDRALAMBO Hasina, RAZAFIMANDIMBY Honoré, RAMAHAZOSOA Irrish Parker, RABEHARISOA Jean Marc, and RATIARISON Adolphe Andriamanga. "Estimations Des Quantiles Extrêmes Des Précipitations Convectives Avec Les Distributions des Valeurs Extrêmes Généralisées : Cas Des Plaines De La Basse Betsiboka." International Journal of Progressive Sciences and Technologies 40, no. 1 (August 30, 2023): 308. http://dx.doi.org/10.52155/ijpsat.v40.1.5578.

Повний текст джерела

Анотація:

Résumé - L’objectif de cette étude est d’estimer la fréquence de retour des précipitations convectives extrêmes dans les plaines de la basse Betsiboka, Madagascar. L’approche méthodologique consiste à trouver les distributions statistiques des pluies convectives journalières maximales annuelles de 1959 à 2021 en les ajustant avec des distributions des valeurs extrêmes généralisées. Les paramètres des distributions des valeurs extrêmes généralisées ont été estimés par la méthode des moments pondérés. Les résultats obtenus montrent que l’ajustement des données étudiées avec les distributions des valeurs extrêmes généralisées sont adéquats. En outre, les maximas annuels suivent des distributions à queues lourdes. Les pluies convectives extrêmes sont imprévisibles et engendrent des crues et inondations qui pourront avoir des conséquences économiques et sociales graves dans cette zone. L’estimation de la récurrence de ces évènements météorologiques extrêmes est donc d’un grand intérêt.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Szczotka, Władysław. "Stationary representation of queues. I." Advances in Applied Probability 18, no. 3 (September 1986): 815–48. http://dx.doi.org/10.2307/1427189.

Повний текст джерела

Анотація:

The paper deals with the asymptotic behaviour of queues for which the generic sequence is not necessarily stationary but is asymptotically stationary in some sense. The latter property is defined by an appropriate type of convergence of probability distributions of the sequences to the distribution of a stationary sequence We consider six types of convergence of to The main result is as follows: if the sequence of the distributions converges in one of six ways then the sequence of distributions of the sequences converges in the same way, independently of initial conditions. Furthermore the limiting distribution is the same as the limiting distribution obtained by the weak convergence of the distributions Here wk and w∗k denote the waiting time of the kth unit in the queue generated by (v, u) and (v0, u0) respectively.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Szczotka, Władysław. "Stationary representation of queues. I." Advances in Applied Probability 18, no. 03 (September 1986): 815–48. http://dx.doi.org/10.1017/s0001867800016086.

Повний текст джерела

Анотація:

The paper deals with the asymptotic behaviour of queues for which the generic sequence is not necessarily stationary but is asymptotically stationary in some sense. The latter property is defined by an appropriate type of convergence of probability distributions of the sequences to the distribution of a stationary sequence We consider six types of convergence of to The main result is as follows: if the sequence of the distributions converges in one of six ways then the sequence of distributions of the sequences converges in the same way, independently of initial conditions. Furthermore the limiting distribution is the same as the limiting distribution obtained by the weak convergence of the distributions Here wk and w∗ k denote the waiting time of the kth unit in the queue generated by ( v, u ) and ( v 0, u 0) respectively.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Chaudhry, Mohan L., Indra, and Vijay Rajan. "Analytically Simple and Computationally Efficient Solution to Geo/G/1 and Geo/G/1/N Queues Involving Heavy-tailed Distributions for Service Times." Calcutta Statistical Association Bulletin 70, no. 1 (May 2018): 74–85. http://dx.doi.org/10.1177/0008068318770566.

Повний текст джерела

Анотація:

The previous studies pertaining to the queues Geo/G/1 and Geo/G/1/N involve light-tailed distributions for service time. However, due to applications of heavy-tailed distributions in computer science and financial engineering, these distributions are used for service time. This article provides a simple and computationally efficient solution to the queues Geo/G/1 and Geo/G/1/N involving heavy-tailed distributions for service times.

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Karpelevitch, F. I., and A. Ya Kreinin. "Joint distributions in Poissonian tandem queues." Queueing Systems 12, no. 3-4 (September 1992): 273–86. http://dx.doi.org/10.1007/bf01158803.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Taylor, Nicholas B., and Benjamin G. Heydecker. "Estimating probability distributions of dynamic queues." Transportation Planning and Technology 38, no. 1 (November 20, 2014): 3–27. http://dx.doi.org/10.1080/03081060.2014.976987.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Wang, P. Patrick, and Vicky F. Locker. "Steady-State Distributions Of Parallel Queues." INFOR: Information Systems and Operational Research 39, no. 1 (February 2001): 89–106. http://dx.doi.org/10.1080/03155986.2001.11732428.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Miyazawa, Masakiyo, and Ronald W. Wolff. "Symmetric queues with batch departures and their networks." Advances in Applied Probability 28, no. 1 (March 1996): 308–26. http://dx.doi.org/10.2307/1427923.

Повний текст джерела

Анотація:

Batch departures arise in various applications of queues. In particular, such models have been studied recently in connection with production systems. For the most part, however, these models assume Poisson arrivals and exponential service times; little is known about them under more general settings. We consider how their stationary queue length distributions are affected by the distributions of interarrival times, service times and departing batch sizes of customers. Since this is not an easy problem even for single departure models, we first concentrate on single-node queues with a symmetric service discipline, which is known to have nice properties. We start with pre-emptive LIFO, a special case of the symmetric service discipline, and then consider symmetric queues with Poisson arrivals. Stability conditions and stationary queue length distributions are obtained for them, and several stochastic order relations are considered. For the symmetric queues and Poisson arrivals, we also discuss their network. Stability conditions and the stationary joint queue length distribution are obtained for this network.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Miyazawa, Masakiyo, and Ronald W. Wolff. "Symmetric queues with batch departures and their networks." Advances in Applied Probability 28, no. 01 (March 1996): 308–26. http://dx.doi.org/10.1017/s0001867800027385.

Повний текст джерела

Анотація:

Batch departures arise in various applications of queues. In particular, such models have been studied recently in connection with production systems. For the most part, however, these models assume Poisson arrivals and exponential service times; little is known about them under more general settings. We consider how their stationary queue length distributions are affected by the distributions of interarrival times, service times and departing batch sizes of customers. Since this is not an easy problem even for single departure models, we first concentrate on single-node queues with a symmetric service discipline, which is known to have nice properties. We start with pre-emptive LIFO, a special case of the symmetric service discipline, and then consider symmetric queues with Poisson arrivals. Stability conditions and stationary queue length distributions are obtained for them, and several stochastic order relations are considered. For the symmetric queues and Poisson arrivals, we also discuss their network. Stability conditions and the stationary joint queue length distribution are obtained for this network.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Hunter, Jeffrey J. "Filtering of Markov renewal queues, IV: Flow processes in feedback queues." Advances in Applied Probability 17, no. 2 (June 1985): 386–407. http://dx.doi.org/10.2307/1427147.

Повний текст джерела

Анотація:

This paper is a continuation of the study of a class of queueing systems where the queue-length process embedded at basic transition points, which consist of ‘arrivals’, ‘departures’ and ‘feedbacks’, is a Markov renewal process (MRP). The filtering procedure of Çinlar (1969) was used in [12] to show that the queue length process embedded separately at ‘arrivals’, ‘departures’, ‘feedbacks’, ‘inputs’ (arrivals and feedbacks), ‘outputs’ (departures and feedbacks) and ‘external’ transitions (arrivals and departures) are also MRP. In this paper expressions for the elements of each Markov renewal kernel are derived, and thence expressions for the distribution of the times between transitions, under stationary conditions, are found for each of the above flow processes. In particular, it is shown that the inter-event distributions for the arrival process and the departure process are the same, with an equivalent result holding for inputs and outputs. Further, expressions for the stationary joint distributions of successive intervals between events in each flow process are derived and interconnections, using the concept of reversed Markov renewal processes, are explored. Conditions under which any of the flow processes are renewal processes or, more particularly, Poisson processes are also investigated. Special cases including, in particular, the M/M/1/N and M/M/1 model with instantaneous Bernoulli feedback, are examined.

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Hunter, Jeffrey J. "Filtering of Markov renewal queues, IV: Flow processes in feedback queues." Advances in Applied Probability 17, no. 02 (June 1985): 386–407. http://dx.doi.org/10.1017/s0001867800015032.

Повний текст джерела

Анотація:

This paper is a continuation of the study of a class of queueing systems where the queue-length process embedded at basic transition points, which consist of ‘arrivals’, ‘departures’ and ‘feedbacks’, is a Markov renewal process (MRP). The filtering procedure of Çinlar (1969) was used in [12] to show that the queue length process embedded separately at ‘arrivals’, ‘departures’, ‘feedbacks’, ‘inputs’ (arrivals and feedbacks), ‘outputs’ (departures and feedbacks) and ‘external’ transitions (arrivals and departures) are also MRP. In this paper expressions for the elements of each Markov renewal kernel are derived, and thence expressions for the distribution of the times between transitions, under stationary conditions, are found for each of the above flow processes. In particular, it is shown that the inter-event distributions for the arrival process and the departure process are the same, with an equivalent result holding for inputs and outputs. Further, expressions for the stationary joint distributions of successive intervals between events in each flow process are derived and interconnections, using the concept of reversed Markov renewal processes, are explored. Conditions under which any of the flow processes are renewal processes or, more particularly, Poisson processes are also investigated. Special cases including, in particular, the M/M/1/N and M/M/1 model with instantaneous Bernoulli feedback, are examined.

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Tarasov, V. N. "Analysis of queues with hyperexponential arrival distributions." Problems of Information Transmission 52, no. 1 (January 2016): 14–23. http://dx.doi.org/10.1134/s0032946016010038.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Harrison, Peter G., and Edwige Pitel. "Response time distributions in tandem G-networks." Journal of Applied Probability 32, no. 1 (March 1995): 224–46. http://dx.doi.org/10.2307/3214932.

Повний текст джерела

Анотація:

The Laplace transform of the probability distribution of the end-to-end delay in tandem networks is obtained where the first and/or second queue are G-queues, i.e. they have negative arrivals. For the most general case the method is based on the solution of a boundary value problem on a closed contour in the complex plane, which itself reduces to the solution of a Fredholm integral equation of the second kind. We also consider the dependence or independence of the sojourn times at each queue in the two special cases where only one of the queues is a G-queue, the other having no negative arrivals.

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Harrison, Peter G., and Edwige Pitel. "Response time distributions in tandem G-networks." Journal of Applied Probability 32, no. 01 (March 1995): 224–46. http://dx.doi.org/10.1017/s0021900200102682.

Повний текст джерела

Анотація:

The Laplace transform of the probability distribution of the end-to-end delay in tandem networks is obtained where the first and/or second queue are G-queues, i.e. they have negative arrivals. For the most general case the method is based on the solution of a boundary value problem on a closed contour in the complex plane, which itself reduces to the solution of a Fredholm integral equation of the second kind. We also consider the dependence or independence of the sojourn times at each queue in the two special cases where only one of the queues is a G-queue, the other having no negative arrivals.

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Ayesta, Urtzi. "A Unifying Conservation Law for Single-Server Queues." Journal of Applied Probability 44, no. 4 (December 2007): 1078–87. http://dx.doi.org/10.1239/jap/1197908826.

Повний текст джерела

Анотація:

We develop a conservation law for a multi-class GI/GI/1 queue operating under a general work-conserving scheduling discipline. For single-class single-server queues, conservation laws have been obtained for both nonanticipating and anticipating disciplines with general service time distributions. For multi-class single-server queues, conservation laws have been obtained for (i) nonanticipating disciplines with exponential service time distributions and (ii) nonpreemptive nonanticipating disciplines with general service time distributions. The unifying conservation law we develop generalizes already existing conservation laws. In addition, it covers popular nonanticipating multi-class time-sharing disciplines such as discriminatory processor sharing (DPS) and generalized processor sharing (GPS) with general service time distributions. As an application, we show that the unifying conservation law can be used to compare the expected unconditional response time under two scheduling disciplines.

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Ayesta, Urtzi. "A Unifying Conservation Law for Single-Server Queues." Journal of Applied Probability 44, no. 04 (December 2007): 1078–87. http://dx.doi.org/10.1017/s0021900200003752.

Повний текст джерела

Анотація:

We develop a conservation law for a multi-class GI/GI/1 queue operating under a general work-conserving scheduling discipline. For single-class single-server queues, conservation laws have been obtained for both nonanticipating and anticipating disciplines with general service time distributions. For multi-class single-server queues, conservation laws have been obtained for (i) nonanticipating disciplines with exponential service time distributions and (ii) nonpreemptive nonanticipating disciplines with general service time distributions. The unifying conservation law we develop generalizes already existing conservation laws. In addition, it covers popular nonanticipating multi-class time-sharing disciplines such as discriminatory processor sharing (DPS) and generalized processor sharing (GPS) with general service time distributions. As an application, we show that the unifying conservation law can be used to compare the expected unconditional response time under two scheduling disciplines.

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Gelenbe, Erol, Peter Glynn, and Karl Sigman. "Queues with negative arrivals." Journal of Applied Probability 28, no. 1 (March 1991): 245–50. http://dx.doi.org/10.2307/3214756.

Повний текст джерела

Анотація:

We study single-server queueing models where in addition to regular arriving customers, there are negative arrivals. A negative arrival has the effect of removing a customer from the queue. The way in which this removal is specified gives rise to several different models. Unlike the standard FIFOGI/GI/1 model, the stability conditions for these new models may depend upon more than just the arrival and service rates; the entire distributions of interarrival and service times may be involved.

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Gelenbe, Erol, Peter Glynn, and Karl Sigman. "Queues with negative arrivals." Journal of Applied Probability 28, no. 01 (March 1991): 245–50. http://dx.doi.org/10.1017/s0021900200039589.

Повний текст джерела

Анотація:

We study single-server queueing models where in addition to regular arriving customers, there are negative arrivals. A negative arrival has the effect of removing a customer from the queue. The way in which this removal is specified gives rise to several different models. Unlike the standard FIFO GI/GI/1 model, the stability conditions for these new models may depend upon more than just the arrival and service rates; the entire distributions of interarrival and service times may be involved.

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Li, Junping, and Anyue Chen. "Decay property of stopped Markovian bulk-arriving queues." Advances in Applied Probability 40, no. 1 (March 2008): 95–121. http://dx.doi.org/10.1239/aap/1208358888.

Повний текст джерела

Анотація:

We consider decay properties including the decay parameter, invariant measures, invariant vectors, and quasistationary distributions of a Markovian bulk-arriving queue that stops immediately after hitting the zero state. Investigating such behavior is crucial in realizing the busy period and some other related properties of Markovian bulk-arriving queues. The exact value of the decay parameter λC is obtained and expressed explicitly. The invariant measures, invariant vectors, and quasistationary distributions are then presented. We show that there exists a family of invariant measures indexed by λ ∈ [0, λC]. We then show that, under some conditions, there exists a family of quasistationary distributions, also indexed by λ ∈ [0, λC]. The generating functions of these invariant measures and quasistationary distributions are presented. We further show that a stopped Markovian bulk-arriving queue is always λC-transient and some deep properties are revealed. The clear geometric interpretation of the decay parameter is explained. A few examples are then provided to illustrate the results obtained in this paper.

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Li, Junping, and Anyue Chen. "Decay property of stopped Markovian bulk-arriving queues." Advances in Applied Probability 40, no. 01 (March 2008): 95–121. http://dx.doi.org/10.1017/s0001867800002391.

Повний текст джерела

Анотація:

We consider decay properties including the decay parameter, invariant measures, invariant vectors, and quasistationary distributions of a Markovian bulk-arriving queue that stops immediately after hitting the zero state. Investigating such behavior is crucial in realizing the busy period and some other related properties of Markovian bulk-arriving queues. The exact value of the decay parameter λCis obtained and expressed explicitly. The invariant measures, invariant vectors, and quasistationary distributions are then presented. We show that there exists a family of invariant measures indexed by λ ∈ [0, λC]. We then show that, under some conditions, there exists a family of quasistationary distributions, also indexed by λ ∈ [0, λC]. The generating functions of these invariant measures and quasistationary distributions are presented. We further show that a stopped Markovian bulk-arriving queue is always λC-transient and some deep properties are revealed. The clear geometric interpretation of the decay parameter is explained. A few examples are then provided to illustrate the results obtained in this paper.

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Chang, Cheng-Shang. "On the input-output map of a G/G/1 queue." Journal of Applied Probability 31, no. 4 (December 1994): 1128–33. http://dx.doi.org/10.2307/3215337.

Повний текст джерела

Анотація:

In this note, we consider G/G/1 queues with stationary and ergodic inputs. We show that if the service times are independent and identically distributed with unbounded supports, then for a given mean of interarrival times, the number of sequences (distributions) of interarrival times that induce identical distributions on interdeparture times is at most 1. As a direct consequence, among all the G/M/1 queues with stationary and ergodic inputs, the M/M/1 queue is the only queue whose departure process is identically distributed as the input process.

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Chang, Cheng-Shang. "On the input-output map of a G/G/1 queue." Journal of Applied Probability 31, no. 04 (December 1994): 1128–33. http://dx.doi.org/10.1017/s0021900200099654.

Повний текст джерела

Анотація:

In this note, we consider G/G/1 queues with stationary and ergodic inputs. We show that if the service times are independent and identically distributed with unbounded supports, then for a given mean of interarrival times, the number of sequences (distributions) of interarrival times that induce identical distributions on interdeparture times is at most 1. As a direct consequence, among all the G/M/1 queues with stationary and ergodic inputs, the M/M/1 queue is the only queue whose departure process is identically distributed as the input process.

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Boxma, O. J., and V. Dumas. "Fluid queues with long-tailed activity period distributions." Computer Communications 21, no. 17 (November 1998): 1509–29. http://dx.doi.org/10.1016/s0140-3664(98)00219-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Fakinos, D. "Equilibrium queue size distributions for semi-reversible queues." Stochastic Processes and their Applications 36, no. 2 (December 1990): 331–37. http://dx.doi.org/10.1016/0304-4149(90)90099-e.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Ciucu, Florin, Felix Poloczek, and Amr Rizk. "Queue and Loss Distributions in Finite-Buffer Queues." ACM SIGMETRICS Performance Evaluation Review 47, no. 1 (December 17, 2019): 65–66. http://dx.doi.org/10.1145/3376930.3376972.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Takács, Lajos. "Limit distributions for queues and random rooted trees." Journal of Applied Mathematics and Stochastic Analysis 6, no. 3 (January 1, 1993): 189–216. http://dx.doi.org/10.1155/s1048953393000176.

Повний текст джерела

Анотація:

In this paper several limit theorems are proved for the fluctuations of the queue size during the initial busy period of a queuing process with one server. These theorems are used to find the solutions of various problems connected with the heights and widths of random rooted trees.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Ciucu, Florin, Felix Poloczek, and Amr Rizk. "Queue and Loss Distributions in Finite-Buffer Queues." Proceedings of the ACM on Measurement and Analysis of Computing Systems 3, no. 2 (June 19, 2019): 1–29. http://dx.doi.org/10.1145/3341617.3326146.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Kijima, Masaaki, and Naoki Makimoto. "Computation of quasi-stationary distributions in Markovian queues." Computers & Industrial Engineering 27, no. 1-4 (September 1994): 429–32. http://dx.doi.org/10.1016/0360-8352(94)90326-3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Shanthikumar, J. George, and Ushio Sumita. "On the busy-period distributions of M/G/1/K queues by state-dependent arrivals and FCFS/LCFS-P service disciplines." Journal of Applied Probability 22, no. 4 (December 1985): 912–19. http://dx.doi.org/10.2307/3213958.

Повний текст джерела

Анотація:

The busy-period distributions of M/G/1/K queues with state-dependent arrival rates are considered. Two recursion formulas for the Laplace–Stieltjes transforms of the busy periods under the FCFS and preempt resume LCFS service disciplines are obtained. It is shown that the busy-period distributions for the two service disciplines are, in general, different, in contrast to the fact that they coincide for ordinary M/G/1 queues. For deterministic service times and arrival rates non-increasing in the number of customers in the system, stochastic ordering between these two busy periods is also established.

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Shanthikumar, J. George, and Ushio Sumita. "On the busy-period distributions of M/G/1/K queues by state-dependent arrivals and FCFS/LCFS-P service disciplines." Journal of Applied Probability 22, no. 04 (December 1985): 912–19. http://dx.doi.org/10.1017/s0021900200108149.

Повний текст джерела

Анотація:

The busy-period distributions of M/G/1/K queues with state-dependent arrival rates are considered. Two recursion formulas for the Laplace–Stieltjes transforms of the busy periods under the FCFS and preempt resume LCFS service disciplines are obtained. It is shown that the busy-period distributions for the two service disciplines are, in general, different, in contrast to the fact that they coincide for ordinary M/G/1 queues. For deterministic service times and arrival rates non-increasing in the number of customers in the system, stochastic ordering between these two busy periods is also established.

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Lee, Ho Woo, Se Won Lee, and Jongwoo Jeon. "Using factorization in analyzing D-BMAP/G/1 queues." Journal of Applied Mathematics and Stochastic Analysis 2005, no. 2 (January 1, 2005): 119–32. http://dx.doi.org/10.1155/jamsa.2005.119.

Повний текст джерела

Анотація:

We demonstrate how one can use the factorization property to derive the queue-length distributions of the discrete-time BMAP/G/1 queues with complex operational behavior during the idle period. The procedure demonstrated in this paper can be applied to the analysis of many other discrete-time BMAP/G/1 queues with more behavioral complexities.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Glynn, Peter W., and Ward Whitt. "A new view of the heavy-traffic limit theorem for infinite-server queues." Advances in Applied Probability 23, no. 1 (March 1991): 188–209. http://dx.doi.org/10.2307/1427517.

Повний текст джерела

Анотація:

This paper presents a new approach for obtaining heavy-traffic limits for infinite-server queues and open networks of infinite-server queues. The key observation is that infinite-server queues having deterministic service times can easily be analyzed in terms of the arrival counting process. A variant of the same idea applies when the service times take values in a finite set, so this is the key assumption. In addition to new proofs of established results, the paper contains several new results, including limits for the work-in-system process, limits for steady-state distributions, limits for open networks with general customer routes, and rates of convergence. The relatively tractable Gaussian limits are promising approximations for many-server queues and open networks of such queues, possibly with finite waiting rooms.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Glynn, Peter W., and Ward Whitt. "A new view of the heavy-traffic limit theorem for infinite-server queues." Advances in Applied Probability 23, no. 01 (March 1991): 188–209. http://dx.doi.org/10.1017/s0001867800023399.

Повний текст джерела

Анотація:

This paper presents a new approach for obtaining heavy-traffic limits for infinite-server queues and open networks of infinite-server queues. The key observation is that infinite-server queues having deterministic service times can easily be analyzed in terms of the arrival counting process. A variant of the same idea applies when the service times take values in a finite set, so this is the key assumption. In addition to new proofs of established results, the paper contains several new results, including limits for the work-in-system process, limits for steady-state distributions, limits for open networks with general customer routes, and rates of convergence. The relatively tractable Gaussian limits are promising approximations for many-server queues and open networks of such queues, possibly with finite waiting rooms.

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Pollett, P. K., and P. G. Taylor. "On the Problem of Establishing the Existence of Stationary Distributions for Continuous-Time Markov Chains." Probability in the Engineering and Informational Sciences 7, no. 4 (October 1993): 529–43. http://dx.doi.org/10.1017/s0269964800003119.

Повний текст джерела

Анотація:

We consider the problem of establishing the existence of stationary distributions for continuous-time Markov chains directly from the transition rates Q. Given an invariant probability distribution m for Q, we show that a necessary and sufficient condition for m to be a stationary distribution for the minimal process is that Q be regular. We provide sufficient conditions for the regularity of Q that are simple to verify in practice, thus allowing one to easily identify stationary distributions for a variety of models. To illustrate our results, we shall consider three classes of multidimensional Markov chains, namely, networks of queues with batch movements, semireversible queues, and partially balanced Markov processes.

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Schassberger, R., and H. Daduna. "Sojourn times in queuing networks with multiserver modes." Journal of Applied Probability 24, no. 2 (June 1987): 511–21. http://dx.doi.org/10.2307/3214274.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Schassberger, R., and H. Daduna. "Sojourn times in queuing networks with multiserver modes." Journal of Applied Probability 24, no. 02 (June 1987): 511–21. http://dx.doi.org/10.1017/s0021900200031144.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Chao, Xiuli, Qi-Ming He, and Sheldon Ross. "Tollbooth tandem queues with infinite homogeneous servers." Journal of Applied Probability 52, no. 4 (December 2015): 941–61. http://dx.doi.org/10.1239/jap/1450802745.

Повний текст джерела

Анотація:

In this paper we analyze a tollbooth tandem queueing problem with an infinite number of servers. A customer starts service immediately upon arrival but cannot leave the system before all customers who arrived before him/her have left, i.e. customers depart the system in the same order as they arrive. Distributions of the total number of customers in the system, the number of departure-delayed customers in the system, and the number of customers in service at time t are obtained in closed form. Distributions of the sojourn times and departure delays of customers are also obtained explicitly. Both transient and steady state solutions are derived first for Poisson arrivals, and then extended to cases with batch Poisson and nonstationary Poisson arrival processes. Finally, we report several stochastic ordering results on how system performance measures are affected by arrival and service processes.

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Chao, Xiuli, Qi-Ming He, and Sheldon Ross. "Tollbooth tandem queues with infinite homogeneous servers." Journal of Applied Probability 52, no. 04 (December 2015): 941–61. http://dx.doi.org/10.1017/s0021900200113002.

Повний текст джерела

Анотація:

In this paper we analyze a tollbooth tandem queueing problem with an infinite number of servers. A customer starts service immediately upon arrival but cannot leave the system before all customers who arrived before him/her have left, i.e. customers depart the system in the same order as they arrive. Distributions of the total number of customers in the system, the number of departure-delayed customers in the system, and the number of customers in service at time t are obtained in closed form. Distributions of the sojourn times and departure delays of customers are also obtained explicitly. Both transient and steady state solutions are derived first for Poisson arrivals, and then extended to cases with batch Poisson and nonstationary Poisson arrival processes. Finally, we report several stochastic ordering results on how system performance measures are affected by arrival and service processes.

Стилі APA, Harvard, Vancouver, ISO та ін.

39

König, Dieter, and Volker Schmidt. "Stationary queue-length characteristics in queues with delayed feedback." Journal of Applied Probability 22, no. 2 (June 1985): 394–407. http://dx.doi.org/10.2307/3213782.

Повний текст джерела

Анотація:

A class of two-node queueing networks with general stationary ergodic governing sequence is considered. This means that, in particular, a non-Poissonian arrival process and dependent service times, as well as a non-Bernoulli feedback mechanism are admitted. A mixing condition ensures that the limiting distributions of the number of customers in the nodes observed in continuous time as well as at certain embedded epochs can be expressed by the Palm distributions of appropriately chosen marked point processes. This gives the possibility of connecting the classical concept of embedding with a general point-process approach. Furthermore, it leads to simple proofs of relationships between the limiting distributions. An example is given to illustrate how these relationships can be used to derive explicit formulas for various stationary queueing characteristics.

Стилі APA, Harvard, Vancouver, ISO та ін.

40

König, Dieter, and Volker Schmidt. "Stationary queue-length characteristics in queues with delayed feedback." Journal of Applied Probability 22, no. 02 (June 1985): 394–407. http://dx.doi.org/10.1017/s0021900200037852.

Повний текст джерела

Анотація:

A class of two-node queueing networks with general stationary ergodic governing sequence is considered. This means that, in particular, a non-Poissonian arrival process and dependent service times, as well as a non-Bernoulli feedback mechanism are admitted. A mixing condition ensures that the limiting distributions of the number of customers in the nodes observed in continuous time as well as at certain embedded epochs can be expressed by the Palm distributions of appropriately chosen marked point processes. This gives the possibility of connecting the classical concept of embedding with a general point-process approach. Furthermore, it leads to simple proofs of relationships between the limiting distributions. An example is given to illustrate how these relationships can be used to derive explicit formulas for various stationary queueing characteristics.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Neuts, Marcel F. "Generalizations of the Pollaczek-Khinchin integral equation in the theory of queues." Advances in Applied Probability 18, no. 4 (December 1986): 952–90. http://dx.doi.org/10.2307/1427258.

Повний текст джерела

Анотація:

A classical result in queueing theory states that in the stable M/G/1 queue, the stationary distribution W(x) of the waiting time of an arriving customer or of the virtual waiting time satisfies a linear Volterra integral equation of the second kind, of convolution type. For many variants of the M/G/1 queue, there are corresponding integral equations, which in most cases differ from the Pollaczek–Khinchin equation only in the form of the inhomogeneous term. This leads to interesting factorizations of the waiting-time distribution and to substantial algorithmic simplifications. In a number of priority queues, the waiting-time distributions satisfy Volterra integral equations whose kernel is a functional of the busy-period distribution in related M/G/1 queues. In other models, such as the M/G/1 queue with Bernoulli feedback or with limited admissions of customers per service, there is a more basic integral equation of Volterra type, which yields a probability distribution in terms of which the waiting-time distributions are conveniently expressed.For several complex queueing models with an embedded Markov renewal process of M/G/1 type, one obtains matrix Volterra integral equations for the waiting-time distributions or for related vectors of mass functions. Such models include the M/SM/1 and the N/G/1 queues, as well as the M/G/1 queue with some forms of bulk service.When the service-time distributions are of phase type, the numerical computation of waiting-time distributions may commonly be reduced to the solution of systems of linear differential equations with constant coefficients.

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Whitt, Ward. "LIMITS FOR CUMULATIVE INPUT PROCESSES TO QUEUES." Probability in the Engineering and Informational Sciences 14, no. 2 (April 2000): 123–50. http://dx.doi.org/10.1017/s0269964800142019.

Повний текст джерела

Анотація:

We establish functional central limit theorems (FCLTs) for a cumulative input process to a fluid queue from the superposition of independent on–off sources, where the on periods and off periods may have heavy-tailed probability distributions. Variants of these FCLTs hold for cumulative busy-time and idle-time processes associated with standard queueing models. The heavy-tailed on-period and off-period distributions can cause the limit process to have discontinuous sample paths (e.g., to be a non-Brownian stable process or more general Lévy process) even though the converging processes have continuous sample paths. Consequently, we exploit the Skorohod M1 topology on the function space D of right-continuous functions with left limits. The limits here combined with the previously established continuity of the reflection map in the M1 topology imply both heavy-traffic and non-heavy-traffic FCLTs for buffer-content processes in stochastic fluid networks.

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Miyoshi, Naoto, and Toshiharu Hasegawa. "Smoothed Perturbation Analysis for Single-Server Queues by Some General Service Disciplines." Advances in Applied Probability 29, no. 2 (June 1997): 545–66. http://dx.doi.org/10.2307/1428016.

Повний текст джерела

Анотація:

We consider some single-server queues with general service disciplines, where the family of the queueing processes are parameterized by the service time distributions. Through the smoothed perturbation analysis (SPA) technique, we present under some mild conditions a unified approach to give the strongly consistent estimator for the gradient of the steady-state mean sojourn time with respect to the parameter of service time distributions, provided that it exists. Although the implementation of the SPA requires the additional sub-paths in general, the derived estimator is given as suitable for single-run computation. Simulation results are presented for queues with non-preemptive and preemptive-resume priority disciplines which demonstrate the performance of our estimators.

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Miyoshi, Naoto, and Toshiharu Hasegawa. "Smoothed Perturbation Analysis for Single-Server Queues by Some General Service Disciplines." Advances in Applied Probability 29, no. 02 (June 1997): 545–66. http://dx.doi.org/10.1017/s0001867800028123.

Повний текст джерела

Анотація:

We consider some single-server queues with general service disciplines, where the family of the queueing processes are parameterized by the service time distributions. Through the smoothed perturbation analysis (SPA) technique, we present under some mild conditions a unified approach to give the strongly consistent estimator for the gradient of the steady-state mean sojourn time with respect to the parameter of service time distributions, provided that it exists. Although the implementation of the SPA requires the additional sub-paths in general, the derived estimator is given as suitable for single-run computation. Simulation results are presented for queues with non-preemptive and preemptive-resume priority disciplines which demonstrate the performance of our estimators.

Стилі APA, Harvard, Vancouver, ISO та ін.

45

D. Gangadhar, Nandyala, and Govind R. Kadambi. "Delay Distributions in Discrete Time Multiclass Tandem Communication Network Models." International journal of electrical and computer engineering systems 13, no. 6 (September 1, 2022): 417–25. http://dx.doi.org/10.32985/ijeces.13.6.1.

Повний текст джерела

Анотація:

An exact computational algorithm for the solution of a discrete time multiclass tandem network with a primary class and cross-traffic at each queue is developed. A sequence of truncated Lindley recursions is defined at each queue relating the delays experienced by the first packet from consecutive batches of a class at that queue. Using this sequence of recursions, a convolve-and-sweep algorithm is developed to compute the stationary distributions of the delay and inter-departure processes of each class at a queue, delays experienced by a typical packet from the primary class along its path as well as the mean end-to-end delay of such a packet. The proposed approach is designed to handle the non-renewal arrival processes arising in the network. The algorithmic solution is implemented as an abstract class which permits its easy adaptation to analyze different network configurations and sizes. The delays of a packet at different queues are shown to be associated random variables from which it follows that the variance of total delay is lower bounded by the sum of variances of delays at the queues along the path. The developed algorithm and the proposed lower bound on the variance of total delay are validated against simulation for a tandem network of two queues with three classes under different batch size distributions.

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Myers, Daniel S., and Mary K. Vernon. "Estimating queue length distributions for queues with random arrivals." ACM SIGMETRICS Performance Evaluation Review 40, no. 3 (December 4, 2012): 77–79. http://dx.doi.org/10.1145/2425248.2425268.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Walraevens, Joris, Dieter Claeys, and Tuan Phung-Duc. "Asymptotics of queue length distributions in priority retrial queues." Performance Evaluation 127-128 (November 2018): 235–52. http://dx.doi.org/10.1016/j.peva.2018.10.004.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Sigman, Karl, and Ward Whitt. "Heavy-traffic limits for nearly deterministic queues: stationary distributions." Queueing Systems 69, no. 2 (July 30, 2011): 145–73. http://dx.doi.org/10.1007/s11134-011-9253-y.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Henderson, W., B. S. Northcote, and P. G. Taylor. "Geometric equilibrium distributions for queues with interactive batch departures." Annals of Operations Research 48, no. 5 (October 1994): 493–511. http://dx.doi.org/10.1007/bf02033316.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Kijima, Masaaki. "Quasi-Stationary Distributions of Single-Server Phase-Type Queues." Mathematics of Operations Research 18, no. 2 (May 1993): 423–37. http://dx.doi.org/10.1287/moor.18.2.423.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!