Browsing by Subject "Effective bandwidth"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    On the effective bandwidth for resource management in ATM networks
    (1997) Chahed, Tijani
    The aim of this work is to present a synthesis view of the concept and theory of the effective bandwidth, a measure that captures the statistical characteristics of time-varying ATM sources, to cover some of its applications, to investigate its limitations and to determine the extent of its effectiveness. For the effective bandwidth to be a viable tool, its on-line, real-time application to network management tasks is a major concern. In this line of thought, on-line traffic characterization and resource management in ATM networks are the main topics of our work. Since optimal resource management in ATM networks relies essentially on the ability of the network design to perform statistical multiplexing and account for the gains, this case is investigated and a novel, optimal connection admission control (CAC) algorithm is suggested.
  • Thumbnail Image
    ItemOpen Access
    Performance analysis of an asynchronous transfer mode multiplexer with Markov modulated inputs
    (1993) Akar, Nail
    Asynchronous Transfer Mode (ATM) networks have inputs which consist of superpositions of correlated cell streams. Markov modulated processes are commonly used to characterize this correlation. The first step through gaining an analytical insight in the performance issues of an ATM network is the analysis of a single channel. One objective of this study is the performance analysis of an ATM multiplexer whose input is a Markov modulated periodic arrival process. Based on the transient behavior of the nD/D/1 queue, we present an approximate method to compute the queue length distribution accurately. The method reduces to the solution of a linear differential equation with variable coefficients. Another general traffic model is the Markov Modulated Poisson Process (MMPP). We employ Pade approximations in transform domain for the deterministic service time distribution in an M MPP/D/1 queue so as to compute the distribution of the buffer occupancy. For both models, we also provide algorithms for analysis in the case of finite queue capacities and for computation of effective bandwidth.