Alparslan, Denizhan N.2016-01-082016-01-0820002000http://hdl.handle.net/11693/18233Ankara : Department of Computer Engineering and the Institute of Engineering and Science of Bilkent Univ., 2000.Thesis (Master's) -- Bilkent University, 2000.Includes bibliographical references (leaves 63-65).Cataloged from PDF version of article.This thesis presents an improved version of a componentwise bounding algorithm for the steady state probability vector of nearly completely decomposable Markov chains. The given two-level algorithm uses aggregation and stochastic comparison with the strong stochastic (st) order. In order to improve accuracy, it employs reordering of states and a better componentwise probability bounding algorithm given st upper- and lower- bounding probability vectors. A thorough analysis of the algorithm is implemented in sparse storage and its implementation details are given. Numerical results on an application of wireless Asynchronous Transfer Mode network show that there are cases in which the given algorithm proves to be useful in computing bounds on the performance measures of the system. An improvement in the algorithm that must be considered to obtain better bounds on performance measures is also presented at the end.x, 65 leaves : charts ; 30 cm.Englishinfo:eu-repo/semantics/openAccessMarkov chainsNear complete decomposabilityStochastic comparisonSt-orderReorderingsAggregationThesisBILKUTUPB053003