Publication
Title
Markovian Approximations for a Grid Computing Network with a Ring Structure
Author
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
Language
English
Source (journal)
Stochastic models. - New York, N.Y.
Publication
New York, N.Y. : 2010
ISSN
1532-6349
Volume/pages
26:3(2010), p. 357-383
ISI
000280675100003
Full text (Publisher's DOI)
Full text (open access)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 06.10.2010
Last edited 05.08.2017
To cite this reference