• No results found

tandem queueing network

Analysis of an open tandem queueing network with population constraint and constant service times

Analysis of an open tandem queueing network with population constraint and constant service times

... open tandem queueing network with constant service time and without a population constraint have been reported in the ...open tandem conguration with blocking and constant service times, ...

32

An approximate analysis of open tandem queueing networks with blocking and general service times

An approximate analysis of open tandem queueing networks with blocking and general service times

... 'Supported in part by ~he Na~ional Science Foundation under (I'ant DCR·3S-02540.. An approximation algorithm is presented for open tandem queueing networks with finite buffers and with g[r] ...

38

Analysis of an open tandem queueing network with population constraint and constant service times

Analysis of an open tandem queueing network with population constraint and constant service times

... However, during the time that the external queue is idle, we approximate the mean waiting time in the queueing network by that of a GI/ D /1 queue with service time s", This is becau[r] ...

29

Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss

Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss

... a tandem configuration of finite capacity queues with customer loss using the fitting model.. described in section 4.[r] ...

15

Approximate analysis of discrete-time tandem queueing networks with customer loss

Approximate analysis of discrete-time tandem queueing networks with customer loss

... tion of finite capacity queues with cell loss using some of the approximation models obtained.. in section 4.[r] ...

32

A bibliography of papers on queueing networks with finite capacity queues

A bibliography of papers on queueing networks with finite capacity queues

... Perros, An approximate analysis of open tandem queueing networks with blocking and general service times, to appear in Euro.. Jun and H.G.[r] ...

15

Comparison of Different Confidence Intervals of Intensities for an Open Queueing Network with Feedback

Comparison of Different Confidence Intervals of Intensities for an Open Queueing Network with Feedback

... To evaluate performances of the different interval esti- mation approaches mentioned above for an open queue- ing network with feedback using short run data, a nu- merical simulation study was undertaken. Most of ...

21

Behaviour of passage time for a queueing network model with
feedback:  a simulation study

Behaviour of passage time for a queueing network model with feedback: a simulation study

... the queueing system presented in this note was motivated by its possible application to a multiprogramming computer ...closed network with two service centres with ...the network, is examined through ...

12

Multi-Objective Lead Time Control in Multistage Assembly Systems (TECHNICAL NOTE)

Multi-Objective Lead Time Control in Multistage Assembly Systems (TECHNICAL NOTE)

... open queueing network, whose service stations represent manufacturing or assembly ...in queueing networks, we obtain the distribution function of time spend by a product in the system or the ...

12

Modeling and analysis to improve the quality of healthcare services

Modeling and analysis to improve the quality of healthcare services

... author modeled the patient flow of health care systems using a closed queueing network. framework with the assumption that the system is always full[r] ...

129

Enhancing Integrated Communication Network Service Using a Queueing Model

Enhancing Integrated Communication Network Service Using a Queueing Model

... Corrective action involves routing changes and possibly network resizing. If routing changes are insufficient to solve all of the performance problems, then a new determination is made of the required number of ...

10

QUEUEING MODEL FOR SOFT HANDOFF ANALYSIS IN CDMA BASED WIRELESS CELLULAR NETWORK

QUEUEING MODEL FOR SOFT HANDOFF ANALYSIS IN CDMA BASED WIRELESS CELLULAR NETWORK

... probability that a handoff call is blocked is denoted p h The network response time is represented by t nrt and is exponentially distributed with mean  T . The balking behavior of calls is following exponential ...

5

A queueing network model of a circuit switching access scheme in an integrated services environment

A queueing network model of a circuit switching access scheme in an integrated services environment

... The queueing model can be used to study this system by assuming that the secondary node consists of one server whose mean service time is equal to the mean inter-arrival time of circuit [r] ...

37

Finite/Infinite Queueing Models Performance Analysis in Optical Switching Network Nodes

Finite/Infinite Queueing Models Performance Analysis in Optical Switching Network Nodes

... the network nodes are modeled in a variety of network techniques and principles [1, ...The Queueing model is a theoretical aspect of such the network node ...a queueing model represents ...

8

Semaphore queues: modelling multi-layered window flow control mechanisms

Semaphore queues: modelling multi-layered window flow control mechanisms

... Finally, we consider the model given in figure 4 with 3 levels, i.e. The semaphore controlled queueing network 51.2 is assumed to be the two-level network analysed above. Let C3, ~ 13, J[r] ...

25

Approximation algorithms for open queueing networks with blocking

Approximation algorithms for open queueing networks with blocking

... The algorithm is an extension of the Perros and Altiok algorithm described in section 3. It decomposes the queueing network into individual nodes, each with a revised arrival process, se[r] ...

49

Solving Queueing Network Models in Cloud Provisioning Contexts

Solving Queueing Network Models in Cloud Provisioning Contexts

... In recent years the research community and most of cloud users are trying to propose flexible and general mechanisms to determine how much virtual resources need to be allo- cated to each tier of the applications executed ...

8

Performance Analysis of Optical Burst Switched Networks with Dynamic Simultaneous Link Possession

Performance Analysis of Optical Burst Switched Networks with Dynamic Simultaneous Link Possession

... optical network, each OBS network has to assign wave- lengths at the different WDM fibers along the burst ...the network is equipped with wavelength converters, which are devices that optically ...

143

Gordon and Newell queueing networks and copulas

Gordon and Newell queueing networks and copulas

... have considered two cases: the first one is the case of the network with 2 nodes, and the second one is the case of the network with at least 3 nodes. The analytical formula for the second case has been ...

13

Approximate analysis of an open multi-class queueing network with class-dependent population constraints

Approximate analysis of an open multi-class queueing network with class-dependent population constraints

... Similar experiments were carried out for the queueing network shown in figure 11. The queueing network consists of six stations and four classes of jobs. As before, each station is repre[r] ...

33

Show all 10000 documents...

Related subjects