|Title:||Reduced State-Spaoe Heuristics for Symmetric Markovian Queueing Systems
|Abstract:||Several techniques that help in treating Markovian models with inherently.large state-space am presented. The basic idea is expressed by a Representation Theorem that states the equivalence of results obtained either through a detailed solution or a properly estimated reduced transition matrix. The techniques either use "combinatorial placement models" that are very successful in spite of their arbitrary nature, or rely on the Maximum-Entropy Principle. A symmetric message passing system is used to illustrate the techniques and. some numerical examples are presented. These often display surprising indifference to the quality or type of the approximation used.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1988/CS/CS0491), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1988
To the main CS technical reports page
Computer science department, Technion