Springer Science and Business Media LLC

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Về một hàng đợi đồng bộ với hai bộ đệm hữu hạn Dịch bởi AI
Springer Science and Business Media LLC - - 2000
Misa Takahashi, Hideo Ōsawa, Takehisa Fujisawa
Trong bài báo này, chúng tôi xem xét một hàng đợi đồng bộ (hoặc nút đồng bộ) bao gồm hai bộ đệm với dung lượng hữu hạn. Một dòng token đến hệ thống hình thành theo quá trình Poisson, trong khi dòng còn lại hình thành theo quá trình đổi mới PH. Các token sẽ được giữ trong các bộ đệm cho đến khi có một token khả dụng từ mỗi dòng, và sau đó một token nhóm sẽ được phát hành ngay lập tức như một sự rời... hiện toàn bộ
Special issue on ‘Analytical and computational methods in probability theory and its applications conference’
Springer Science and Business Media LLC - Tập 94 - Trang 211-212 - 2020
Dmitry Korshunov, Alexander Veretennikov
Asymptotically optimal staffing of service systems with joint QoS constraints
Springer Science and Business Media LLC - Tập 78 - Trang 359-386 - 2014
Jing Zan, John J. Hasenbein, David P. Morton
We consider the problem of staffing large-scale service systems with multiple customer classes and multiple dedicated server pools under joint quality-of-service (QoS) constraints. We first analyze the case in which arrival rates are deterministic and the QoS metric is the probability a customer is queued, given by the Erlang-C formula. We use the Janssen–Van Leeuwaarden–Zwart bounds to obtain asy... hiện toàn bộ
Taking Account of Correlations Between Streams in Queueing Network Approximations
Springer Science and Business Media LLC - Tập 49 Số 3-4 - Trang 261-281 - 2005
Sun-Kyo Kim, Ravi Muralidharan, Colm Art O’Cinneide
The departure process of discrete-time queueing systems with Markovian type inputs
Springer Science and Business Media LLC - Tập 36 - Trang 201-220 - 2000
Huei-Wen Ferng, Jin-Fu Chang
This paper proposes a unified matrix-analytic approach to characterize the output processes of general discrete-time lossless/lossy queueing systems in which time is synchronized/slotted into fixed length intervals called slots. The arrival process can be continuous- or discrete-time Markovian processes. It can be either renewal or non-renewal. The service of a customer commences at the beginning ... hiện toàn bộ
On the estimation of mixing coefficients for a multiphase service system
Springer Science and Business Media LLC - - 1997
Mark Kelbert, Alexandre Veretennikov
We consider a multiphase service system with a Poisson input flow. Its intensity depends on the number of customers under service. The stationary distribution for this system can be found in an explicit form. We study the rate of convergence to this stationary distribution as well as the bounds for some mixing coefficients. Coupling arguments and Liapunov's function approach form the basis of cons... hiện toàn bộ
A Storage Process with Local Time Input
Springer Science and Business Media LLC - Tập 46 - Trang 557-577 - 2004
Petteri Mannersalo, Ilkka Norros, Paavo Salminen
In this paper we introduce a storage process with singular continuous input. The input process is defined as the local time of a stationary reflecting Brownian motion with drift. Many basic charateristics of the process are computed explicitly, e.g., stationary distribution, distributions of the starting and ending time of on-going busy and idle periods. We also consider the multifractal spectrum ... hiện toàn bộ
Performance analysis of a slotted-ALOHA protocol on a capture channel with fading
Springer Science and Business Media LLC - Tập 34 - Trang 1-35 - 2000
Jeetendra Sant, Vinod Sharma
We consider the slotted ALOHA protocol on a channel with a capture effect. There are M < ∞ users each with an infinite buffer. If in a slot, i packets are transmitted, then the probability of a successful reception of a packet is q i. This model contains the CDMA protocols as special cases. We obtain sufficient rate conditions, which are close to necessary for stability of the system, when the arr... hiện toàn bộ
Sharp and simple bounds for the Erlang delay and loss formulae
Springer Science and Business Media LLC - Tập 64 - Trang 119-143 - 2009
Arie Harel
We prove some simple and sharp lower and upper bounds for the Erlang delay and loss formulae and for the number of servers that invert the Erlang delay and loss formulae. We also suggest simple and sharp approximations for the number of servers that invert the Erlang delay and loss formulae. We illustrate the importance of these bounds by using them to establish convexity proofs. We show that the ... hiện toàn bộ
A new approach to the busy period of the M/M/1 queue
Springer Science and Business Media LLC - Tập 35 - Trang 105-115 - 2000
Kimberly K.J. Kinateder, Eui Yong Lee
In this paper, we provide a new approach to the computation of the Laplace transform of the length of the busy period of the M/M/1 queue with constrained workload (finite dam), without the use of complex analysis.
Tổng số: 1,313   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10