Adaptive server selection for large scale interactive online games

Lee, Kang‐Won; Ko, Bongjun; Calo, Seraphin

doi:10.1145/1005847.1005880

Cited by 40 publications

(54 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Service selection is responsible for ¿nd-ing the best instance for each request based on a certain objective. In case of the Zoom-in-zoom-out algorithm [19] the objective is to select a minimum set of servers while keeping the experienced delays below a certain threshold. A more generic approach such as DONAR [20] uses a generic cost function during the selection process which needs to be minimized.…”

Section: Related Workmentioning

confidence: 99%

QuLa: Service Selection and Forwarding Table Population in Service-Centric Networking Using Real-Life Topologies

Smet

Dhoedt

Simoens

2016

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

View full text Add to dashboard Cite

Abstract-The amount of services located in the network has drastically increased over the last decade which is why more and more datacenters are located at the network edge, closer to the users. In the current Internet it is up to the client to select a destination using a resolution service (Domain Name System, Content Delivery Networks ...). In the last few years, research on Information-Centric Networking (ICN) suggests to put this selection responsibility at the network components; routers ¿nd the closest copy of a content object using the content name as input.We extend the principle of ICN to services; service routers forward requests to service instances located in datacenters spread across the network edge. To solve this problem, we ¿rst present a service selection algorithm based on both server and network metrics. Next, we describe a method to reduce the state required in service routers while minimizing the performance loss caused by this data reduction. Simulation results based on real-life networks show that we are able to ¿nd a near-optimal load distribution with only minimal state required in the service routers.

show abstract

Section: Related Workmentioning

confidence: 99%

QuLa: Service Selection and Forwarding Table Population in Service-Centric Networking Using Real-Life Topologies

Smet

Dhoedt

Simoens

2016

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

View full text Add to dashboard Cite

show abstract

“…The default latency dataset is REAL1. Similar to [20], the latencies on inter-server network links are set to 10% of the original values directly obtained from the latency datasets to emulate the well-provisioned inter-server network links.…”

Section: Default Settings and Parametersmentioning

confidence: 99%

“…In another closely related work, an algorithm was proposed in [20] for game clients to select the best server in terms of interactivity in a distributed manner. For the distributed algorithm to work, a mirrored architecture was assumed, which replicates the DVE zones at multiple servers spread across the Internet.…”

Section: Algorithmmentioning

confidence: 99%

Interactivity-Constrained Server Provisioning in Large-Scale Distributed Virtual Environments

Ta¹,

Nguyễn

Zhou

et al. 2012

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Copyright © 2012 IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Teesside University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org.By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This document was downloaded from http://tees.openrepository.com/tees/handle/10149/213390 Please do not use this version for citation purposes.All items in TeesRep are protected by copyright, with all rights reserved, unless otherwise indicated. Interactivity-Constrained Server Provisioning in Large-Scale Distributed Virtual Environments Duong Ta, Thang Nguyen, Suiping Zhou, Xueyan Tang, Wentong Cai, and Rassul Ayani Abstract-Maintaining interactivity is one of the key challenges in distributed virtual environments (DVE), e.g., online games, distributed simulations, etc., due to the large, heterogeneous Internet latencies; and the fact that clients in a DVE are usually geographically separated. In this paper, we consider a new problem, termed the interactivity-constrained server provisioning problem, whose goal is to minimize the number of distributed servers needed to achieve a pre-determined level of interactivity. We identify and formulate two variants of this new problem and show that they are both NP-hard via reductions to the set covering problem. We then propose several computationally efficient approximation algorithms for solving the problem. The main algorithms exploit dependencies among distributed servers to make provisioning decisions.We conduct extensive experiments to evaluate the performance of the proposed algorithms. More specifically, we use both static Internet latency data available from prior measurements and topology generators, as well as the most recent, dynamic latency data collected via our own large-scale deployment of a DVE performance monitoring system over PlanetLab. The results show that the newly proposed algorithms that take into account interserver dependencies significantly outperform the well-established set covering algorithm for both problem variants.

show abstract

“…In a more recent work [16], the authors proposed a distributed algorithm for clients to selects the best server in a mirrored architecture for online games, taking into account the network delay between clients and servers. The mirrored architecture replicates the DVE zones at multiple servers.…”

Section: Related Workmentioning

confidence: 99%