A universal building block for the approximate analysis of a shared buffer ATM switch architecture

@article{Kouvatsos1994AUB,
  title={A universal building block for the approximate analysis of a shared buffer ATM switch architecture},
  author={Demetres D. Kouvatsos and Spyros G. Denazis},
  journal={Annals of Operations Research},
  year={1994},
  volume={49},
  pages={241-278}
}
A universal analytic approximation is proposed for the performance analysis of a general queueing model of a shared buffer ATM switch architecture with bursty arrivals. The forms of the joint, aggregate and marginal state probabilities are characterised via entropy maximisation. As an application, a continuous-time maximum entropy (ME) solution is implemented at equilibrium by assuming that the arrival process to each port of the ATM switch is modelled by a Compound Poisson Process (CPP) with… 
A product form approximation for arbitrary discrete time networks of shared buffer queues
A product form approximation, based on the principle of maximum entropy (ME), is characterised for arbitrary open discrete time queueing network models (QNMs) of shared buffer ATM switches under the
An approximate analysis of a shared buffer ATM switch using input process aggregation technique
  • Jisoo Kim, C. Jun, K. Jun
  • Business
    1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)
  • 1999
TLDR
A discrete time queueing model of an N/spl times/d shared buffer ATM switch is considered, which is loaded with unbalanced and correlated bursty traffic and the maximum entropy method is applied to obtain the steady-state probability distribution of the queueing system.
An Information Theoretic Methodology for QNMs of ATM Switch Architectures
The performance modelling and quantitative analysis of Asynchronous Transfer Mode (ATM) switch architectures constitute a rapidly growing application area due to the their ever expanding usage and
Cost Effective Methodologies for Queueing Models of ATM Switched Networks
TLDR
Two cost-effective methodologies for the exact and approximate analysis of discrete-time queueing models of multi-buffered and shared buffer ATM switch architectures with bursty and/or correlated traffic are reviewed.
Maximum Entropy Analysis of Queueing Network Models
TLDR
Entropy maximisation is used to characterise product-form approximations and resolution algorithms for arbitrary continuous-time and discrete-time Queueing Network Models (QNMs) at equilibrium under Repetitive-Service (RS) blocking and Arrivals First (AF) or Departures First (DF) buffer management policies.
Performance analysis of buffered Banyan ATM switch architectures
The principle of Maximum Entropy (ME) and the notion of system decomposition are combined towards the creation of an iterative cost-effective approximation algorithm for the performance analysis of

References

SHOWING 1-10 OF 19 REFERENCES
A discrete-time queueing model of the shared buffer ATM switch with bursty arrivals
TLDR
A model of the shared buffer ATM switch as a discrete-time queueing system and the construction of the superposition of all the arrival processes to the switch showed that the approximate results have a good accuracy.
Blocking in asynchronous, buffered banyan networks
MEM for Arbitrary Queueing Networks with Multiple General Servers and Repetitive-Service Blocking
Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions
TLDR
This paper considers several schemes for sharing a pool of buffers among a set of communication channels emanating from a given node in a network environment so as to make effective use of storage in a variety of applications.
Effects of output buffer sharing on buffer requirements in an ATDM packet switching
  • A. E. Eckberg, T. Hou
  • Business
    IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?
  • 1988
TLDR
A general approach is developed for the analysis of set of queues to which the arrival streams are correlated, which could be used to assess the impacts on shared buffer requirements due to other types of stream correlation (e.g. positive correlations) that may result from other traffic assumptions.
A Maximum Entropy Analysis of the G/G/1 Queue at Equilibrium
The principle of maximum entropy is used to analyse a G/G/1 queue at equilibrium when the constraints involve only the first two moments of the interarrival-time and service-time distributions.
A shared buffer memory switch for an ATM exchange
TLDR
A shared buffer memory switch in which output buffer memories are shared by all the switch output ports and are alloted to one particular output port as the occasion demands can further improve the hardware-utilization efficiency of the memory switch by increasing the buffer memory usage rate.
ON THE SUPERPOSITION OF ARRIVAL PROCESSES FOR VOICE AND DATA
Entropy maximisation and queueing network models
TLDR
This paper traces the progress achieved so far towards the creation of ME and MRE product-form approximations and related algorithms for the performance analysis of general Queueing Network Models (QNMs) and indicates potential research extensions in the area.
...
...