Markovian approximations for a grid computing network with a ring structure

J. F. Pérez, B. Van Houdt

Research output: Contribution to journalArticle

2 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)357-383
Number of pages27
JournalStochastic Models
Volume26
Issue number3
DOIs
StatePublished - Jul 1 2010
Externally publishedYes

Fingerprint

Queueing networks
Grid computing
Grid Computing
Servers
Topology
Ring
Overflow
Approximation
Moment Matching
Grid
Resources
Queueing Networks
Performance Measures
High Speed
Server
Computing

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Modeling and Simulation
  • Applied Mathematics

Cite this

@article{21b1a31956df415296d028dee75b1b57,
title = "Markovian approximations for a grid computing network with a ring structure",
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.",
author = "P{\'e}rez, {J. F.} and {Van Houdt}, B.",
year = "2010",
month = "7",
day = "1",
doi = "10.1080/15326349.2010.498315",
language = "English (US)",
volume = "26",
pages = "357--383",
journal = "Stochastic Models",
issn = "1532-6349",
publisher = "Taylor and Francis Ltd.",
number = "3",

}

Markovian approximations for a grid computing network with a ring structure. / Pérez, J. F.; Van Houdt, B.

In: Stochastic Models, Vol. 26, No. 3, 01.07.2010, p. 357-383.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Markovian approximations for a grid computing network with a ring structure

AU - Pérez, J. F.

AU - Van Houdt, B.

PY - 2010/7/1

Y1 - 2010/7/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77955435436&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955435436&partnerID=8YFLogxK

U2 - 10.1080/15326349.2010.498315

DO - 10.1080/15326349.2010.498315

M3 - Article

AN - SCOPUS:77955435436

VL - 26

SP - 357

EP - 383

JO - Stochastic Models

JF - Stochastic Models

SN - 1532-6349

IS - 3

ER -