Approximate techniques for general closed queueing networks with subnetworks having population constraints

European Journal of Operational Research

Volumn 69, Issue 2, 1993, Pages 250-264

  Baynat, Bruno ^a   Dallery, Yves ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

Aggregation technique; Closed queueing networks; Marie's method; Population constraints; Product form approximation

Indexed keywords

APPROXIMATION THEORY; COMMUNICATION SYSTEMS; COMPUTER NETWORKS; FLEXIBLE MANUFACTURING SYSTEMS; NETWORK PROTOCOLS; QUEUEING THEORY;

AGGREGATION TECHNIQUE; CLOSED QUEUEING NETWORKS; GENERAL SERVICE TIME DISTRIBUTION; MARIE METHOD; POPULATION CONSTRAINTS; PRODUCT FORM APPROXIMATION; SUBNETWORKS;

OPERATIONS RESEARCH;

EID: 0027656413     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(93)90169-N     Document Type: Article

References (19)

1. Approximate queueing models for multiprogramming computer systems
2. A unified view of product-form approximation techniques for general closed queueing networks
3. Une méthode approximative d'analyse des réseaux de files d'attente fermés multiclasses
4. The influence of service-time variability in a closed network of queues
5. Equivalence and decomposition in queueing systems: A unified approach
6. A use of complex probabilities in the theory of stochastic processes
7. Approximate analysis of general open queueing networks with restricted capacity
8. Operational analysis of stochastic closed queueing networks
9. Réseaux de files d'attente avec sémaphores
10. Semaphore queues: Modelling multi-layered window flow control mechanisms
11. Closed queueing networks with exponential servers
12. An approximate analytical method for general queueing networks
13. Calculating equilibrium probabilities for λ(n)/Ck/1/N queues
14. Extensions and computational aspects of an iterative method
15. Modélisation de systèmes à événements discrets sujets à des pannes
16. A comparison of numerical techniques in Markov modeling