Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Alain Simonian"'
Publikováno v:
Stochastic Models. 37:448-479
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 individual job...
Publikováno v:
Integral Transforms and Special Functions. 32:677-694
Given complex parameters $x$, $\nu$, $\alpha$, $\beta$ and $\gamma \notin -\mathbb{N}$, consider the infinite lower triangular matrix $\mathbf{A}(x,\nu;\alpha, \beta,\gamma)$ with elements $$ A_{n,k}(x,\nu;\alpha,\beta,\gamma) = \displaystyle (-1)^k\
Publikováno v:
2020 32nd International Teletraffic Congress (ITC 32)
2020 32nd International Teletraffic Congress (ITC 32), Sep 2020, Osaka, France. pp.55-63, ⟨10.1109/ITC3249928.2020.00015⟩
2020 32nd International Teletraffic Congress (ITC 32), Sep 2020, Osaka, France. pp.55-63, ⟨10.1109/ITC3249928.2020.00015⟩
In this paper, we study the performance of packet scheduling schemes for Ultra-Reliable Low-Latency Communications (URLLC) services. In order to ensure a low queuing time, we exploit the redundant coverage in many 5G Radio Access Networks (RAN) scena
Publikováno v:
Stochastic Models. 34:322-361
For the Processor Sharing queue with batch job arrivals, the sojourn time W of a single job is investigated. This queuing model is motivated by the evaluation of Cloud Computing or Virtualized Network systems where the treatment of micro-services wit
The parallel execution of requests in a Cloud Computing platform, as for Virtualized Network Functions, is modeled by an $M^{[X]}/M/1$ Processor-Sharing (PS) system, where each request is seen as a batch of unit jobs. The performance of such parallel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e658b77f847941995454c633aa89bad5
http://arxiv.org/abs/1904.05615
http://arxiv.org/abs/1904.05615
Publikováno v:
IFIP Networking
IFIP Networking, May 2018, Zurich, Switzerland. ⟨10.23919/ifipnetworking.2018.8696771⟩
Networking
IFIP Networking, May 2018, Zurich, Switzerland. ⟨10.23919/ifipnetworking.2018.8696771⟩
Networking
We consider a mobile market driven by two Mobile Network Operators (MNOs) and a new competitor Mobile Virtual Network Operator (MVNO). The MNOs can partner with the entrant MVNO by leasing network resources; however, the MVNO can also rely on other t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dffb50de6990ca3717a128e177474563
http://arxiv.org/abs/1812.05413
http://arxiv.org/abs/1812.05413
Publikováno v:
Systems Modeling: Methodologies and Tools ISBN: 9783319923772
Systems Modeling: Methodologies and Tools
Systems Modeling: Methodologies and Tools
We analyze the impact of inter-cell mobility on data traffic performance in dense networks with small cells. To this end, a multi-class queuing system with impatience is proposed as a generic model that captures mobility through the sojourn time of u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3c51a4ce24ee0880a88a7cc6a3d57f6
https://doi.org/10.1007/978-3-319-92378-9_12
https://doi.org/10.1007/978-3-319-92378-9_12
Publikováno v:
2018 30th International Teletraffic Congress (ITC 30).
We address the performance of a system where D2D communications add up to standard cellular traffic in future 5G networks. D2D resources are taken from the Uplink spectrum and, in this framework, two scheduling schemes are envisaged: the first one co
Publikováno v:
Stochastic Models. 31:636-672
We study the stationary distribution of a system of two parallel M/M/∞ queues managed by the Join the Shortest Queue load balancing policy; one motivation for characterizing the efficiency of that policy is its potential application to resource all
Autor:
Philippe Olivier, Alain Simonian
Publikováno v:
VALUETOOLS
We analyze the impact of inter-cell mobility on data traffic performance in dense networks with small cells. To this end, a Markovian queuing model with impatience is proposed as a generic tool that captures mobility through the sojourn time of users