.png){kind=icon}
.png){kind=icon}
Return
An efficient caching algorithm for peer-to-peer 3D streaming in distributed virtual environments
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jnca.2014.03.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recent technical progress on the Internet and virtual reality has enabled the proliferation of the applications of distributed virtual environments (DVEs). In a DVE, high-resolution 3D contents may generate huge data while peer-to-peer (P2P) streaming takes advantages to carry these huge traffic in a cost-effective manner. In this P2P paradigm, peers can cache and share DVE data cooperatively to reduce server workload and improve streaming quality. Nevertheless, it is critical to maintain and update the cached contents in each peer efficiently. In this paper, we propose an efficient caching algorithm for a P2P 3D content streaming framework. The proposed caching algorithm is based on a new preservation metric that is defined for balancing visual saliency, reusability and potential relevance of cached 3D objects. Then, these cached 3D objects in each peer are updated adaptively with the ascendant order in importance quantified using this new metric. We implemented the proposed caching algorithm in a simulated DVE platform for P2P-based 3D streaming. We conducted a comprehensive simulation study and our experimental results demonstrate that the proposed peer-to-peer streaming method outperforms the classic 3D streaming methods (including FLoD and MRM) in terms of fill ratio, base latency, requests by nodes and requests to the server. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Caching
Peer-to-peer
Distributed virtual environment
3D streaming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8
Papers:
3.6K
Citations:
1.1W