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

R. Ayani; Suiping Zhou; Thang Nguyen; Wentong Cai; Xueyan Tang; Duong Nguyen Binh Ta

doi:10.1109/TPDS.2011.107

Publication
2012
Issue No. 2 - February
Abstract - Interactivity-Constrained Server Provisioning in Large-Scale Distributed Virtual Environments

	This Article
	Subscribers, please Login Purchase article: $19 PDF HTML IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/EndNote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by R. Ayani Articles by Wentong Cai Articles by Xueyan Tang Articles by Suiping Zhou Articles by Thang Nguyen Articles by Duong Nguyen Binh Ta

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

February 2012 (vol. 23 no. 2)

pp. 304-312

	ASCII Text	x
	R. Ayani, Wentong Cai, Xueyan Tang, Suiping Zhou, Thang Nguyen, Duong Nguyen Binh Ta, "Interactivity-Constrained Server Provisioning in Large-Scale Distributed Virtual Environments," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 2, pp. 304-312, February, 2012.

	BibTex	x
	@article{ 10.1109/TPDS.2011.107, author = {R. Ayani and Wentong Cai and Xueyan Tang and Suiping Zhou and Thang Nguyen and Duong Nguyen Binh Ta}, title = {Interactivity-Constrained Server Provisioning in Large-Scale Distributed Virtual Environments}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {23}, number = {2}, issn = {1045-9219}, year = {2012}, pages = {304-312}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.107}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - JOUR JO - IEEE Transactions on Parallel and Distributed Systems TI - Interactivity-Constrained Server Provisioning in Large-Scale Distributed Virtual Environments IS - 2 SN - 1045-9219 SP304 EP312 EPD - 304-312 A1 - R. Ayani, A1 - Wentong Cai, A1 - Xueyan Tang, A1 - Suiping Zhou, A1 - Thang Nguyen, A1 - Duong Nguyen Binh Ta, PY - 2012 KW - virtual reality KW - computational complexity KW - distributed processing KW - Internet KW - network servers KW - network topology KW - problem solving KW - PlanetLab KW - interactivity-constrained server provision KW - large-scale distributed virtual environment KW - distributed server KW - NP-hard problem KW - set covering problem KW - approximation algorithm KW - problem solving KW - static Internet latency data available KW - topology generator KW - dynamic latency data KW - DVE performance monitoring system KW - Servers KW - Quality of service KW - Delay KW - Heuristic algorithms KW - Approximation algorithms KW - Complexity theory KW - Internet KW - interactivity. KW - Distributed virtual environments KW - server provisioning VL - 23 JA - IEEE Transactions on Parallel and Distributed Systems ER -

R. Ayani, Sch. of Inf. & Commun. Technol. (ICT), R. Inst. of Technol. (KTH), Kista, Sweden

Wentong Cai, Parallel & Distrib. Comput. Centre, Nanyang Technol. Univ., Singapore, Singapore

Xueyan Tang, Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore

Suiping Zhou, Teesside Univ., Middlesbrough, UK

Thang Nguyen, Parallel & Distrib. Comput. Centre, Nanyang Technol. Univ., Singapore, Singapore

Duong Nguyen Binh Ta, Inst. of High Performance Comput., A*STAR, Singapore, Singapore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.107

Web Extra: View Supplemental Material(PDF)

Maintaining interactivity is one of the key challenges in distributed virtual environments (DVEs). 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 prespecified 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. 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.

[1] V. Nae, A. Iosup, S. Podlipnig, R. Prodan, D. Epema, and T. Fahringer, "Efficient Management of Data Center Resources for Massively Multiplayer Online Games," Proc. ACM/IEEE Supercomputing, pp. 1-12, 2008.
[2] D. Ta, S. Zhou, X. Tang, W. Cai, and R. Ayani, "Efficient Zone Mapping Algorithms for Distributed Virtual Environments," Proc. ACM/IEEE/SCS Workshop Principles of Advanced and Distributed Simulation (PADS), pp. 137-144, 2009.
[3] D. Ta and S. Zhou, "A Two-Phase Approach to Interactivity Enhancement for Large-Scale Distributed Virtual Environments," Computer Networks, vol. 51, no. 14, pp. 4131-4152, 2007.
[4] H.V. Madhyastha, T. Isdal, M. Piatek, C. Dixon, T.E. Anderson, A. Krishnamurthy, and A. Venkataramani, "iPlane: An Information Plane for Distributed Services," Proc. Symp. Operating Systems Design and Implementation (OSDI), pp. 367-380, 2006.
[5] T. Henderson and S. Bhatti, "Networked Games: A Qos-Sensitive Application for QoS-Insensitive Users?," Proc. ACM SIGCOMM Workshop Revisiting IP QoS, pp. 141-147, 2003.
[6] L. Pantel and L. Wolf, "On the Impact of Delay on Real-Time Multiplayer Games," Proc. ACM Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), pp. 23-29, 2002.
[7] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, 2001.
[8] D. Ta, T. Nguyen, S. Zhou, X. Tang, W. Cai, and R. Ayani, "A Framework for Performance Evaluation of Large-Scale Interactive Distributed Virtual Environments," Proc. IEEE Int'l Conf. Scalable Computing and Comm., 2010.
[9] K.W. Lee, B.J. Ko, and S. Calo, "Adaptive Server Selection for Large Scale Interactive Online Games," Computer Networks, vol. 49, no. 1, pp. 84-102, 2005.

Index Terms:

virtual reality,computational complexity,distributed processing,Internet,network servers,network topology,problem solving,PlanetLab,interactivity-constrained server provision,large-scale distributed virtual environment,distributed server,NP-hard problem,set covering problem,approximation algorithm,problem solving,static Internet latency data available,topology generator,dynamic latency data,DVE performance monitoring system,Servers,Quality of service,Delay,Heuristic algorithms,Approximation algorithms,Complexity theory,Internet,interactivity.,Distributed virtual environments,server provisioning

Citation:

R. Ayani, Wentong Cai, Xueyan Tang, Suiping Zhou, Thang Nguyen, Duong Nguyen Binh Ta, "Interactivity-Constrained Server Provisioning in Large-Scale Distributed Virtual Environments," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 2, pp. 304-312, Feb. 2012, doi:10.1109/TPDS.2011.107

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.