@c This file has been automatically generated from summary.txi
@c by proc.m. Do not edit this file, all changes will be lost

@c -*- texinfo -*-

@c Copyright (C) 2008, 2009, 2010, 2011, 2012, 2013, 2014 Moreno Marzolla
@c
@c This file is part of the queueing package.
@c
@c The queueing package is free software; you can redistribute it
@c and/or modify it under the terms of the GNU General Public License
@c as published by the Free Software Foundation; either version 3 of
@c the License, or (at your option) any later version.
@c
@c The queueing package is distributed in the hope that it will be
@c useful, but WITHOUT ANY WARRANTY; without even the implied warranty
@c of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
@c GNU General Public License for more details.
@c
@c You should have received a copy of the GNU General Public License
@c along with the queueing package; see the file COPYING.  If not, see
@c <http://www.gnu.org/licenses/>.

@node Summary
@chapter Summary

@menu
* About the Queueing Package::          What is the Queueing package
* Contributing Guidelines::             How to contribute
* Acknowledgements::
@end menu

@node About the Queueing Package
@section About the Queueing Package

This document describes the @code{queueing} package for GNU Octave
(@code{queueing} in short). The @code{queueing} package, previously
known as @code{qnetworks}, is a collection of functions written in GNU
Octave for analyzing queueing networks and Markov
chains. Specifically, @code{queueing} contains functions for analyzing
Jackson networks, open, closed or mixed product-form BCMP networks,
and computation of performance bounds. The following algorithms have
been implemented

@itemize

@item Convolution for closed, single-class product-form networks
with load-dependent service centers;

@item Exact and approximate Mean Value Analysis (MVA) for single and
multiple class product-form closed networks;

@item MVA for mixed, multiple class product-form networks
with load-independent service centers;

@item Approximate MVA for closed, single-class networks with blocking
(MVABLO algorithm by F. Akyildiz);

@item Asymptotic Bounds, Balanced System Bounds and Geometric Bounds;

@end itemize

@noindent @code{queueing} 
provides functions for analyzing the following kind of single-station
queueing systems:

@itemize

@item @math{M/M/1}
@item @math{M/M/m}
@item @math{M/M/\infty}
@item @math{M/M/1/k} single-server, finite capacity system
@item @math{M/M/m/k} multiple-server, finite capacity system
@item Asymmetric @math{M/M/m}
@item @math{M/G/1} (general service time distribution)
@item @math{M/H_m/1} (Hyperexponential service time distribution)
@end itemize

Functions for Markov chain analysis are also provided:

@itemize

@item Birth-death process;
@item Transient and steady-state occupancy probabilities;
@item Mean times to absorption;
@item Expected sojourn times and time-averaged sojourn times;
@item Mean first passage times;

@end itemize

The @code{queueing} package is distributed under the terms of the GNU
General Public License (GPL), version 3 or later
(@pxref{Copying}). You are encouraged to share this software with
others, and make this package more useful by contributing additional
functions and reporting problems. @xref{Contributing Guidelines}.

If you use the @code{queueing} package in a technical paper, please
cite it as:

@quotation
Moreno Marzolla, @emph{The qnetworks Toolbox: A Software Package for
Queueing Networks Analysis}. Khalid Al-Begain, Dieter Fiems and
William J. Knottenbelt, Editors, Proceedings 17th International
Conference on Analytical and Stochastic Modeling Techniques and
Applications (ASMTA 2010) Cardiff, UK, June 14--16, 2010, volume 6148
of Lecture Notes in Computer Science, Springer, pp. 102--116, ISBN
978-3-642-13567-5
@end quotation

If you use BibTeX, this is the citation block:

@verbatim
@inproceedings{queueing,
  author    = {Moreno Marzolla},
  title     = {The qnetworks Toolbox: A Software Package for Queueing 
               Networks Analysis},
  booktitle = {Analytical and Stochastic Modeling Techniques and 
               Applications, 17th International Conference, 
               ASMTA 2010, Cardiff, UK, June 14-16, 2010. Proceedings},
  editor    = {Khalid Al-Begain and Dieter Fiems and William J. Knottenbelt},
  year      = {2010},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {6148},
  pages     = {102--116},
  ee        = {http://dx.doi.org/10.1007/978-3-642-13568-2_8},
  isbn      = {978-3-642-13567-5}
}
@end verbatim

An early draft of the paper above is available as Technical Report
@uref{http://www.informatica.unibo.it/ricerca/ublcs/2010/UBLCS-2010-04,
UBLCS-2010-04}, February 2010, Department of Computer Science,
University of Bologna, Italy.

@node Contributing Guidelines
@section Contributing Guidelines

Contributions and bug reports are @emph{always} welcome. If you want
to contribute to the @code{queueing} package, here are some
guidelines:

@itemize

@item If you are contributing a new function, please embed proper
documentation within the function itself. The documentation must be in
@code{texinfo} format, so that it can be extracted and formatted into
the printable manual. See the existing functions of the
@code{queueing} package for the documentation style.

@item Make sure that each new function 
properly checks the validity of its input parameters. For example,
each function accepting vectors should check whether the dimensions
match.

@item Provide bibliographic references for each new algorithm you 
contribute. If your implementation differs in some way from the
reference you give, please describe how and why your implementation
differs. Add references to the @file{doc/references.txi} file.

@item Include test and demo blocks with your code.
Test blocks are particularly important, since most algorithms tend to
be quite tricky to implement correctly. If appropriate, test blocks
should also verify that the function fails on incorrect input
parameters.

@end itemize

Send your contribution to Moreno Marzolla
(@email{moreno.marzolla@@unibo.it}). If you are just a user of this
package and find it useful, let me know by dropping me a line. Thanks.

@node Acknowledgements
@section Acknowledgements

The following people (listed in alphabetical order) contributed to the
@code{queueing} package, either by providing feedback, reporting bugs
or contributing code: Philip Carinhas, Phil Colbourn, Diego Didona,
Yves Durand, Marco Guazzone, Michele Mazzucco, Dmitry Kolesnikov.
