The importance of IP network will further increase and it will serve as a platform for more and more services, requiring different types and degrees of service quality. In this paper, we investigate the queueing behaviour found in input buffers in IP switch or router. To analyze these types of behaviour, we study the discrete-time version of the “classical” queue model M/M/1/k called Geo/MM/1/k...

| In this paper we provide the analysis of a rate-based access control scheme in high speed environments based on a buuered leaky bucket algorithm. The analysis is carried out in discrete time which is representative of an ATM environment. For the cell arrivals to the leaky bucket we consider a general discrete Markovian arrival process which models bursty and modulated sources. The key of our ...

Future high speed, broadband networks such as BISDN (Broadband Integrated Services Digital Network) support diverse applications like voice, video and data transfer. ATM (Asynchronous Transfer Mode) is considered to be the most promising transfer technology for implementing these networks. This paper presents a scheme, which may be used for the performance evaluation of ATM switching networks w...

there are some problems with estimating the time required for the manufacturing process of products, especially when there is a variable serving time, like control stage. these problems will cause overestimation of process time. layout constraints, reworking constraints and inflexible product schedule in multi product lines need a precise planning to reduce volume in particular situation of lin...

The purpose of this paper is to study the classification problem of discrete time and continuous time Markov processes of matrix M/G/1 type with a tree structure. We begin this paper by developing a computational method to find whether a Markov process of matrix M/G/1 type with a tree structure is positive recurrent, null recurrent, or transient. The method is then used to study the impact of t...

We consider a single server queue in discrete time, in which customers must be served before some limit sojourn time of geometrical distribution. A customer who is not served before this limit leaves the system. The fact of serving customers, holding them in queue or losing them induce costs. The purpose is to decide when to serve the customers so as to minimize these costs. We use a Markov Dec...

This paper investigates a discrete-time system with Markov modulated batch Bernoulli process (MMBP) inputs, general service times, and a finite capacity waiting room (queue). The FIFa and space priority service rules are considered. The main motivation for studying this type of queue is its potential applicability to time-slotted communication systems in broadband ISDN (B-ISDN). Applying the su...