Efficiency and fairness of load-distribution based on scale-free property

Kensuke Fukuda, Shin Ya Sato, Osamu Akashi, Kazuhiro Kazama, Toshio Hirotsu, Satoshi Kurihara, Toshiharu Sugawara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper investigates applicability of the direct use of the power-law relationship appeared in actual network topology for solving server selection and allocation problems. We introduce reversely weighted degree (RWD) with scope into server selection algorithm, and evaluate the efficiency and fairness of this selection algorithm under two server allocation algorithms by using Autonomous System (AS) topology of the Internet: degree-oriented allocation by descending order of degree for a node, and random allocation. For degree-oriented server allocation, we find the RWD algorithm improves the fairness, but a wider scope cancels the advantage of the use of degree. However, for random server allocation, we find that adding to the 1-hop scope improves the fairness significantly, although only the use of the RWD algorithm may degrade the fairness. Finally, we discuss the number of servers that the difference of the allocation algorithms becomes inconsiderable in terms of fairness.

Original languageEnglish
Title of host publicationAAAI Workshop - Technical Report
Pages16-21
Number of pages6
VolumeWS-05-07
Publication statusPublished - 2005 Dec 1
Externally publishedYes
EventAAAI-05 Workshop - Pittsburgh, PA, United States
Duration: 2005 Jul 102005 Jul 10

Other

OtherAAAI-05 Workshop
CountryUnited States
CityPittsburgh, PA
Period05/7/1005/7/10

Fingerprint

Servers
Topology
Computer systems
Internet

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Fukuda, K., Sato, S. Y., Akashi, O., Kazama, K., Hirotsu, T., Kurihara, S., & Sugawara, T. (2005). Efficiency and fairness of load-distribution based on scale-free property. In AAAI Workshop - Technical Report (Vol. WS-05-07, pp. 16-21)

Efficiency and fairness of load-distribution based on scale-free property. / Fukuda, Kensuke; Sato, Shin Ya; Akashi, Osamu; Kazama, Kazuhiro; Hirotsu, Toshio; Kurihara, Satoshi; Sugawara, Toshiharu.

AAAI Workshop - Technical Report. Vol. WS-05-07 2005. p. 16-21.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fukuda, K, Sato, SY, Akashi, O, Kazama, K, Hirotsu, T, Kurihara, S & Sugawara, T 2005, Efficiency and fairness of load-distribution based on scale-free property. in AAAI Workshop - Technical Report. vol. WS-05-07, pp. 16-21, AAAI-05 Workshop, Pittsburgh, PA, United States, 05/7/10.
Fukuda K, Sato SY, Akashi O, Kazama K, Hirotsu T, Kurihara S et al. Efficiency and fairness of load-distribution based on scale-free property. In AAAI Workshop - Technical Report. Vol. WS-05-07. 2005. p. 16-21
Fukuda, Kensuke ; Sato, Shin Ya ; Akashi, Osamu ; Kazama, Kazuhiro ; Hirotsu, Toshio ; Kurihara, Satoshi ; Sugawara, Toshiharu. / Efficiency and fairness of load-distribution based on scale-free property. AAAI Workshop - Technical Report. Vol. WS-05-07 2005. pp. 16-21
@inproceedings{92d0a99b38ea4a428c9ed8e5b20cd621,
title = "Efficiency and fairness of load-distribution based on scale-free property",
abstract = "This paper investigates applicability of the direct use of the power-law relationship appeared in actual network topology for solving server selection and allocation problems. We introduce reversely weighted degree (RWD) with scope into server selection algorithm, and evaluate the efficiency and fairness of this selection algorithm under two server allocation algorithms by using Autonomous System (AS) topology of the Internet: degree-oriented allocation by descending order of degree for a node, and random allocation. For degree-oriented server allocation, we find the RWD algorithm improves the fairness, but a wider scope cancels the advantage of the use of degree. However, for random server allocation, we find that adding to the 1-hop scope improves the fairness significantly, although only the use of the RWD algorithm may degrade the fairness. Finally, we discuss the number of servers that the difference of the allocation algorithms becomes inconsiderable in terms of fairness.",
author = "Kensuke Fukuda and Sato, {Shin Ya} and Osamu Akashi and Kazuhiro Kazama and Toshio Hirotsu and Satoshi Kurihara and Toshiharu Sugawara",
year = "2005",
month = "12",
day = "1",
language = "English",
isbn = "1577352432",
volume = "WS-05-07",
pages = "16--21",
booktitle = "AAAI Workshop - Technical Report",

}

TY - GEN

T1 - Efficiency and fairness of load-distribution based on scale-free property

AU - Fukuda, Kensuke

AU - Sato, Shin Ya

AU - Akashi, Osamu

AU - Kazama, Kazuhiro

AU - Hirotsu, Toshio

AU - Kurihara, Satoshi

AU - Sugawara, Toshiharu

PY - 2005/12/1

Y1 - 2005/12/1

N2 - This paper investigates applicability of the direct use of the power-law relationship appeared in actual network topology for solving server selection and allocation problems. We introduce reversely weighted degree (RWD) with scope into server selection algorithm, and evaluate the efficiency and fairness of this selection algorithm under two server allocation algorithms by using Autonomous System (AS) topology of the Internet: degree-oriented allocation by descending order of degree for a node, and random allocation. For degree-oriented server allocation, we find the RWD algorithm improves the fairness, but a wider scope cancels the advantage of the use of degree. However, for random server allocation, we find that adding to the 1-hop scope improves the fairness significantly, although only the use of the RWD algorithm may degrade the fairness. Finally, we discuss the number of servers that the difference of the allocation algorithms becomes inconsiderable in terms of fairness.

AB - This paper investigates applicability of the direct use of the power-law relationship appeared in actual network topology for solving server selection and allocation problems. We introduce reversely weighted degree (RWD) with scope into server selection algorithm, and evaluate the efficiency and fairness of this selection algorithm under two server allocation algorithms by using Autonomous System (AS) topology of the Internet: degree-oriented allocation by descending order of degree for a node, and random allocation. For degree-oriented server allocation, we find the RWD algorithm improves the fairness, but a wider scope cancels the advantage of the use of degree. However, for random server allocation, we find that adding to the 1-hop scope improves the fairness significantly, although only the use of the RWD algorithm may degrade the fairness. Finally, we discuss the number of servers that the difference of the allocation algorithms becomes inconsiderable in terms of fairness.

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

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

M3 - Conference contribution

AN - SCOPUS:33646070296

SN - 1577352432

SN - 9781577352433

VL - WS-05-07

SP - 16

EP - 21

BT - AAAI Workshop - Technical Report

ER -