Please use this identifier to cite or link to this item: https://doi.org/10.1109/TPDS.2012.91
DC FieldValue
dc.titleIDM: An indirect dissemination mechanism for spatial voice interaction in networked virtual environments
dc.contributor.authorLiang, K.
dc.contributor.authorSeo, B.
dc.contributor.authorKryczka, A.
dc.contributor.authorZimmermann, R.
dc.date.accessioned2013-07-15T05:25:42Z
dc.date.available2013-07-15T05:25:42Z
dc.date.issued2013
dc.identifier.citationLiang, K., Seo, B., Kryczka, A., Zimmermann, R. (2013). IDM: An indirect dissemination mechanism for spatial voice interaction in networked virtual environments. IEEE Transactions on Parallel and Distributed Systems 24 (2) : 356-367. ScholarBank@NUS Repository. https://doi.org/10.1109/TPDS.2012.91
dc.identifier.issn10459219
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/42913
dc.description.abstractOne type of Peer-to-Peer (P2P) live streaming has not yet been significantly investigated, namely topologies that provide many-to-many, interactive connectivity. Exemplar applications of such P2P systems include spatial audio services for networked virtual environments (NVEs) and distributed online games. Numerous challenging problems have to be overcome-among them providing low delay, resilience to churn, effective load balancing, and rapid convergence-in such dynamic environments. We propose a novel P2P overlay dissemination mechanism, termed IDM, that can satisfy such demanding real-time requirements. Our target application is to provide spatialized voice support in multiplayer NVEs, where each bandwidth constrained peer potentially communicates with all other peers within its area-of-interest (AoI). With IDM each peer maintains a set of partners, termed helpers, which may act as stream forwarders. We prove analytically that the system reachability is maximized when the loads of helpers are balanced proportionally to their network capacities. We then propose a game-theoretic algorithm that balances the loads of the peers in a fully distributed manner. Of practical importance in dynamic systems, we prove that our algorithm converges to an approximately balanced state from any prior state in rapid O(n) time, where n is the number of users. We further evaluate our technique with simulations and show that it can achieve near optimal system reachability and satisfy the tight latency constraints of interactive audio under conditions of churn, avatar mobility, and heterogeneous user access network bandwidth. © 1990-2012 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/TPDS.2012.91
dc.sourceScopus
dc.subjectdistributed algorithm
dc.subjectload balancing
dc.subjectmany-to-many interaction
dc.subjectSpatial audio
dc.typeArticle
dc.contributor.departmentINFORMATION SYSTEMS
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1109/TPDS.2012.91
dc.description.sourcetitleIEEE Transactions on Parallel and Distributed Systems
dc.description.volume24
dc.description.issue2
dc.description.page356-367
dc.description.codenITDSE
dc.identifier.isiut000312839100012
Appears in Collections:Staff Publications

Show simple 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.