1 / 25

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 2008/06/20. Scalable AOI-cast for Peer-to-Peer Networked Virtual Environments. Networked Virtual Environments (NVEs). NVEs such as MMOGs are growing quickly Multi-billion dollar industry

simeon
Download Presentation

Scalable AOI-cast for Peer-to-Peer Networked Virtual Environments

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Jehn-Ruey Jiang, Yu-Li Huang, and Shun-Yun Hu CSIE, National Central University, Taiwan 2008/06/20 Scalable AOI-cast for Peer-to-Peer Networked Virtual Environments

  2. Networked Virtual Environments (NVEs) • NVEs such as MMOGs are growing quickly • Multi-billion dollar industry • 10 million subscribers for World of Warcraft • 600,000 concurrent users, but 3,000 per world • Can we scale to millions in the same world?

  3. The basic problem • Client-server: resources limited by provisioning Resource limit [Funkhouser95]

  4. An intuitive solution • Peer-to-Peer: resources grow with demand Resource limit [Keller & Simon 2003]

  5. Key to scalability • Users have limited visibility called Area of Interest (AOI)‏ • Bounded resource usage achievable by exchanging messages only with AOI neighbors (i.e., an AOI-cast) Area of Interest

  6. If you talk with your AOI Neighbors directly… games can be built But how to discover new neighbors?

  7. Related Work: VON [hu et al. 2006] 1) Positions sent to all neighbors Boundary neighbors check for new neighbors 2) Connect to new nodes upon notification Disconnect any non-overlapped neighbors Non-overlapped neighbors Boundary neighbors New neighbors

  8. Related Work: VON-forwarding [chen et al. 2007] • Only connect with 1-hop neighbors • AOI-cast via forwarding • Aggregation & compression utilizable Problem: redundant message transmission

  9. Related Work: APOLO [lee et al.2006] • Each node keeps 4 out-direction links only • Non-redundant transmission Problem: Inefficient transmission path

  10. VoroCast • Goals: • Keep the simplicity & advantage of forwarding • Deliver messages without redundancy • Construct spanning trees in a distributed manner • Observation: • Growing a tree from root easily creates redundancy • Growing a tree from children avoids redundancy

  11. J K L I B M A C root N H E G D O F P Q

  12. User density issue • High user density in AOI can still be a problem • To improve AOI scalability when user density is high, consistency can be traded for less bandwidth • Those further away need not receive updates all the time

  13. FiboCast • Message frequency to distant nodes should be adjustable • Add an increasingly longer time-to-live (TTL) for each round of messages • maximum hop count sequence that increases (e.g. a Fibonacci sequence such as {0, 1, 1, 2, 3, 5, 8} • Minimum 2-hop forwarding (for VoroCast to work) ∞

  14. Example routing length • For a sequence up to 8, we save 24 updates

  15. Simulation evaluation • Map: 1000 x 1000 units • Nodes: 100 ~ 1000 (in increments of 100) • AOI radius: 200 units • Time-steps: 3000 (100ms / step) • Speed: 5 units / step (random waypoint pattern) • FiboCast: {0, 1, 1, 2, 3, 5, 8} sequence • Data is compressed by zlib

  16. Bandwidth consumption

  17. Neighborship consistency

  18. Conclusion • A simple method of constructing spanning trees distributively that allows non-redundant AOI-cast • AOI scalability is improved by reducing bandwidth use • Aggregation and compression further save bandwidth

  19. Backup slides

  20. Why 2-hop neighbors?

  21. Drift distance

  22. Procedure (JOIN)‏ 1)Joining node sends coordinates to any existing node Join request is forwarded to acceptor 2)Acceptorsends back its own neighbor list joining node connects with other nodes on the list Joining node Acceptor’s region

  23. Procedure (LEAVE)‏ 1) Simply disconnect 2) Others then update their Voronoi new B.N. is discovered via existing B.N. Leaving node (also a B.N.)‏ New boundary neighbor

More Related