Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Deploying Digital Media Libraries in Multi-Service Access 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
$31 $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

4 Author(s)
Vlaeminck, K. ; Dept. of Inf. Technol., Ghent Univ. ; De Turck, F. ; Dhoedt, B. ; Demeester, P.

A current important trend is the introduction of new services in the access and aggregation network, close to the end user. A major opportunity for such service enabled access networks is providing users with fast and reliable storage, allowing them to transparently access and share their digital media library anytime, anywhere, while guaranteeing data retention. An important issue in deploying such a service is where to put the storage servers, in order to minimize deployment cost without sacrificing performance. This paper presents and evaluates two algorithms for solving the storage server placement problem, minimizing the deployment cost while guaranteeing a low delay for accessing the digital media libraries from any access node. The base algorithm, referred to as SSPA (storage server placement algorithm), assumes the access and aggregation network has unlimited bandwidth. SSPA provides a lower bound on the required number of servers, respecting a maximum delay constraint. The extended algorithm, SSPA, solves the storage server placement problem, respecting both a maximum delay constraint and bandwidth constraints of the network links. It will be shown that the algorithms produce close to optimal results relatively fast

Published in:

Multimedia, 2006. ISM'06. Eighth IEEE International Symposium on

Date of Conference:

Dec. 2006