By Topic

An algorithm of node collection in Distributed File System based on mathematical expectation

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

7 Author(s)
Shufen Liu ; Coll. of Comput. Sci. & Technol., JiLin Univ., Changchun, China ; Changhong Hu ; Huang Leng ; Xiaoyan Wang
more authors

For conquering the effect of data transmission in user access to the randomness between system and user in distributed virtual environment, in this paper algorithm of node collection in DFS (Distributed File System) based on expectation is presented. We present the mathematical model and calculation steps too. And in this paper we propose not only the application of a polynomial function fitting the user with the speed sets on the network node cluster but also the tactics of calculation the max expectation from the function Fitting. Simulations show that we can find the best node in every area and different sessions from this algorithm and tactic.

Published in:

Computer Application and System Modeling (ICCASM), 2010 International Conference on  (Volume:5 )

Date of Conference:

22-24 Oct. 2010