A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A Fixed-Point Algorithm for Closed Queueing Networks
[chapter]
Lecture Notes in Computer Science
Preserved Fulltext
In this paper we propose a new efficient iterative scheme for solving closed queueing networks with phase-type service time distributions. ...
We present the method, put it in perspective, and validate it through a large number of test scenarios. ...
Our approach consists of elevating the fixed-point algorithms that have been developed and successfully applied for open queueing networks to closed queueing networks. ...
doi:10.1007/978-3-540-75211-0_12
fatcat:s5bmyrbcy5gz7pkk4jdiw3nvr4
ANALYSIS AND CONTROL OF BIFURCATION AND CHAOS IN AVERAGE QUEUE LENGTH IN TCP/RED MODEL
2008
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our modification is for the simple scenario of a single RED router carrying only TCP traffic. The algorithm neither compromises the throughput nor the average queuing delay of the system. ...
Bifurcation and chaos phenomena are nonlinear behaviour in network systems that lead to degradation of the network performance. The TCP/RED model used is a model validated previously. ...
Modified RED algorithm As RED parameters vary, the average queue size drifts from the fixed point, bifurcation and subsequently chaos occur. ...
doi:10.1142/s0218127408021816
fatcat:jzocu6mfkvcfzlkj5quh5v4mpa
A class of tractable models for run-time performance evaluation
2012
Proceedings of the third joint WOSP/SIPEW international conference on Performance Engineering - ICPE '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We here propose a new methodology for run-time performance evaluation based on a class of closed queueing networks. ...
Motivated by the lack of an exact solution for these networks, we propose a fixedpoint algorithm that approximates performance indexes in linear time and linear space with respect to the number of requests ...
A fixed-point algorithm for solving the closed PH queueing networks is introduced in Section 5 and validated in Section 6. Section 7 applies our method to a connection pooling problem. ...
doi:10.1145/2188286.2188299
dblp:conf/wosp/CasaleH12
fatcat:2ohuw6hwyvf2rjn3ck3es4cm2y
PDAC: A data parallel algorithm for the performance analysis of closed queueing networks
1993
Parallel Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A parallel distribution analysis by chain algorithm (PDAC) is presented for the performance analysis of closed, multiple class queueing networks. ...
The computational cost of the PDAC algorithm is shown to be of polynomial order with a lower degree than the cost of the serial implementation of the DAC algorithm. ...
Distribution Analysis by Chain (DAC) We consider a closed product-form queueing network with multiple chains. ...
doi:10.1016/0167-8191(93)90080-5
fatcat:6k7ixovyoffa3d4zfloexyasha
Queueing analysis for operations modeling in port logistics
2019
Maritime Business Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Purpose The use of queueing network models was stimulated by the appearance (1975) of the exact product form solution of a class of open, closed and mixed queueing networks obeying the local balance principle ...
Findings Numerical experiments show the extent to which a decomposition-based approximation, under fixed or state-dependent arrival rates, may be suitable for the approximate analysis of the queueing network ...
It is then replaced by a flowequivalent exponential station (c in Figure 3 ), so the closed queueing network at hand can be solved by the MVA algorithm for BCMP networks. ...
doi:10.1108/mabr-09-2019-0035
fatcat:nzgm7mvhtjebhl3m43ny7fwdva
Maximum Likelihood Estimation of Closed Queueing Network Demands from Queue Length Data
2015
Performance Evaluation Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We propose maximum likelihood (ML) estimators for service demands in closed queueing networks with load-independent and load-dependent stations. ...
Our ML estimators are expressed in implicit form and require only to compute mean queue lengths and marginal queue length probabilities from an empirical dataset. ...
The evaluation of the proposed algorithms are based on simulated queue length data. The data is generated from the underlying Markov Chain of a closed network. ...
doi:10.1145/2825236.2825255
fatcat:izlatsbdovdwhii5dnnrawtgmi
A Unified Approach to Optimizing Performance in Networks Serving Heterogeneous Flows
2009
IEEE INFOCOM 2009 - The 28th Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Next, we extend our joint algorithm in two ways to further improve its performance: in delay through a virtual queue implementation with minimal throughput degradation and in utilization by allowing for ...
We, then develop a distributed joint load-balancing and congestion control algorithm that achieves the dual goal of maximizing the aggregate utility gained by the elastic flows while satisfying the fixed ...
Fig. 11 . 11 Network topology for simulating the virtual queue algorithm. ...
doi:10.1109/infcom.2009.5061928
dblp:conf/infocom/LiYES09
fatcat:qpfkbziihbdf3froolamk6zie4
Blending randomness in closed queueing network models
2014
Performance evaluation (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
To cope with this problem, we introduce the blending algorithm, a novel approximation for closed queueing network models in random environments. ...
Despite having been studied for decades, models that include both random environments and queueing networks remain difficult to analyse. ...
The authors thank Juan Fernando Peréz for helpful comments during the revision of this work. ...
doi:10.1016/j.peva.2014.09.001
fatcat:egnpnsx2a5bavnfapntzpu22hy
A Unified Approach to Optimizing Performance in Networks Serving Heterogeneous Flows
2011
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Next, we extend our joint algorithm in two ways to further improve its performance: in delay through a virtual queue implementation with minimal throughput degradation and in utilization by allowing for ...
We, then develop a distributed joint load-balancing and congestion control algorithm that achieves the dual goal of maximizing the aggregate utility gained by the elastic flows while satisfying the fixed ...
Fig. 11 . 11 Network topology for simulating the virtual queue algorithm. ...
doi:10.1109/tnet.2010.2059038
fatcat:tzwt5yysebaprfrijmw2zqmyiq
Utility-based rate control in the Internet for elastic traffic
2002
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
In a communication network, a good rate allocation algorithm should reflect the utilities of the users while being fair. ...
This is done by decomposing the overall system problem into subproblems for the network and for the individual users by introducing a pricing scheme. ...
Walrand for their helpful comments and discussions. ...
doi:10.1109/90.993307
fatcat:xgbn5vtwwnbdnn7n7xzxf2w3fa
Mean Value Analysis in Multichain Queueing Networks: An Iterative Approximation
[chapter]
1984
Operations Research Proceedings
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Recently, mean value algorithms have been developed to evaluate mean response times, throughputs, mean queue lengths, etcetera in such networks. ...
We will describe a method based on a decomposition of the network and mean value arguments. Zusammenfassung. ...
For lucidity of presentation we will give a short outline of the mean value algorithm for mixed multichain queueing networks with FIFO single server queues. ...
doi:10.1007/978-3-642-69546-9_95
fatcat:dponokepmvft5ftnzmvozg4vpy
Page 7438 of Mathematical Reviews Vol. , Issue 90M
[page]
1990
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The Erlang fixed point implied costs are also shown to be asymptotically correct for the star network limit and a criterion for asymptotic correctness (which the author states can be hard to use in practice ...
We discuss here the role of these analogies for constructing a qualitative mathematical background for studying complex queueing networks.” ...
Modeling TCP in Small-Buffer Networks
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Then, we combine all these models in a single fixed-point algorithm that forms the key to the global statistical small-buffer network model. ...
In this paper, we introduce a new model that provides a complete statistical description of small-buffer Internet networks. ...
We then connect all these models together in a closed loop, and derive the final network model as a result of a fixed-point equation. ...
doi:10.1007/978-3-540-79549-0_58
fatcat:4laoulyldbby7esmxjgt5thv44
Kronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizes
2008
Annals of Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Being fixed point iterations, Marie's method and Yao and Buzacott's method are analyzed for the existence of a fixed-point and it is proved that a fixed-point exists for each method. ...
After this transformation, Yao and Buzacott's method uses a fixed-point iteration scheme on the decomposed network to compute throughput rates of queues. ...
n/a 0 0 0.0 9e−2 1e−1 n/a MVABLO n/a n/a 0 0 0.0 4e−2 4e−2 n/a M(V,FIXED) 4 Table 6 .61: K = 7, b = (5, 9, 9, 5, 5, 9, 9, 5) Table 6 .62: K = 8, b = (5, 9, 9, 5, 5, 9, 9, 5) , Hyper (4) (0.9, ...
doi:10.1007/s10479-008-0429-8
fatcat:nyxsjg3hyvfhln6vpiexah3zha
Page 1189 of Mathematical Reviews Vol. , Issue 91B
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
“We first show that for a two-station closed queueing network with blocking and server breakdown (at one of the stations), there ...
Summary: “An exact analysis is presented to compute the through- put of a two-station closed queueing network with multiple servers subject to blocking and breakdown of servers. ...
« Previous
Showing results 1 — 15 out of 47,354 results