1@c This file has been automatically generated from summary.txi 2@c by proc.m. Do not edit this file, all changes will be lost 3 4@c -*- texinfo -*- 5 6@c Copyright (C) 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2016 Moreno Marzolla 7@c 8@c This file is part of the queueing package. 9@c 10@c The queueing package is free software; you can redistribute it 11@c and/or modify it under the terms of the GNU General Public License 12@c as published by the Free Software Foundation; either version 3 of 13@c the License, or (at your option) any later version. 14@c 15@c The queueing package is distributed in the hope that it will be 16@c useful, but WITHOUT ANY WARRANTY; without even the implied warranty 17@c of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 18@c GNU General Public License for more details. 19@c 20@c You should have received a copy of the GNU General Public License 21@c along with the queueing package; see the file COPYING. If not, see 22@c <http://www.gnu.org/licenses/>. 23 24@node Summary 25@chapter Summary 26 27@menu 28* About the Queueing Package:: What is the Queueing package. 29* Contributing Guidelines:: How to contribute. 30* Acknowledgments:: 31@end menu 32 33@node About the Queueing Package 34@section About the Queueing Package 35 36This document describes the @code{queueing} package for GNU Octave 37(@code{queueing} in short). The @code{queueing} package, previously 38known as @code{qnetworks} toolbox, is a collection of functions for 39analyzing queueing networks and Markov chains written for GNU 40Octave. Specifically, @code{queueing} contains functions for analyzing 41Jackson networks, open, closed or mixed product-form BCMP networks, 42and computing performance bounds. The following algorithms are 43available 44 45@itemize 46 47@item Convolution for closed, single-class product-form networks 48with load-dependent service centers; 49 50@item Exact and approximate Mean Value Analysis (MVA) for single and 51multiple class product-form closed networks; 52 53@item MVA for mixed, multiple class product-form networks 54with load-independent service centers; 55 56@item Approximate MVA for closed, single-class networks with blocking 57(MVABLO algorithm by F. Akyildiz); 58 59@item Asymptotic Bounds, Balanced System Bounds and Geometric Bounds; 60 61@end itemize 62 63@noindent @code{queueing} 64provides functions for analyzing the following types of single-station 65queueing systems: 66 67@itemize 68 69@item @math{M/M/1} 70@item @math{M/M/m} 71@item @math{M/M/\infty} 72@item @math{M/M/1/k} single-server, finite capacity system 73@item @math{M/M/m/k} multiple-server, finite capacity system 74@item Asymmetric @math{M/M/m} 75@item @math{M/G/1} (general service time distribution) 76@item @math{M/H_m/1} (Hyperexponential service time distribution) 77@end itemize 78 79Functions for Markov chain analysis are also provided (discrete- and 80continuous-time chains are supported): 81 82@itemize 83 84@item Birth-death processes; 85@item Transient and stationary state occupancy probabilities; 86@item Mean time to absorption; 87@item Expected sojourn times and time-averaged sojourn times; 88@item Mean first passage times; 89 90@end itemize 91 92The @code{queueing} package is distributed under the terms of the GNU 93General Public License (GPL), version 3 or later 94(@pxref{Copying}). You are encouraged to share this software with 95others, and improve this package by contributing additional functions 96and reporting bugs. @xref{Contributing Guidelines}. 97 98If you use the @code{queueing} package in a technical paper, please 99cite it as: 100 101@quotation 102Moreno Marzolla, @emph{The qnetworks Toolbox: A Software Package for 103Queueing Networks Analysis}. Khalid Al-Begain, Dieter Fiems and 104William J. Knottenbelt, Editors, Proceedings 17th International 105Conference on Analytical and Stochastic Modeling Techniques and 106Applications (ASMTA 2010) Cardiff, UK, June 14--16, 2010, volume 6148 107of Lecture Notes in Computer Science, Springer, pp. 102--116, ISBN 108978-3-642-13567-5 109@end quotation 110 111If you use BibTeX, this is the citation block: 112 113@verbatim 114@inproceedings{queueing, 115 author = {Moreno Marzolla}, 116 title = {The qnetworks Toolbox: A Software Package for Queueing 117 Networks Analysis}, 118 booktitle = {Analytical and Stochastic Modeling Techniques and 119 Applications, 17th International Conference, 120 ASMTA 2010, Cardiff, UK, June 14-16, 2010. Proceedings}, 121 editor = {Khalid Al-Begain and Dieter Fiems and William J. Knottenbelt}, 122 year = {2010}, 123 publisher = {Springer}, 124 series = {Lecture Notes in Computer Science}, 125 volume = {6148}, 126 pages = {102--116}, 127 ee = {http://dx.doi.org/10.1007/978-3-642-13568-2_8}, 128 isbn = {978-3-642-13567-5} 129} 130@end verbatim 131 132An early draft of the paper above is available as Technical Report 133@uref{http://www.informatica.unibo.it/it/ricerca/technical-report/2010/UBLCS-2010-04, 134UBLCS-2010-04}, February 2010, Department of Computer Science, 135University of Bologna, Italy. 136 137@node Contributing Guidelines 138@section Contributing Guidelines 139 140Contributions and bug reports are @emph{always} welcome. If you want 141to contribute to the @code{queueing} package, here are some 142guidelines: 143 144@itemize 145 146@item If you are contributing a new function, please embed proper 147documentation within the function itself. The documentation must be in 148@code{texinfo} format, so that it can be extracted and included into 149the printable manual. See the existing functions for the documentation 150style. 151 152@item Make sure that each new function 153validates its input parameters. For example, a function accepting 154vectors should check whether the dimensions match. 155 156@item Provide bibliographic references for each new algorithm you 157contribute. Document any significant difference from the 158reference. Update the @file{doc/references.txi} file if appropriate. 159 160@item Include test and demo blocks. 161Test blocks are particularly important, since most algorithms are 162tricky to implement correctly. If appropriate, test blocks should also 163verify that the function fails on incorrect inputs. 164 165@end itemize 166 167Send your contribution to Moreno Marzolla 168(@email{moreno.marzolla@@unibo.it}). If you are a user of this 169package and find it useful, let me know by dropping me a line. Thanks. 170 171@node Acknowledgments 172@section Acknowledgments 173 174The following people (listed alphabetically) contributed to the 175@code{queueing} package, either by providing feedback, reporting bugs 176or contributing code: Philip Carinhas, Phil Colbourn, Diego Didona, 177Yves Durand, Marco Guazzone, Dmitry Kolesnikov, Michele Mazzucco, 178Marco Paolieri. 179