Distributed Avatar Management for Second Life Matteo Varvello (Eurecom-Thomson) With Stefano Ferrari (Eurecom-Thomson), Ernst Biersack (Eurecom) Christophe.

Slides:



Advertisements
Similar presentations
TU/e Service Discovery Mechanisms: two case studies / IC2002 Service Discovery Mechanisms: Two case studies Control point Device UPnP Terminal Domain Host.
Advertisements

Push Technology Humie Leung Annabelle Huo. Introduction Push technology is a set of technologies used to send information to a client without the client.
L. Alchaal & al. Page Offering a Multicast Delivery Service in a Programmable Secure IP VPN Environment Lina ALCHAAL Netcelo S.A., Echirolles INRIA.
Resilient Peer-to-Peer Streaming Paper by: Venkata N. Padmanabhan Helen J. Wang Philip A. Chou Discussion Leader: Manfred Georg Presented by: Christoph.
What should you Cache? A Global Analysis on YouTube Related Video Caching Dilip Kumar Krishnappa, Michael Zink and Carsten Griwodz NOSSDAV 2013.
Computer Science 1 ShapeShifter: Scalable, Adaptive End-System Multicast John Byers, Jeffrey Considine, Nicholas Eskelinen, Stanislav Rost, Dmitriy Zavin.
Peer-to-Peer Support for Massively Multiplayer Games Bjorn Knutsson, Honghui Lu, Wei Xu, Bryan Hopkins Presented by Mohammed Alam (Shahed)
Are You moved by Your Social Network Application? Abderrahmen Mtibaa, Augustin Chaintreau, Jason LeBrun, Earl Oliver, Anna-Kaisa Pietilainen, Christophe.
Chien-Hao Chien, Shun-Yun Hu, Jehn-Ruey Jiang Adaptive Computing and Networking (ACN) Laboratory Department of Computer Science and Information Engineering.
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,
Rheeve: A Plug-n-Play Peer- to-Peer Computing Platform Wang-kee Poon and Jiannong Cao Department of Computing, The Hong Kong Polytechnic University ICDCSW.
City University London
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Chien-Hao Chien, Shun-Yun Hu, Jehn-Ruey Jiang Adaptive Computing and Networking (ACN) Laboratory Department of Computer Science and Information Engineering.
Based on last years lecture notes, used by Juha Takkinen.
1 Denial-of-Service Resilience in P2P File Sharing Systems Dan Dumitriu (EPFL) Ed Knightly (Rice) Aleksandar Kuzmanovic (Northwestern) Ion Stoica (Berkeley)
1 IMPROVING RESPONSIVENESS BY LOCALITY IN DISTRIBUTED VIRTUAL ENVIRONMENTS Luca Genovali, Laura Ricci, Fabrizio Baiardi Lucca Institute for Advanced Studies.
Mercury: Scalable Routing for Range Queries Ashwin R. Bharambe Carnegie Mellon University With Mukesh Agrawal, Srinivasan Seshan.
School of Computer Science and Software Engineering A Networked Virtual Environment Communications Model using Priority Updating Monash University Yang-Wai.
Exploiting Content Localities for Efficient Search in P2P Systems Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang 1 1 College of William and Mary,
Introduction  What is an Operating System  What Operating Systems Do  How is it filling our life 1-1 Lecture 1.
presented by Hasan SÖZER1 Scalable P2P Search Daniel A. Menascé George Mason University.
CS 672 Paper Presentation Presented By Saif Iqbal “CarNet: A Scalable Ad Hoc Wireless Network System” Robert Morris, John Jannotti, Frans Kaashoek, Jinyang.
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
Dynamic parallel access to replicated content in the Internet Pablo Rodriguez and Ernst W. Biersack IEEE/ACM Transactions on Networking, August 2002.
September 24, 2007The 3 rd CSAIL Student Workshop Byzantine Fault Tolerant Cooperative Caching Raluca Ada Popa, James Cowling, Barbara Liskov Summer UROP.
IVR Presentation Topic:A peer-to-peer message exchange scheme for large scale networked virtual environment. (N19) Presented by Feng SHEN, u
1 Efficient Management of Data Center Resources for Massively Multiplayer Online Games V. Nae, A. Iosup, S. Podlipnig, R. Prodan, D. Epema, T. Fahringer,
Data Consistency in the Structured Peer-to-Peer Network Cheng-Ying Ou, Polly Huang Network and Systems Lab 台灣大學電機資訊學院電機所.
Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.
Assembly Simulation on Collaborative Haptic Virtual Environments Rosa Iglesias, Elisa Prada Sara Casado, Teresa Gutierrez Ainhoa Uribe, Alejandro Garcia-Alonso.
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
A Delaunay Triangulation Architecture Supporting Churn and User Mobility in MMVEs Mohsen Ghaffari, Behnoosh Hariri and Shervin Shirmohammadi Advanced Communications.
Peer-to-Peer Support for Massively Multiplayer Games Zone Federation of Game Servers : a Peer-to-Peer Approach to Scalable Multi-player Online Games [INFOCOM.
Wei Gao1 and Qinghua Li2 1The University of Tennessee, Knoxville
Gil EinzigerRoy Friedman Computer Science Department Technion.
1 Towards Cinematic Internet Video-on-Demand Bin Cheng, Lex Stein, Hai Jin and Zheng Zhang HUST and MSRA Huazhong University of Science & Technology Microsoft.
Resilient Peer-to-Peer Streaming Presented by: Yun Teng.
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
ECO-DNS: Expected Consistency Optimization for DNS Chen Stephanos Matsumoto Adrian Perrig © 2013 Stephanos Matsumoto1.
Advanced Computer Networks Topic 2: Characterization of Distributed Systems.
Adaptive Web Caching CS411 Dynamic Web-Based Systems Flying Pig Fei Teng/Long Zhao/Pallavi Shinde Computer Science Department.
DISTRIBUTED COMPUTING Introduction Dr. Yingwu Zhu.
Distributed Computing CSC 345 – Operating Systems By - Fure Unukpo 1 Saturday, April 26, 2014.
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
Efficient P2P Search by Exploiting Localities in Peer Community and Individual Peers A DISC’04 paper Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang.
MobiQuitous 2007 Towards Scalable and Robust Service Discovery in Ubiquitous Computing Environments via Multi-hop Clustering Wei Gao.
A P2P-Based Architecture for Secure Software Delivery Using Volunteer Assistance Purvi Shah, Jehan-François Pâris, Jeffrey Morgan and John Schettino IEEE.
Efficient AOI-Cast for Peer-to-Peer Networked Virtual Environments.
Push Technology Humie Leung Annabelle Huo. Introduction Push technology is a set of technologies used to send information to a client without the client.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
Stefanos Antaris A Socio-Aware Decentralized Topology Construction Protocol Stefanos Antaris *, Despina Stasi *, Mikael Högqvist † George Pallis *, Marios.
1 Scalable AOI-cast for Peer-to-Peer Networked Virtual Environments Jehn-Ruey Jiang, Yu-Li Huang, and Shun-Yun Hu CSIE, National Central University, Taiwan.
CoopNet: Cooperative Networking
SHADOWSTREAM: PERFORMANCE EVALUATION AS A CAPABILITY IN PRODUCTION INTERNET LIVE STREAM NETWORK ACM SIGCOMM CING-YU CHU.
第 1 讲 分布式系统概述 §1.1 分布式系统的定义 §1.2 分布式系统分类 §1.3 分布式系统体系结构.
Stefanos Antaris Distributed Publish/Subscribe Notification System for Online Social Networks Stefanos Antaris *, Sarunas Girdzijauskas † George Pallis.
An overlay for latency gradated multicasting Anwitaman Datta SCE, NTU Singapore Ion Stoica, Mike Franklin EECS, UC Berkeley
1 Selection Strategies for Peer-to-Peer 3D Streaming Wei-Lun Sung, Shun-Yun Hu, Jehn-Ruey Jiang National Central University, Taiwan 2008/05/29.
Hierarchical Load Balancing for Large Scale Supercomputers Gengbin Zheng Charm++ Workshop 2010 Parallel Programming Lab, UIUC 1Charm++ Workshop 2010.
Gang Wang, Shining Wu, Guodong Wang, Beixing Deng, Xing Li Tsinghua University Tsinghua Univ. Oct Experimental Study on Neighbor Selection Policy.
Director: Sheng-Wei Chen Presenter: Shun-Yun Hu. MMNet Intro Multimedia Networking and Systems Laboratory Established since Dr. Sheng-Wei Chen (Associate.
Network Topologies for Scalable Multi-User Virtual Environments Lingrui Liang.
Plethora: Infrastructure and System Design
Early Measurements of a Cluster-based Architecture for P2P Systems
SCOPE: Scalable Consistency in Structured P2P Systems
Scalable Peer-to-Peer Networked Virtual Environment
A Case for Mutual Notification
SMART GRID COMMUNICATIONS EMULATOR ( SYNTHETIC USERS)
Presentation transcript:

Distributed Avatar Management for Second Life Matteo Varvello (Eurecom-Thomson) With Stefano Ferrari (Eurecom-Thomson), Ernst Biersack (Eurecom) Christophe Diot (Thomson) Paris, November 23 rd, 2009

2 Introduction to Second Life Second Life (SL) is a synthetic world where multiple participants interact via the Internet – Users meet, communicate, play and trade – 16 million registered users (September 2009) The virtual world is made of independent regions – Regions are filled with objects (cars, trees and buildings) – Users interact through their avatars Client/Server (C/S) architecture – One region per server

3 Motivations Current Second Life C/S design does not scale – Maximum 100 concurrent avatars per server – World simulation is very often “slowed down” [CONEXT’08] Peer-to-Peer (P2P) can solve scalability issues – How would Second Life perform in P2P? – How to design efficiently a P2P virtual world?

4 Outline Distributed Avatar Management The Delaunay Network Experimental Evaluation Results Conclusions and Future Work

5 Distributed Avatar Management* Problem – Neighbor avatar discovery – Dissemination of avatar state updates Many candidate solutions – Distributed Hash Table, Delaunay/Voronoi Network, Multicast Tree, etc. *Distributed Object Management was presented in [INFOCOM’09]

6 The Delaunay Network Why? – Popular design for distributed avatar management – Convenient for Second Life [CONEXT’08] – Missing experimental evaluation!! What? – P2P network topology based on the Delaunay triangulation – The Delaunay triangulation of a set of N points in is a triangulation of points DT(N) such that no point p lies inside the circumcircle of any triangle in DT(N).

7 The Delaunay Network (cont’d) Can we achieve better QoE with Delaunay? (than with C/S) X A B C D E Avatar coordinates are used to construct the Delaunay triangulation

8 Instrument open source SL client [libsecondlife] Avatar traces – SL crawler [CONEXT’08] – 207 avatar sessions over one hour Empty and unpopular SL region as a playground Planetlab machines as hosts Experimental Evaluation

Evaluation – The P2P-SL Client

Inconsistency – It is the fraction of wrong avatar information contained within an avatar Area of Interest (AoI) – It takes values between 0 and 1 Inconsistency Duration – It is the time an avatar needs to achieve a consistent view of the avatars in its AoI Evaluation – Metric Definition

Evaluation – Limitations Experimenting on empty region is in favor of C/S We measure user QoE “re-playing” real (monitored) avatar behaviors using bots – Avatar behavior changes according to factors such as perceived performance – Lack of human feedback

12 Results – Inconsistency P2P is more consistent 20-40% of the times Comparable Inconsistency

13 Results – Inconsistency Duration P2P is about 5 times more responsive than C/S!!

14 Conclusions and Future Work We evaluate P2P versus C/S Second Life – P2P makes avatar experience more correct and interactive – Slow responsiveness in presence of churn, fast avatar movements and groups Future Work – Improve performance of the Delaunay Network – Integrate in the P2P-SL client a distributed object management

15 Questions?