Ítem
Solo Metadatos
Markovian approximations for a grid computing network with a ring structure
| dc.creator | Pérez, Juan F. | spa |
| dc.creator | Van Houdt, B. | spa |
| dc.date.accessioned | 2020-08-19T14:45:51Z | |
| dc.date.available | 2020-08-19T14:45:51Z | |
| dc.date.created | 2010-08-04 | spa |
| dc.description.abstract | Optical grid networks allow many computing sites to share their resources by connecting them through high-speed links, providing a more efficient use of the resources and a timely response for incoming jobs. These jobs originate from users connected to each of the sites and, in contrast to traditional queueing networks, a particular job does not have to be processed in a predefined site. Furthermore, a job is always processed locally if there is an available local server. In this paper we propose two different methods to approximate the performance of an optical grid network with a ring topology. The first method is based on approximating the inter-overflow time process, while the second separately characterizes the periods where jobs are overflowed and the periods where they are served locally. Both approaches rely on a marked Markovian representation of the overflow process at each station and on reducing this representation by moment-matching methods. The results show that the methods accurately approximate the rate of locally processed jobs, one of the main performance measures. | eng |
| dc.format.mimetype | application/pdf | |
| dc.identifier.doi | https://doi.org/10.1080/15326349.2010.498315 | |
| dc.identifier.issn | ISSN: 1532-6349 | |
| dc.identifier.issn | EISSN: 1532-4214 | |
| dc.identifier.uri | https://repository.urosario.edu.co/handle/10336/28113 | |
| dc.language.iso | eng | spa |
| dc.publisher | The Institute for Operations Research and the Management Sciences | spa |
| dc.publisher | Taylor & Francis | spa |
| dc.relation.citationEndPage | 383 | |
| dc.relation.citationIssue | No. 3 | |
| dc.relation.citationStartPage | 357 | |
| dc.relation.citationTitle | Stochastic Models | |
| dc.relation.citationVolume | Vol. 26 | |
| dc.relation.ispartof | Stochastic Models, ISSN: 1532-6349;EISSN: 1532-4214, Vol.26, No.3 (2010); pp. 357–383 | spa |
| dc.relation.uri | https://www.tandfonline.com/doi/abs/10.1080/15326349.2010.49831 | spa |
| dc.rights.accesRights | info:eu-repo/semantics/restrictedAccess | |
| dc.rights.acceso | Restringido (Acceso a grupos específicos) | spa |
| dc.source | Stochastic Models | spa |
| dc.source.instname | instname:Universidad del Rosario | |
| dc.source.reponame | reponame:Repositorio Institucional EdocUR | |
| dc.subject.keyword | Markov chains | spa |
| dc.subject.keyword | Optical grids | spa |
| dc.subject.keyword | Queueing networks | spa |
| dc.title | Markovian approximations for a grid computing network with a ring structure | spa |
| dc.title.TranslatedTitle | Aproximaciones de Markov para una red informática en cuadrícula con estructura de anillo | spa |
| dc.type | article | eng |
| dc.type.hasVersion | info:eu-repo/semantics/publishedVersion | |
| dc.type.spa | Artículo | spa |
