By Topic

A scalable PVR-based content sharing architecture for community networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sungwook Chung ; Dept. of Comput. & Inf. Sci. & Eng., Florida Univ., Gainesville, FL ; Eunsam Kim ; Jonathan C. L. Liu

Integrated with consumer devices like PVRs, a community network can serve as a content sharing architecture for high-quality TV programs in a residential area. To build up such a community network, we employ Fiber Channel Arbitrated Loop (FC-AL) as a fast network connecting a large number of PVRs at a low cost. However, an FC-AL single loop has a critical limitation in terms of the number of attached PVRs when connecting thousands of users in densely-populated communities. We therefore develop a novel multiple loop architecture capable of providing a scalable community network in an economical way without using expensive switches. To connect multiple loops in our architecture, we introduce shared disks that relay TV programs between loops. We then present all possible topologies including linear, ring, edge-added, and complete topology that can be configured with shared disks. We also analyze which topology has the best scalability by evaluating the total traffic of each topology. The analysis and experimental results show that the complete topology among all the possible topologies provides the best scalability.

Published in:

IEEE Transactions on Consumer Electronics  (Volume:54 ,  Issue: 3 )