No label defined (Q4039758)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 192867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 192867 |
Statements
5 June 1993
0 references
Computer performance
0 references
Modelling
0 references
IFIP
0 references
Performance-12
0 references
Proceedings
0 references
Symposium
0 references
Brussels (Belgium)
0 references
random access protocols
0 references
Markov chains
0 references
performance measurement
0 references
performance evaluation. queueing network
0 references
switching systems
0 references
locking
0 references
data bases
0 references
distributed systems
0 references
analysis of algorithms
0 references
simulation techniques
0 references
computer communication network
0 references
flow control
0 references
locking protocols
0 references
average complexity of digital trees
0 references
computer performance modelling
0 references
The emphasis of the symposium was on interdisciplinary aspects. This volume contains the 3 invited contributions as well as 30 papers selected from over 120 submissions. It is divided into six parts. The first part deals with queueing network models; the applications in mind here are local networks, digital networks with integrated services, telecommunications and computer integrated manufacturing systems. The second part is more concerned with random access communications, communication and switching systems. In the third part the studies of the locking, sequencing and ordering mechanisms used to preserve the coherency of information in data bases and distributed systems are considered. The analysis of algorithms is a subject of the fourth part. The last two parts are the results of measurement and simulation techniques and also load characterization and balancing techniques. Below we feature a brief description of all sessions presented at the symposium. Part one, dedicated to queueing network models, has one invited lecture. In this lecture entitled ``Routing and capacity allocation in queueing and loss networks'', \textit{F. P. Kelly} discusses how product-form solutions and related approximation procedures can be used to provide important structural insights into optimization issues. In ``A new proof and a tree algorithm for RECAL'', \textit{J. McKenna} shows that the RECAL recurrence relation also holds unchanged for networks with load dependent service centers. New results on a single server model with two Poissonian arrival streams are presented by \textit{J. W. Cohen} in ``A two-queue model with semi-exhaustive alternating service''. An evaluation method of the stochastic fluid model in which fluid is produced by multiple machines, transferred to a buffer and consumed by another set of machines is presented by \textit{D. Mitra}. A computer communication network in which multiple controllers execute decentralized flow control is analyzed by \textit{M.-T. T. Hsiao} and \textit{A. A. Lazar} in ``A game theoretic approach to decentralized flow control of Markovian queueing networks''. In ``Load balancing in a system of two queues with resequencing'', \textit{A. Jean- Marie} gives the routing probabilities that optimize the mean sojourn time in a system with two independent servers in parallel. The problem of evaluating the disturbance caused by an asynchronous traffic on a periodic flow, when both are offered to a common synchronous transmission server, is described by \textit{P. Brown} and \textit{A. Simonian}. A class of quasi-birth-and-death processes with finite state space for which the invariant probability vector is found to admit a matrix-geometric representation is presented by \textit{L. Gün} and \textit{A. M. Makowski}. In ``General closed queueing networks with blocking'', \textit{I. F. Akyildiz} gives new approximate solution techniques to analyze these networks. An M/G/1 multiqueue system consisting of M finite capacity queues with vacations and priorities is analyzed by \textit{C. Blondia}. Part two is devoted to random access communications, communication and switching systems. One of the invited authors, \textit{J. L. Massey} in ``Some new approaches to random-access communications'' examines among other things the role of channel feedback information. The performance of a multi-station packet-radio network in which the nodes of the network employ some collision resolution algorithm for accessing a shared radio channel is presented by \textit{A. Bar-David} and \textit{M. Sidi}. In ``Delay analysis of multihop packet radio networks'' new packet delay analysis is described by \textit{P. J. B. King} and \textit{N. Shacham}. \textit{P. Robert} et al. present an ``Analysis of a meteor scatter communication protocol''. \textit{A. Ganz} and \textit{I. Chlamtac} give new results in ``Finite buffer queueing model for p-persistent CSMA/CD protocol''. \textit{P. Harrison} and \textit{N. Patel} present the representation of switching networks in queueing models of parallel systems. Part three, dedicated to ordering and resequencing in distributed systems, contains some lectures. ``A queueing model of time-stamp ordering in a distributed systems'' is the title of the first lecture presented by \textit{F. Baccelli}. The delay analysis of the resequencing problem with partial ordering is studied by \textit{A. Stafylopatis} and \textit{E. Gelenbe}. Performance evaluation of three locking protocols is presented by \textit{Y. F. Huang} and \textit{Y. H. Chin}. The fourth part, dedicated to analysis and evaluation algorithms, has one invited lecture. ``Random tree models in the analysis of algorithms'' is the title of this lecture presented by \textit{P. Flajolet}. In ``Two problems on the average complexity of digital trees'', \textit{W. Szpankowski} studies the average complexity of digital trees from the successful and unsuccessful point of view. Normal limiting distribution of the size of random tries is briefly described by \textit{P. Jacquet} and \textit{M. Regnier}. The last two parts are dedicated to measurement and simulation techniques and also to load characterization and balancing techniques. ``Application of frequency domain experiments to simulations of computer systems'' is the title of the first lecture presented by \textit{T. Som} and \textit{R. Sargent}. In ``The empirical evaluation of a security-oriented datagram protocol'', \textit{D. Anderson} et al. determine the actual effects of each of those features on the protocol's performance. The implementation and use of a hardware-assisted trace measurement system (TRAMS) is described by \textit{A. Mink} et al. \textit{D. Ferrari} and \textit{S. Zhou} present ``An empirical investigation of load indices for load balancing applications''. The lecture discusses implementation of a load balancer for some loosely-coupled distributed systems. New results in workstation load balancing are reported by \textit{M. Mutka} and \textit{M. Livny} in ``Profiling workstations' available capacity for remote execution''. Some lectures belong to special topics of this symposium. In the first one, ``Definiton and measurement of the orderliness of a service mechanism'', \textit{G. Hébuterne} et al. propose a device measuring the disorder incurred by a flow of customers crossing a service mechanism. A probabilistic model of snooping cache schemes and corresponding approximate performance analysis is presented by \textit{A. G. Greenberg} et al. A lecture by \textit{P. Semal} and \textit{P.-J. Courtois} is concerned with the stability of large Markovian chains. ``Two queues with alternating service periods'', prepared by \textit{E. G. Coffman} jun. et al., considers a mathematical model of multiplexed voice/data packet communication. A cyclic service queueing system in which the server serves at most a prespecified number of jobs when it visits a queue is analyzed by \textit{S. W. Fuhrman} and \textit{Y. T. Wang}. These symposium materials are extraordinary valuable and useful for future studies in computer performance modelling, measurement, and evaluation.
0 references