Please use this identifier to cite or link to this item: https://doi.org/10.1145/1542245.1542262
Title: Cross-tree adjustment for spatialized audio streaming over networked virtual environments
Authors: Liang, K.
Zimmermann, R. 
Keywords: Application level multicast
Peer-to-peer streaming
Proximity audio
Spatial audio
Issue Date: 2009
Citation: Liang, K.,Zimmermann, R. (2009). Cross-tree adjustment for spatialized audio streaming over networked virtual environments. Proceedings of the International Workshop on Network and Operating System Support for Digital Audio and Video : 73-78. ScholarBank@NUS Repository. https://doi.org/10.1145/1542245.1542262
Abstract: In recent years, integrated spatialized voice services have become an appealing application for networked virtual environments (NVE), e.g., Second Life. With a spatialized voice service, people can identify who is talking if there are several participants in the vicinity. The key challenge in a spa-tialized audio streaming application is how to disseminate audio streams while observing bandwidth limits of end-user computers and tight latency constraints, and it can be modeled as NP-complete problem. In this paper, we propose a heuristic algorithm called CTA for spatialized audio streaming over NVEs in a peer-to-peer manner. The proposed algorithm was applied to real avatar mobility traces collected from Second Life, and the simulation results demonstrate that (a) CTA can achieve a high ratio of successful to candidate receivers and (b) CTA enables most of the successful receivers to enjoy minimum latency. Copyright 2009 ACM.
Source Title: Proceedings of the International Workshop on Network and Operating System Support for Digital Audio and Video
URI: http://scholarbank.nus.edu.sg/handle/10635/40181
ISBN: 9781605584331
DOI: 10.1145/1542245.1542262
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.