pith. sign in

arxiv: cond-mat/0403239 · v2 · pith:VAKAIHZ3new · submitted 2004-03-09 · ❄️ cond-mat.dis-nn

Scaling in the structure of directory trees in a computer cluster

classification ❄️ cond-mat.dis-nn
keywords distributiontreesdegreemodelstructureclustercomputerdifferent
0
0 comments X
read the original abstract

We describe the topological structure and the underlying organization principles of the directories created by users of a computer cluster when storing his/her own files. We analyze degree distributions, average distance between files, distribution of communities and allometric scaling exponents of the directory trees. We find that users create trees with a broad, scale-free degree distribution. The structure of the directories is well captured by a growth model with a single parameter. The degree distribution of the different trees has a non-universal exponent associated with different values of the parameter of the model. However, the distribution of community sizes has a universal exponent analytically obtained from our model.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.