An approach to modelling open networks with unreliable servers and finite buffers.
Chakka, Ram, Ever, Enver and Gemikonakli, Orhan 
ORCID: https://orcid.org/0000-0002-0513-1128
(2006)
An approach to modelling open networks with unreliable servers and finite buffers.
WSEAS Transactions on Computers, 5
(11)
.
pp. 2536-2543.
ISSN 1109-2750
[Article]
Abstract
Networks of queues are extensively used in modelling transaction processing systems, and the interactions among nodes in communication networks. Today, many practical queuing systems widely used in computing and communication have finite capacities. Often, in such systems, servers are prone to failures. In this paper, the performance modelling of a multi-node system, with heterogeneous nodes, each node serving external as well as routed internal arrivals of jobs is considered. An analytical model has been developed with certain approximations, and solved for performability measures. In an attempt to improve accuracy in performability evaluation, assumptions made have been minimised and a series of computations have been performed for open queuing networks with breakdowns, repairs, and finite queuing capacity. Results obtained using the analytical model are validated through simulation and presented.
| Item Type: | Article |
|---|---|
| Research Areas: | A. > School of Science and Technology > Computer Science > SensoLab group A. > School of Science and Technology > Computer and Communications Engineering |
| Item ID: | 1734 |
| Useful Links: | |
| Depositing User: | Enver Ever |
| Date Deposited: | 30 Mar 2009 13:21 |
| Last Modified: | 08 Jul 2019 13:40 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/1734 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)