An efficient MST-based content-sharing architecture for P2P/PVR networks
- Authors
- Chung, S.; Jung, E.-S.; Liu, J.C.L.; Kim, E.
- Issue Date
- 2009
- Publisher
- IEEE
- Keywords
- High-quality content-sharing; MSG; MST; Multiple-loop architecture; PVR; Shared disk
- Citation
- ISM 2009 - 11th IEEE International Symposium on Multimedia, pp.251 - 256
- Journal Title
- ISM 2009 - 11th IEEE International Symposium on Multimedia
- Start Page
- 251
- End Page
- 256
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/22545
- DOI
- 10.1109/ISM.2009.52
- ISSN
- 0000-0000
- Abstract
- Recent advances in multimedia technologies have led various enhanced multimedia services such as high-quality content-sharing. In particular, in order to deliver and distribute high-quality content effectively, a fiber channel arbitration loop- (FC-AL) based network architecture has been presented, combined with a consumer device, such as a personal video recorder (PVR). Moreover, in order to overcome the limit on the number of PVR users, a multiple-loop architecture with shared disks has been devised without using expensive FC switches. Nevertheless, there arises the need for a practically constructible topology solution since the multiple-loop architecture is based on complete graph (CG) topology that requires the most connectivity for configuration. Therefore, we propose an innovative minimum spanning tree- (MST) based graph (MSG) topology for multiple-loop topology organization. Remarkably, the MSG-based multiple-loop architecture can determine the constant average loop size and the constant reject ratio, regardless of the number of deployed loops with much less connectivity compared to the CG case, thereby effectively supporting high-quality content sharing and distribution between PVRs. © 2009 IEEE.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/22545)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.