An efficient supergrid protocol for high availability and load balancing

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

Recently there has been a resurgence of interest in quorum-based methods for maintaining consistency of a group of replicated servers as a way to achieve load balancing in addition to high availability. We describe a SuperGrid protocol that performs well for small number of items (less than 100) and evaluate its performance analytically and through simulation experiments. Although it has been shown that it is possible to construct quorum systems where the load is O(1/√N) and the availability is exp(-Ω(√N)), these asymptotic results do not perform very well when the number of items is relatively small. In such cases, our results show that the Supergrid protocol outperforms the recent Crumbling Walls protocol and the Paths system. It is also simple and easy to implement.

Original languageEnglish (US)
Pages (from-to)1126-1133
Number of pages8
JournalIEEE Transactions on Computers
Volume49
Issue number10
DOIs
StatePublished - Dec 1 2000

Fingerprint

High Availability
Load Balancing
Resource allocation
Quorum
Availability
Network protocols
Simulation Experiment
Servers
Server
Path
Evaluate
Experiments

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

@article{d6ad24d8545a444da2ea460c475dac0d,
title = "An efficient supergrid protocol for high availability and load balancing",
abstract = "Recently there has been a resurgence of interest in quorum-based methods for maintaining consistency of a group of replicated servers as a way to achieve load balancing in addition to high availability. We describe a SuperGrid protocol that performs well for small number of items (less than 100) and evaluate its performance analytically and through simulation experiments. Although it has been shown that it is possible to construct quorum systems where the load is O(1/√N) and the availability is exp(-Ω(√N)), these asymptotic results do not perform very well when the number of items is relatively small. In such cases, our results show that the Supergrid protocol outperforms the recent Crumbling Walls protocol and the Paths system. It is also simple and easy to implement.",
author = "Akhil Kumar",
year = "2000",
month = "12",
day = "1",
doi = "10.1109/12.888048",
language = "English (US)",
volume = "49",
pages = "1126--1133",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "10",

}

An efficient supergrid protocol for high availability and load balancing. / Kumar, Akhil.

In: IEEE Transactions on Computers, Vol. 49, No. 10, 01.12.2000, p. 1126-1133.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An efficient supergrid protocol for high availability and load balancing

AU - Kumar, Akhil

PY - 2000/12/1

Y1 - 2000/12/1

N2 - Recently there has been a resurgence of interest in quorum-based methods for maintaining consistency of a group of replicated servers as a way to achieve load balancing in addition to high availability. We describe a SuperGrid protocol that performs well for small number of items (less than 100) and evaluate its performance analytically and through simulation experiments. Although it has been shown that it is possible to construct quorum systems where the load is O(1/√N) and the availability is exp(-Ω(√N)), these asymptotic results do not perform very well when the number of items is relatively small. In such cases, our results show that the Supergrid protocol outperforms the recent Crumbling Walls protocol and the Paths system. It is also simple and easy to implement.

AB - Recently there has been a resurgence of interest in quorum-based methods for maintaining consistency of a group of replicated servers as a way to achieve load balancing in addition to high availability. We describe a SuperGrid protocol that performs well for small number of items (less than 100) and evaluate its performance analytically and through simulation experiments. Although it has been shown that it is possible to construct quorum systems where the load is O(1/√N) and the availability is exp(-Ω(√N)), these asymptotic results do not perform very well when the number of items is relatively small. In such cases, our results show that the Supergrid protocol outperforms the recent Crumbling Walls protocol and the Paths system. It is also simple and easy to implement.

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

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

U2 - 10.1109/12.888048

DO - 10.1109/12.888048

M3 - Article

AN - SCOPUS:0034291646

VL - 49

SP - 1126

EP - 1133

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 10

ER -