Performance/availability modeling with the TANGRAM-II modeling environment

doi:10.1016/S0166-5316(98)00011-X

Performance Evaluation

Volume 33, Issue 1, June 1998, Pages 45-65

https://doi.org/10.1016/S0166-5316(98)00011-X Get rights and content

Abstract

TANGRAM-II is a modeling environment developed for research and educational purposes that provides a flexible user interface to describe computer and communication system models. It is based on an object oriented description language and has a sophisticated graphic interface built from the public domain software package TGIF (TANGRAM Graphic Interface Facility). The current version is implemented in C++ and C and has several solvers for transient and steady state analysis of performance and availability metrics. Several examples that we present highlight the modeling capabilities of the environment.

References (31)

A.M. Johnson et al.
Survey of software tools for evaluating reliability, availability and serviceability
ACM Comput. Surveys
(1988)
C.D. Meyer
Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems
SIAM Rev.
(1989)
C.M. Sauer et al.
Queueing network simulations of computer communication
IEEE J. Select. Areas Commun.
(1984)
C. Béounes et al.
SURF-2: A program for dependability evaluation of complex hardware and software systems
S. Berson et al.
An object oriented methodology for the specification of Markov models
G.V. Bochmann et al.
Adding performance aspects to specification languages
J.A. Carrasco et al.
METFAC: Design and implementation of a software tool for modeling and evaluation of complex fault-tolerant computing systems
FTCS
(1986)
W. Chia-Whei Cheng, The TANGRAM graphical interface facility (TGIF)...
G. Chiola
A software package for analysis of generalized stochastic Petri net models
G. Ciardo et al.
SPNP: stochastic Petri net package

E. de Souza e Silva et al.

Calculating cumulative operational time distributions of repairable computer systems

IEEE Trans. Comput.

(1986)

E. de Souza e Silva et al.

The uniformization method in performability analysis

IBM Technical Report RC-20383

(1996)

E. de Souza e Silva, H.R. Gail, An algorithm to calculate transient distributions of cumulative rate and impulse based...

E. de Souza e Silva et al.

Efficient solutions for a class of non-Markovian models

E. de Souza e Silva et al.

Calculating transient distributions of cumulative reward

Cited by (12)

Bandwidth usage distribution of multimedia servers using Patching
2007, Computer Networks
Citation Excerpt :
In this section, we validate our analytical model using simulation and show for instance how we may practically use the bandwidth usage distribution we obtained (i) to allocate bandwidth to provide a given level of QoS, (ii) to estimate the impact on QoS when some system parameters dynamically change, and (iii) to configure the overall system. We mention that the simulation results are obtained using the modeling environment Tangram-II [39,40], and have 95% confidence intervals that are within 5% of the reported values. Client arrivals are generated according to a Poisson process and the media objects are 100 min long.
Several multicast bandwidth sharing techniques have been proposed in the literature to provide more scalability to multimedia servers. These techniques are often analyzed in terms of the average bandwidth requirements they demand to satisfy client requests. However, average values do not always provide an accurate estimate of the required bandwidth. Therefore, they cannot be the only parameter used to guarantee a certain level of quality to the clients. In this work we propose a simple analytical model to accurately calculate the distribution of the number of concurrent streams or, equivalently, the bandwidth usage distribution considering the popular Patching technique. We show that the distribution may be modeled as a binomial random variable in the single object case, and as a sum of independent binomial random variables in the multiple object case. Through simulation we validate our results. Moreover, we also illustrate how these results may be practically used for instance (i) to allocate bandwidth to provide a given level of QoS, (ii) to estimate the impact on QoS when some system parameters dynamically change, and (iii) to configure the overall system.
An evolutionary game-theoretic approach to congestion control
2005, Performance Evaluation
This paper investigates a system where a set of users sharing a bottleneck link must choose the transmission rate at which multimedia traffic is received. Users are assumed to be self-regarding and make their decisions with the sole goal of maximizing their perceived quality. We are interested in the dynamic process by which users adapt their data rates and the convergence of this process to equilibria. We propose a novel two-layer model to represent this system: the upper layer is an evolutionary game-theoretic model that captures how users adapt their rates; the lower layer model captures the network performance and the quality perceived by the users. Using the model proposed, we demonstrate analytically and numerically several interesting properties of the system equilibria. In particular, we establish the relationship between system states that have non-negligible steady state probabilities and Nash equilibria of the induced game.
Iterative analysis of Markov regenerative models
2001, Performance Evaluation
Conventional algorithms for the steady-state analysis of Markov regenerative models suffer from high computational costs which are caused by densely populated matrices. In this paper, a new algorithm is suggested which avoids computing these matrices explicitly. Instead, a two-stage iteration scheme is used. An extended version of uniformization is applied as a subalgorithm to compute the required transient quantities “on-the fly”. The algorithm is formulated in terms of stochastic Petri nets. A detailed example illustrates the proposed concepts.
Analytical models for mixed workload multimedia storage servers
1999, Performance Evaluation
Efficient resource management is essential in providing scalability in large multimedia information systems serving a variety of applications. In order to explore design tradeoffs in such systems, what is needed are accurate analytical models of mixed workload servers with tractable solutions. Motivated by the need for mixed workload storage servers as well as the need for performance studies of such systems, we first present a family of scheduling algorithm for mixed workload storage servers. We then develop a set of corresponding analytical non-Markovian models. We show how our analytical solution methodology applies to this entire family of models and how it can be used to obtain performance measures of interest for different classes of workloads. Lastly, we illustrate through numerical examples how such models can be used to study performance tradeoffs and facilitate the making of design choices in mixed workload storage servers.
A graphical tool for modeling correlated video traffic
2018, Computer Applications in Engineering Education
Performance evaluation with hidden Markov models
2011, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

View all citing articles on Scopus

View full text

Performance/availability modeling with the TANGRAM-II modeling environment

Abstract

ACM Comput. Surveys

SIAM Rev.

IEEE J. Select. Areas Commun.

SURF-2: A program for dependability evaluation of complex hardware and software systems

An object oriented methodology for the specification of Markov models

Adding performance aspects to specification languages

METFAC: Design and implementation of a software tool for modeling and evaluation of complex fault-tolerant computing systems

FTCS

A software package for analysis of generalized stochastic Petri net models

SPNP: stochastic Petri net package

Calculating cumulative operational time distributions of repairable computer systems

IEEE Trans. Comput.

The uniformization method in performability analysis

IBM Technical Report RC-20383

Efficient solutions for a class of non-Markovian models

Calculating transient distributions of cumulative reward