Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Mean value analysis of closed queueing networks with Erlang service time distributions (1987)
    Springer
    Computing 39 (1987), S. 219-232 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Die klassische Mittelwertanalyse wird auf geschlossene Warteschlangennetze mit einer Auftragsklasse, Erlang-verteilten Bedienungszeiten und FCFS Zuteilungsmechanismen erweitert. Eine neue Formel für die mittlere Verweilzeit wird hergeleitet. Jede Iteration sieht Gültigkeitskontrollen vor und wird bei Feststellung ungültiger Ergebnisse wiederholt. Die so gewonnenen Lösungen unterscheiden sich im Durchschnitt um weniger als 5% von entsprechenden Simulationsergebnissen.
    Notes: Abstract The classical mean value analysis approach is extended to single class closed queueing networks containing Erlang service time distributions and FCFS scheduling disciplines. A new formula for the mean residence time of jobs is derived. Each iteration provides self-checks for validity, and is repeated whenever invalid results are detected. On the average, the solutions obtained vary by less than five percent from their respective simulation results.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02309556
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Dual and selfdual networks of queues with rejection blocking (1989)
    Springer
    Computing 43 (1989), S. 1-11 
    Details
    ISSN: 1436-5057
    Keywords: Performance Evaluation ; Queueing Networks ; Rejection Blocking ; Equilibrium State Probabilities ; Performance Measures
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Offene und geschlossene Warteschlangennetze mit Rückweisungsblockierung und beliebiger Topologie werden untersucht. Durch Verwendung des sogenannten “Lochkonzeptes” wird eine Dualität für Netzwerkpaare entwickelt. Die Dualität bewirkt, daß die Gleichgewichtszustandswahrscheinlichkeiten und Durchsätze des gegebenen und des zugeordneten dualen Netzes gleich sind. Für gewisse geschlossene Netzwerke von Warteschlangen mit Rückweisungsblockierung wird eine exakte Produktformlösung abgeleitet. In diesem Fall ermöglicht die Dualität, Leistungsgrößen mit einfachen Methoden zu bestimmen. In einigen Fällen haben das gegebene und das zu ihm duale Netzwerk die gleiche Struktur. Netzwerke dieser Art werden als selbst-dual bezeichnet. Selbstdualität liefert exakte Beziehungen zwischen Leistungsgrößen von verschiedenen Stationen.
    Notes: Abstract Open and closed queueing networks with rejection blocking are investigated. Using the concept of holes, a duality is derived for pairs of networks. This duality equates equilibrium state probabilities and throughputs of the given network and its dual. As an application an exact product form solution for certain closed queueing networks with rejection blocking are derived. In this case, duality provides a simple method to compute performance measures. In some cases, a network and its dual have the same structure. Duality provides relations among performance measures of different stations in this case.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02243801
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Deadlock free buffer allocation in closed queueing networks (1989)
    Springer
    Queueing systems 4 (1989), S. 47-56 
    Details
    ISSN: 1572-9443
    Keywords: Performance evaluation ; queueing networks ; finite buffers ; blocking ; deadlock
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Blocking queueing networks are of much interest in performance analysis due to their realistic modeling capability. One important feature of such networks is that they may have deadlocks which can occur if the node capacities are not sufficiently large. A necessary and sufficient condition for the node capacities is presented such that the network is deadlock free. An algorithm is given for buffer allocation in blocking queueing networks such that no deadlocks will occur assuming that the network has the special structure called cacti-graph. Additional algorithm which takes linear time in the number of nodes, is presented to find cycles in cacti networks.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01150855
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Computational algorithms for networks of queues with rejection blocking (1989)
    Springer
    Acta informatica 26 (1989), S. 559-576 
    Details
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary Open, closed and mixed queueing networks with reversible routing, multiple job classes and rejection blocking are investigated. In rejection blocking networks blocking event occurs when upon completion of its service of a particular station's server, a job attempts to proceed to its next station. If, at that moment, its destination station is full, the job is rejected. The job goes back to the server of the source station and immediately receives a new service. This is repeated until the next station releases a job and a place becomes available. In the model jobs may change their class membership and general service time distributions depending on the job class are allowed. Two station types are considered: Either the scheduling discipline is symmetric, in which case the service time distributions are allowed to be general and dependent on the job class or the service time distributions at a station are all identical exponential distributions, in which case more general scheduling disciplines are allowed. An exact product form solution for equilibrium state probabilities is presented. Using the exact product form solution of the equilibrium state distribution, algorithms for computation of performance measures, such as mean number of jobs and throughputs, are derived. The complexity of the algorithms is discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00263580
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...