39 Hits in 7.3 sec

Analytical and Scalable Analysis of Transient Tandem Markovian Finite Capacity Queueing Networks

Carolina Osorio, Jana Yamani
2017 Transportation Science  
This paper proposes an analytical model to approximate the transient aggregate joint queue-length distribution of tandem finite (space) capacity Markovian networks.  ...  The complexity of the proposed method is linear in the number of queues and is independent of the space capacities of the individual queues.  ...  Conclusions This paper proposes an analytical, tractable, and scalable technique that approximates the transient aggregate joint queue-length distribution of a finite (space) capacity tandem Markovian  ... 
doi:10.1287/trsc.2015.0629 fatcat:jlcg4jhhlfd57nwmix3ybsck3e

Stochastic network link transmission model

G. Flötteröd, C. Osorio
2017 Transportation Research Part B: Methodological  
First, it proposes a tractable network model for finite space capacity Markovian queueing networks.  ...  This methodology decomposes a general topology queueing network into a set of overlapping subnetworks and approximates the transient joint queue-length distribution of each subnetwork.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.  ... 
doi:10.1016/j.trb.2017.04.009 fatcat:xdvnxpu6p5fgvdvqfxdjp2cosq

Decomposition-Based Queueing Network Analysis with FiFiQueues [chapter]

Ramin Sadre, Boudewijn R. Haverkort
2010 International Series in Operations Research and Management Science  
FiFiQueues allows for the efficient analysis of large open queueing networks of which the interarrival and service time distributions are of phase-type; individual queues, all with single servers, can  ...  In this chapter we present an overview of decomposition-based analysis techniques for large open queueing networks.  ...  This allows for the inclusion of finite-buffer queueing stations as well as for the analysis of the queueing stations by matrix-geometric and general Markovian techniques, instead of the approximations  ... 
doi:10.1007/978-1-4419-6472-4_15 fatcat:naa6mbmeofgk7h7ylxb354c3bi

Analysis of Multiple Flows using Different High Speed TCP protocols on a General Network [article]

Sudheer Poojary, Vinod Sharma
2016 arXiv   pre-print
We develop analytical tools for performance analysis of multiple TCP flows (which could be using TCP CUBIC, TCP Compound, TCP New Reno) passing through a multi-hop network.  ...  We then consider two techniques to compute steady state throughput for different TCP flows in a multi-hop network. In the first technique, we approximate the queues as M/G/1 queues.  ...  There are a number of simulation and experimental evaluations for performance analysis of these TCP variants over different network topologies.  ... 
arXiv:1602.06653v1 fatcat:bh5kmdabcrbrhbbvttcuiukw5u

Blending randomness in closed queueing network models

Giuliano Casale, Mirco Tribastone, Peter G. Harrison
2014 Performance evaluation (Print)  
To make the approach scalable, the computation relies on a fluid approximation of the queueing network model.  ...  Despite having been studied for decades, models that include both random environments and queueing networks remain difficult to analyse.  ...  Acknowledgement The work of Giuliano Casale and Peter Harrison is supported by the European project MODAClouds (FP7-318484). Mirco Tribastone is supported by the European project ASCENS.  ... 
doi:10.1016/j.peva.2014.09.001 fatcat:egnpnsx2a5bavnfapntzpu22hy

Provisioning of Computing Resources for Web Applications under Time-Varying Traffic

Ali Rajabi, Johnny W. Wong
2014 2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems  
Two models are of interest to our investigation: a single-server model and a two-stage tandem queue.  ...  Results on the impact of MMPP parameters on the required capacity are also presented. The second model is a two-stage tandem queue.  ...  The transient behaviour of a finite buffer queue with MMPP arrivals and general service time distribution has been presented in [31] .  ... 
doi:10.1109/mascots.2014.27 dblp:conf/mascots/RajabiW14 fatcat:b3u277t4cvampddjf5ipmwefxu

Periodic dynamics in queuing networks

Tommaso Addabbo, Ljupco Kocarev
2009 Chaos, Solitons & Fractals  
This paper deals with state-dependent open Markovian (or exponential) queuing networks, for which arrival and service rates, as well as routing probabilities, may depend on the queue lengths.  ...  For a network of this kind, following Mandelbaum and Pats, we provide a formal definition of its associated fluid model, and we focus on the relationships which may occur between the network stochastic  ...  Williams for her help and assistance, as well as for her valuable insights and comments.  ... 
doi:10.1016/j.chaos.2008.08.031 fatcat:mztvfodirfbybk3km34loxbek4

Bandwidth allocation under end-to-end percentile delay bounds

Bushra Anjum, Harry Perros, Xenia Mountrouidou, Kimon Kontovasilis
2011 International Journal of Network Management  
The path through an IP network is depicted by a tandem queueing network of infinite capacity queues, where each queue represents the output port of a router.  ...  The first algorithm is based on probabilistic assumptions regarding the arrival process of the packet flow and service times at each node in the tandem queueing network.  ...  The MPLS connection is modeled by a tandem queueing network of infinite capacity queues.  ... 
doi:10.1002/nem.783 fatcat:z3s5maemznfqfnlklu5rv7rssq

