Cart (Loading....) | Create Account
Close category search window
 

An effective dynamic parallel downloading scheme with network coding in λ-grid 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

3 Author(s)
Hirata, K. ; Grad. Sch. of Sci. & Eng., Ehime Univ., Matsuyama, Japan ; Higami, Y. ; Kobayashi, S.Y.

In lambda-grid networks, data files are stored on file servers as replicas, and those replicas are downloaded in parallel to reduce downloading time. However, parallel downloading raises the blocking probability of lightpath establishments because parallel downloading wastes many wavelength resources. To resolve this problem, we propose a parallel downloading scheme with network coding which encodes data at intermediate nodes. The proposed scheme enables file servers to store many replicas and thus replicas are easily downloaded with low wavelength resources. Through simulation experiments, we show that the proposed scheme improves the blocking probability and the downloading time efficiently.

Published in:

Internet, 2009. AH-ICI 2009. First Asian Himalayas International Conference on

Date of Conference:

3-5 Nov. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.