Destination selection algorithm in a server migration service

Asato Yamanaka, Yukinobu Fukushima, Tokumi Yokohira, Tutomu Murase, Tatsuya Suda

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

4 Citations (Scopus)

Abstract

Using network virtualization technologies for network applications (NW-Apps) consisting of server and clients, we can implement a server migration service where there are many server running environments (working places: WPs) inside a network and servers onWPs can migrate to otherWPs when communication QoSs in some NW-Apps fall off. Because server size is large, the traffic for server migration causes QoS degradation of its background traffic. Thus, it is important to decrease the degree (network impact) of the QoS degradation. In this paper, we propose three destination selection algorithms, MIA (Minimum Impact Algorithm), MRA (Maximum Remaining space Algorithm) and MCA (Maximum Covering Algorithm) that try to decrease the impact while increasing the number of NW-Apps' clients whose SLA (service level agreement) are satisfied. When a server migration is triggered, MIA, MRA and MCA move the server in the WP with the minimum impact, the WP with the maximum remaining space for servers and the WP with the maximum coverage, which is the number of routers under which the corresponding clients can communicate with the server while satisfying the SLA, respectively. Numerical examples show that when the number of accommodatable servers in full-cover WP (a full-cover WP is such WP that communicates with an arbitrary client while satisfying the SLA) is small or there is no full-cover WP, MIA outperforms the others, otherwise MCA outperforms the others.

Original languageEnglish
Title of host publicationProceedings of the 7th International Conference on Future Internet Technologies, CFI'12
Pages15-20
Number of pages6
DOIs
Publication statusPublished - 2012
Event7th International Conference on Future Internet Technologies, CFI'12 - Seoul, Korea, Republic of
Duration: Sep 11 2012Sep 12 2012

Other

Other7th International Conference on Future Internet Technologies, CFI'12
CountryKorea, Republic of
CitySeoul
Period9/11/129/12/12

Fingerprint

Servers
Telecommunication traffic
Quality of service
Degradation
Computer networks
Routers
Communication

Keywords

  • Cloud computing
  • Destination selection algorithm
  • Server migration service

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Yamanaka, A., Fukushima, Y., Yokohira, T., Murase, T., & Suda, T. (2012). Destination selection algorithm in a server migration service. In Proceedings of the 7th International Conference on Future Internet Technologies, CFI'12 (pp. 15-20) https://doi.org/10.1145/2377310.2377315

Destination selection algorithm in a server migration service. / Yamanaka, Asato; Fukushima, Yukinobu; Yokohira, Tokumi; Murase, Tutomu; Suda, Tatsuya.

Proceedings of the 7th International Conference on Future Internet Technologies, CFI'12. 2012. p. 15-20.

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

Yamanaka, A, Fukushima, Y, Yokohira, T, Murase, T & Suda, T 2012, Destination selection algorithm in a server migration service. in Proceedings of the 7th International Conference on Future Internet Technologies, CFI'12. pp. 15-20, 7th International Conference on Future Internet Technologies, CFI'12, Seoul, Korea, Republic of, 9/11/12. https://doi.org/10.1145/2377310.2377315
Yamanaka A, Fukushima Y, Yokohira T, Murase T, Suda T. Destination selection algorithm in a server migration service. In Proceedings of the 7th International Conference on Future Internet Technologies, CFI'12. 2012. p. 15-20 https://doi.org/10.1145/2377310.2377315
Yamanaka, Asato ; Fukushima, Yukinobu ; Yokohira, Tokumi ; Murase, Tutomu ; Suda, Tatsuya. / Destination selection algorithm in a server migration service. Proceedings of the 7th International Conference on Future Internet Technologies, CFI'12. 2012. pp. 15-20
@inproceedings{250f80a0d47c420e97128474bc9b2b1f,
title = "Destination selection algorithm in a server migration service",
abstract = "Using network virtualization technologies for network applications (NW-Apps) consisting of server and clients, we can implement a server migration service where there are many server running environments (working places: WPs) inside a network and servers onWPs can migrate to otherWPs when communication QoSs in some NW-Apps fall off. Because server size is large, the traffic for server migration causes QoS degradation of its background traffic. Thus, it is important to decrease the degree (network impact) of the QoS degradation. In this paper, we propose three destination selection algorithms, MIA (Minimum Impact Algorithm), MRA (Maximum Remaining space Algorithm) and MCA (Maximum Covering Algorithm) that try to decrease the impact while increasing the number of NW-Apps' clients whose SLA (service level agreement) are satisfied. When a server migration is triggered, MIA, MRA and MCA move the server in the WP with the minimum impact, the WP with the maximum remaining space for servers and the WP with the maximum coverage, which is the number of routers under which the corresponding clients can communicate with the server while satisfying the SLA, respectively. Numerical examples show that when the number of accommodatable servers in full-cover WP (a full-cover WP is such WP that communicates with an arbitrary client while satisfying the SLA) is small or there is no full-cover WP, MIA outperforms the others, otherwise MCA outperforms the others.",
keywords = "Cloud computing, Destination selection algorithm, Server migration service",
author = "Asato Yamanaka and Yukinobu Fukushima and Tokumi Yokohira and Tutomu Murase and Tatsuya Suda",
year = "2012",
doi = "10.1145/2377310.2377315",
language = "English",
isbn = "9781450316903",
pages = "15--20",
booktitle = "Proceedings of the 7th International Conference on Future Internet Technologies, CFI'12",

}