Variational inequalities and mean-field approximations for partially observed systems of queueing networks [article]

Iker Perez, Giuliano Casale
2019 arXiv   pre-print
Queueing networks are systems of theoretical interest that find widespread use in the performance evaluation of interconnected resources.  ...  In comparison to counterpart models in genetics or mathematical biology, the stochastic (jump) processes induced by queueing networks have distinctive coupling and synchronization properties.  ...  We offer evidence of the procedure providing a flexible and scalable transient approach for the estimation of resource demands.  ... 
arXiv:1807.08673v2 fatcat:kvukigg4grcvvezw6xizqmylea

A unified analysis of routing protocols in MANETs

Hui Xu, Xianren Wu, Hamid Sadjadpour, J.J. Garcia-Luna-Aceves
2010 IEEE Transactions on Communications  
The model captures the essential behavior and scalability limits in network size of both classes of routing protocols, and provides valuable guidance on the performance of reactive or proactive routing  ...  logic and network parameters.  ...  From a queuing perspective, nodes along the active path form a tandem network of queues.  ... 
doi:10.1109/tcomm.2010.03.080554 fatcat:7io67t73cvfudbumqghlazd4wa

Asymptotic approximations of transient behaviour for day-to-day traffic models

David P. Watling, Martin L. Hazelton
2018 Transportation Research Part B: Methodological  
Formally, the analytic results hold asymptotically as approximations, as we imagine demand increasing in tandem with capacities; however, our interest is in general cases where such tandem increases do  ...  They are therefore highly suited to modelling both the disturbance and subsequent 'drift' of networks that are subject to some systematic change, be that a road closure or capacity reduction, new policy  ...  Osorio, and J. Yamani, 2017. Analytical and scalable analysis of transient tandem Markovian 546 finite capacity queueing networks. Transportation Science 51(3), 823-840.547 K. Parry, D.P. Watling, M.  ... 
doi:10.1016/j.trb.2018.10.010 fatcat:af6r3pdlkvh33lwcon724eszyu

Queueing systems with leadtime constraints: A fluid-model approach for admission and sequencing control

2004 Journal of Volcanology and Geothermal Research  
The network dynamically decides when to admit new arrivals and how to sequence the jobs in the system.  ...  The main benefit of this approach is that it is possible (and relatively easy) to construct scheduling and multi-product admission policies for leadtime control.  ...  One should proceed with a large deviations analysis for a tandem line of G=G=1 queues, as in Bertsimas et al. [4] .  ... 
doi:10.1016/s0377-2217(04)00230-9 fatcat:umucpkyxqrg3xnszrlyzmbtove

Queueing systems with leadtime constraints: A fluid-model approach for admission and sequencing control

Constantinos Maglaras, Jan A. Van Mieghem
2005 European Journal of Operational Research  
The network dynamically decides when to admit new arrivals and how to sequence the jobs in the system.  ...  The main benefit of this approach is that it is possible (and relatively easy) to construct scheduling and multi-product admission policies for leadtime control.  ...  One should proceed with a large deviations analysis for a tandem line of G=G=1 queues, as in Bertsimas et al. [4] .  ... 
doi:10.1016/j.ejor.2002.11.005 fatcat:vonfj5thcfdstpa4bfgze36vqa

Capacity Analysis of Sequential Zone Picking Systems

Jelmer P. van der Gaast, René B. M. de Koster, Ivo J. B. F. Adan, Jacques A. C. Resing
2019 Operations Research  
Multiclass jump-over queueing networks admit a product-form stationary distribution and can be efficiently evaluated by mean value analysis and Norton's theorem.  ...  In this paper, the various elements of the system, such as conveyor lanes and pick zones, are modeled as a multiclass block-and-recirculate queueing network with capacity constraints on subnetworks.  ...  We propose a queueing network to estimate the throughput capacity. Because an exact analysis of this queueing network is not feasible, we approximate its blocking protocol with the jumpover protocol.  ... 
doi:10.1287/opre.2019.1885 fatcat:3ljfubb7kfavvexp3jlpdqomca

Modeling and performance analysis of large scale IaaS Clouds

Rahul Ghosh, Francesco Longo, Vijay K. Naik, Kishor S. Trivedi
2013 Future generations computer systems  
Results from our analysis show the impact of workload and system characteristics on two performance measures: mean response delay and job rejection probability.  ...  As a first step towards designing Cloud based systems that achieve such performance and realize the service level objectives, we develop a scalable stochastic analytic model for performance quantification  ...  Fig. 5 . 5 Hot PM modeled as a two-stage tandem network of queues.  ... 
doi:10.1016/j.future.2012.06.005 fatcat:ulfgc5depncs5lilengnsxm52q
« Previous Showing results 1 — 15 out of 39 results