P2P Network for very large virtual environment

Cavagna, Romain; Bouville, Christian; Royan, Jérôme

doi:10.1145/1180495.1180551

Cited by 34 publications

(26 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A lot of research work has been done in the field of Peer-to-Peer based MMVEs. Most of them ( [5], [2], [6], [8]) are based on pure Peer-to-Peer approaches, differing from our HyperVerse approach insofar as they do not utilize a reliable backbone infrastructure. One well-known project in this field is Solipsis [6], using a multidimensional Voronoi-based overlay network in order to provide a globally scalable environment.…”

Section: Related Workmentioning

confidence: 99%

Resilience and Multicast Aspects of the Structured Network Overlay GP3

Esch

Scholtes

2010

2010 International Conference on Complex, Intelligent and Software Intensive Systems

View full text Add to dashboard Cite

Today Massive Multiuser Virtual Environments (MMVEs) are for the most part realized in a centralized fashion. While this provides advantages in terms of manageability and controllability to the providers, it is not feasible for a global-scale scenario like a 3D Web. In order to provide such a global-scale virtual environment it is indispensable to utilize P2P technologies. Within the HyperVerse project, we have developed and recently presented a two-tier Peer-toPeer (P2P) architecture that incorporates a loosely structured P2P overlay of user peers and a highly structured overlay of server machines, constituting a reliable backbone service. For the interconnection of this backbone servers we proposed a structured P2P overlay named GP3. It has been shown, that this overlay allows efficient join and node lookup operations and allows for the reference locality in virtual environments. This paper studies the GP3 algorithm with respect to multicast aspects as well as resilience against node failures.

show abstract

Section: Related Workmentioning

confidence: 99%

Resilience and Multicast Aspects of the Structured Network Overlay GP3

Esch

Scholtes

2010

2010 International Conference on Complex, Intelligent and Software Intensive Systems

View full text Add to dashboard Cite

show abstract

“…In our previous work, we focus on reducing the computational overhead at the server [8], by shifting the burden of visibility computation from the sender to the receiver. Hu et al [16] and Cavagna et al [6] have considered using peer-topeer architecture to stream a 3D scene to improve scalability. Our work is similar in spirit, but we focus on streaming single, large, progressive mesh in a view-dependent manner, rather than a 3D scene, where visibility decision is mainly done at the object level.…”

Section: Streaming Of 3d Datamentioning

confidence: 99%

Peer-assisted view-dependent progressive mesh streaming

Cheng

Liú

Ooi

2009

Proceedings of the 17th ACM International Conference on Multimedia

View full text Add to dashboard Cite

Progressive mesh streaming is increasingly used in 3D networked applications, such as online games, virtual worlds, and digital museums. To scale such applications to a large number of users without high infrastructure cost, we apply peer-to-peer techniques to mesh streaming. We consider two issues: how to partition a progressive mesh into chunks and how to lookup the provider of a chunk. For the latter issue, we investigated into two solutions, which trade off server overhead and response time. The first uses a simple centralized lookup service, while the second organizes peers into groups according to the hierarchical structure of the progressive meshes to take advantage of access pattern. Simulation results show that our proposed systems are robust under high churn rate, reduce the server overhead by more than 90%, keep control overhead below 10%, and achieve low average response time.

show abstract

“…Our strategy can be used with other spatially organized P2P overlays like Solipsis [19] or VON [18] that allow peers to be connected according to their location in a 2D space or more [20]. As we presented in [21] for the PBTree, various state variables (time-to-serve, loading level, . .…”

Section: Data Exchange Policymentioning

confidence: 99%