Abstract:Large distributed client-server systems often contain subsystems which are either identical to each other, or very nearly so, and this simplifies the system description for planning purposes. These replicated components and subsystems all have the same workload and performance parameters. It is known how to exploit this symmetry to simplify the solution of some kinds of performance models, using state aggregation in Markov Chains. This work considers the same problem for layered queueing models, using mean val… Show more
“…An idea of iterative solution from layered queueing network [8] is proposed to solve the PEPA model of Kerberos protocol with heterogeneous environment; this remains a issue for further investigation.…”
In this paper an authentication protocol, Kerberos, is investigated. To consider the scenario where there are multiple realms, a simplification is applied. The simplified model is equivalent to original model in terms of the steady state distribution. It is analysed numerically using a fluid flow approximation and is verified by stochastic simulation.
“…An idea of iterative solution from layered queueing network [8] is proposed to solve the PEPA model of Kerberos protocol with heterogeneous environment; this remains a issue for further investigation.…”
In this paper an authentication protocol, Kerberos, is investigated. To consider the scenario where there are multiple realms, a simplification is applied. The simplified model is equivalent to original model in terms of the steady state distribution. It is analysed numerically using a fluid flow approximation and is verified by stochastic simulation.
“…Rolia and Sevcik (1995) have used LQN and have developed the method of layers (MOL) to estimate the performance of distributed applications. Omari, Franks, Woodside, and Pan (2005) have developed a solution procedure for LQN with replicated subsystems to model large client-server systems with several identical subsystems. Omari, Franks, Woodside, and Pan (2006) extended this methodology to consider parallel subsystems in the network.…”
Motivated by the technology division of a financial services firm, we study the problem of capacity planning and allocation for Web-based applications. The steady growth in Web traffic has affected the quality of service (QoS) as measured by response time (RT), for numerous e-businesses. In addition, the lack of understanding of system interactions and availability of proper planning tools has impeded effective capacity management. Managers typically make decisions to add server capacity on an ad hoc basis when systems reach critical response levels. Very often this turns out to be too late and results in extremely long response times and the system crashes. We present an analytical model to understand system interactions with the goal of making better server capacity decisions based on the results. The model studies the relationships and important interactions between the various components of a Web-based application using a continuous time Markov chain embedded in a queuing network as the basic framework. We use several structured aggregation schemes to appropriately represent a complex system, and demonstrate how the model can be used to quickly predict system performance, which facilitates effective capacity allocation decision making. Using simulation as a benchmark, we show that our model produces results within 5% accuracy at a fraction of the time of simulation, even at high traffic intensities. This knowledge helps managers quickly analyze the performance of the system and better plan server capacity to maintain desirable levels of QoS. We also demonstrate how to utilize a combination of dedicated and shared resources to achieve QoS using fewer servers.
“…LQNs are one of the most adopted technique and have been efficiently applied also in other related contexts, like ERP applications [10] heavily adopting multithreading and multi-core architectures, in the early phases of Software Product Lines [12], in the optimization of the deployment of multiple Web applications on a cloud [8], with replicated components [9], where LQN based approaches scale very well.…”
Abstract. This position paper describes an approach to predict the performances of a Web application already in the early stages of application development. It leverages the wealth of information of MDWE solutions to automatically obtain accurate representations of the running application in terms of layered queue networks (LQNs), i.e., analytical models simulating the behavior of the system and computing the performances mathematically. In particular, the paper discusses how a MDWE methodology can be exploited to generate such performance models and presents a proof of concept example.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.