TY - GEN

T1 - Destination selection algorithm in a server migration service

AU - Yamanaka, Asato

AU - Fukushima, Yukinobu

AU - Yokohira, Tokumi

AU - Murase, Tutomu

AU - Suda, Tatsuya

PY - 2012

Y1 - 2012

N2 - Using network virtualization technologies for network applications (NW-Apps) consisting of server and clients, we can implement a server migration service where there are many server running environments (working places: WPs) inside a network and servers onWPs can migrate to otherWPs when communication QoSs in some NW-Apps fall off. Because server size is large, the traffic for server migration causes QoS degradation of its background traffic. Thus, it is important to decrease the degree (network impact) of the QoS degradation. In this paper, we propose three destination selection algorithms, MIA (Minimum Impact Algorithm), MRA (Maximum Remaining space Algorithm) and MCA (Maximum Covering Algorithm) that try to decrease the impact while increasing the number of NW-Apps' clients whose SLA (service level agreement) are satisfied. When a server migration is triggered, MIA, MRA and MCA move the server in the WP with the minimum impact, the WP with the maximum remaining space for servers and the WP with the maximum coverage, which is the number of routers under which the corresponding clients can communicate with the server while satisfying the SLA, respectively. Numerical examples show that when the number of accommodatable servers in full-cover WP (a full-cover WP is such WP that communicates with an arbitrary client while satisfying the SLA) is small or there is no full-cover WP, MIA outperforms the others, otherwise MCA outperforms the others.

AB - Using network virtualization technologies for network applications (NW-Apps) consisting of server and clients, we can implement a server migration service where there are many server running environments (working places: WPs) inside a network and servers onWPs can migrate to otherWPs when communication QoSs in some NW-Apps fall off. Because server size is large, the traffic for server migration causes QoS degradation of its background traffic. Thus, it is important to decrease the degree (network impact) of the QoS degradation. In this paper, we propose three destination selection algorithms, MIA (Minimum Impact Algorithm), MRA (Maximum Remaining space Algorithm) and MCA (Maximum Covering Algorithm) that try to decrease the impact while increasing the number of NW-Apps' clients whose SLA (service level agreement) are satisfied. When a server migration is triggered, MIA, MRA and MCA move the server in the WP with the minimum impact, the WP with the maximum remaining space for servers and the WP with the maximum coverage, which is the number of routers under which the corresponding clients can communicate with the server while satisfying the SLA, respectively. Numerical examples show that when the number of accommodatable servers in full-cover WP (a full-cover WP is such WP that communicates with an arbitrary client while satisfying the SLA) is small or there is no full-cover WP, MIA outperforms the others, otherwise MCA outperforms the others.

KW - Cloud computing

KW - Destination selection algorithm

KW - Server migration service

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

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

U2 - 10.1145/2377310.2377315

DO - 10.1145/2377310.2377315

M3 - Conference contribution

AN - SCOPUS:84867706051

SN - 9781450316903

SP - 15

EP - 20

BT - Proceedings of the 7th International Conference on Future Internet Technologies, CFI'12

ER -