[图书][B] Performance Modeling and Analysis of Communication Networks: A Lecture Note
P Tran-Gia, T Hoßfeld - 2021 - books.google.com
This textbook provides an introduction to common methods of performance modeling and
analysis of communication systems. These methods form the basis of traffic engineering …
analysis of communication systems. These methods form the basis of traffic engineering …
Discrete-time Modeling of NFV Accelerators that Exploit Batched Processing
Network Functions Virtualization (NFV) is among the latest network revolutions, promising
increased flexibility and avoiding network ossification. At the same time, all-software NFV …
increased flexibility and avoiding network ossification. At the same time, all-software NFV …
Sojourn time in a Processor Sharing Queue with batch arrivals (II)
F Guillemin, VK Rodriguez, A Simonian… - arXiv preprint arXiv …, 2020 - arxiv.org
For the $ M^{[X]}/M/1$ processor Sharing queue with batch arrivals, the sojourn time
$\Omega $ of a batch is investigated. We first show that the distribution of $\Omega $ can be …
$\Omega $ of a batch is investigated. We first show that the distribution of $\Omega $ can be …
On the sojourn of an arbitrary customer in an Processor Sharing Queue
F Guillemin, VQ Rodriguez - Stochastic Models, 2020 - Taylor & Francis
In this paper, we consider the number of departures seen by a tagged customer while in
service in a classical M/M/1 processor sharing queue. By exploiting the underlying …
service in a classical M/M/1 processor sharing queue. By exploiting the underlying …
Batch sojourn time in the processor sharing queue with geometric batch size
F Guillemin, A Simonian, R Nasri… - Stochastic …, 2021 - Taylor & Francis
In this paper, we analyze the sojourn time of an entire batch in a M [X]/M/1 processor sharing
queue, where geometrically distributed batches arrive according to a Poisson process and …
queue, where geometrically distributed batches arrive according to a Poisson process and …
Asymptotic analysis of the sojourn time of a batch in a M[X]/M/1 processor sharing queue
F Guillemin, A Simonian, R Nasri… - Stochastic Models, 2024 - Taylor & Francis
In this article, we exploit recent results for the Laplace transform of the sojourn time Ω of an
entire batch in the M [X]/M/1 processor sharing queue in order to derive the asymptotic …
entire batch in the M [X]/M/1 processor sharing queue in order to derive the asymptotic …
On the sojourn time of a batch in the Processor Sharing Queue
F Guillemin, A Simonian, R Nasri… - arXiv preprint arXiv …, 2020 - arxiv.org
In this paper, we analyze the sojourn of an entire batch in a processor sharing $
M^{[X]}/M/1$ processor queue, where geometrically distributed batches arrive according to a …
M^{[X]}/M/1$ processor queue, where geometrically distributed batches arrive according to a …