Ask
Search
My library
ORKG

ORKG Ask

Our mission is to organize scholarly knowledge and make it accessible to humans and machines.

About

About ORKG Ask
Report issue
Statistics
Contact

Legal

Terms of use
Data protection (sheet)
Imprint
Accessibility
License

Technical

We
open source
System status
Changelog
Frontend: v1.41.0
Backend: v1.13.4

We use cookies to provide a better user experience.

Data Protection

Analysis and simplifications of discrete event systems and Jackson queuing networks

Melamed, Benjamin.

Publication date

January 1976

Abstract

http://deepblue.lib.umich.edu/bitstream/2027.42/6571/5/bad0396.0001.001.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/6571/4/bad0396.0001.001.tx

Extracted data

Related items

Discrete-event approach to simulation of queueing networks

Moiseev, Alexander
Dorofeev, Vadim A.
Sorokin, Vasily V.
Demin, Anton Yu.

March 2020

The paper is devoted to basic principles to develop software queueing networks simulations. A mathem...

Reduction of Closed Queueing Networks for Efficient Simulation

John F. Shortle
Brian L. Mark
Donald Gross

February 2015

This article gives several methods for approximating a closed queueing network with a smaller one. T...

Dynamic analysis of repetitive decision-free discrete event processes : the algebra of timed marked graphs

Dubois, Didier

January 1988

http://deepblue.lib.umich.edu/bitstream/2027.42/35566/2/b1410453.0001.001.pdfhttp://deepblue.lib.umi...

Analysis And Simplifications Of Discrete Event Systems And Jackson Queueing Networks.

Melamed, Benjamin

January 1976

PhDComputer scienceUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepbl...

Analysis of systems of queues in parallel

Cinlar, E. (Erhan)

January 1965

http://deepblue.lib.umich.edu/bitstream/2027.42/4506/5/bac0514.0001.001.pdfhttp://deepblue.lib.umich...

On the analysis of approximation algorithms for closed queueing networks

Srinivasan, Mandyam M.
Kant, Krishna

January 1986

http://deepblue.lib.umich.edu/bitstream/2027.42/7764/5/bam7885.0001.001.pdfhttp://deepblue.lib.umich...

Review of a fast simulation method for the analysis of queueing networks

Κουϊκογλου Βασιλης(http://users.isc.tuc.gr/~vkouikoglou)
Kouikoglou Vasilis(http://users.isc.tuc.gr/~vkouikoglou)
Φιλλης Ιωαννης(http://users.isc.tuc.gr/~yphillis)
Yannis Phillis(http://users.isc.tuc.gr/~yphillis)

Summarization: This paper presents a review of and refinements to a class of discrete-event models f...

Synchronization and Linearity: An algebra for discrete event systems

Baccelli, F.
Cohen, G.
Olsder, G.J.
Quadrat, J.P.

January 1992

This book proposes a unified mathematical treatment of a class of 'linear' discrete event systems, w...

PROPERTIES OF DISCRETE EVENT SYSTEMS FROM THEIR MATHEMATICAL PROGRAMMING REPRESENTATIONS

S. Chick
P. J. Sánchez
D. Ferrin
D. J. Morrice

February 2008

important class of discrete event systems, tandem queueing networks, are considered and formulated a...

Queueing networks as models of human performance and human-computer interaction

Liu, Yili

January 1993

http://deepblue.lib.umich.edu/bitstream/2027.42/6352/5/bap9100.0001.001.pdfhttp://deepblue.lib.umich...

Importance sampling for a Markov modulated queuing network

Sezer, Ali Devin

February 2009

Importance sampling (IS) is a variance reduction method for simulating rare events. A recent paper b...

Transient Model for Jackson Networks and its Application

Ahmed M. Mohamed
Lester Lipsky
Reda Ammar

January 2003

Abstract. Jackson networks have been very successful in so many areas in modeling parallel and distr...

Importance sampling for a Markov modulated queuing network

Sezer, Ali Devin

February 2009

AbstractImportance sampling (IS) is a variance reduction method for simulating rare events. A recent...

Dynamic analysis of repetitive decision-free discrete event processes : algorithmic issues and applications to production systems

Dubois, Didier

January 1988

http://deepblue.lib.umich.edu/bitstream/2027.42/35565/2/b1410465.0001.001.pdfhttp://deepblue.lib.umi...

Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks

J. G. Dai
Vien Nguyen
Martin I. Reiman

January 2000

In heavy traffic analysis of open queueing networks, processes of interest such as queue lengths and...

Discrete-event approach to simulation of queueing networks

Moiseev, Alexander
Dorofeev, Vadim A.
Sorokin, Vasily V.
Demin, Anton Yu.

March 2020

The paper is devoted to basic principles to develop software queueing networks simulations. A mathem...

Reduction of Closed Queueing Networks for Efficient Simulation

John F. Shortle
Brian L. Mark
Donald Gross

February 2015

This article gives several methods for approximating a closed queueing network with a smaller one. T...

Dynamic analysis of repetitive decision-free discrete event processes : the algebra of timed marked graphs

Dubois, Didier

January 1988

http://deepblue.lib.umich.edu/bitstream/2027.42/35566/2/b1410453.0001.001.pdfhttp://deepblue.lib.umi...

Analysis And Simplifications Of Discrete Event Systems And Jackson Queueing Networks.

Melamed, Benjamin

January 1976

PhDComputer scienceUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepbl...

Analysis of systems of queues in parallel

Cinlar, E. (Erhan)

January 1965

http://deepblue.lib.umich.edu/bitstream/2027.42/4506/5/bac0514.0001.001.pdfhttp://deepblue.lib.umich...

On the analysis of approximation algorithms for closed queueing networks

Srinivasan, Mandyam M.
Kant, Krishna

January 1986

http://deepblue.lib.umich.edu/bitstream/2027.42/7764/5/bam7885.0001.001.pdfhttp://deepblue.lib.umich...

Review of a fast simulation method for the analysis of queueing networks

Κουϊκογλου Βασιλης(http://users.isc.tuc.gr/~vkouikoglou)
Kouikoglou Vasilis(http://users.isc.tuc.gr/~vkouikoglou)
Φιλλης Ιωαννης(http://users.isc.tuc.gr/~yphillis)
Yannis Phillis(http://users.isc.tuc.gr/~yphillis)

Summarization: This paper presents a review of and refinements to a class of discrete-event models f...

Synchronization and Linearity: An algebra for discrete event systems

Baccelli, F.
Cohen, G.
Olsder, G.J.
Quadrat, J.P.

January 1992

This book proposes a unified mathematical treatment of a class of 'linear' discrete event systems, w...

PROPERTIES OF DISCRETE EVENT SYSTEMS FROM THEIR MATHEMATICAL PROGRAMMING REPRESENTATIONS

S. Chick
P. J. Sánchez
D. Ferrin
D. J. Morrice

February 2008

important class of discrete event systems, tandem queueing networks, are considered and formulated a...

Queueing networks as models of human performance and human-computer interaction

Liu, Yili

January 1993

http://deepblue.lib.umich.edu/bitstream/2027.42/6352/5/bap9100.0001.001.pdfhttp://deepblue.lib.umich...

Importance sampling for a Markov modulated queuing network

Sezer, Ali Devin

February 2009

Importance sampling (IS) is a variance reduction method for simulating rare events. A recent paper b...

Transient Model for Jackson Networks and its Application

Ahmed M. Mohamed
Lester Lipsky
Reda Ammar

January 2003

Abstract. Jackson networks have been very successful in so many areas in modeling parallel and distr...

Importance sampling for a Markov modulated queuing network

Sezer, Ali Devin

February 2009

AbstractImportance sampling (IS) is a variance reduction method for simulating rare events. A recent...

Dynamic analysis of repetitive decision-free discrete event processes : algorithmic issues and applications to production systems

Dubois, Didier

January 1988

http://deepblue.lib.umich.edu/bitstream/2027.42/35565/2/b1410465.0001.001.pdfhttp://deepblue.lib.umi...

Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks

J. G. Dai
Vien Nguyen
Martin I. Reiman

January 2000

In heavy traffic analysis of open queueing networks, processes of interest such as queue lengths and...

Discrete-event approach to simulation of queueing networks

Moiseev, Alexander
Dorofeev, Vadim A.
Sorokin, Vasily V.
Demin, Anton Yu.

March 2020

The paper is devoted to basic principles to develop software queueing networks simulations. A mathem...

Reduction of Closed Queueing Networks for Efficient Simulation

John F. Shortle
Brian L. Mark
Donald Gross

February 2015

This article gives several methods for approximating a closed queueing network with a smaller one. T...

Dynamic analysis of repetitive decision-free discrete event processes : the algebra of timed marked graphs

Dubois, Didier

January 1988

http://deepblue.lib.umich.edu/bitstream/2027.42/35566/2/b1410453.0001.001.pdfhttp://deepblue.lib.umi...