English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/7514
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Exportar a otros formatos:


Scaling in the structure of directory trees in a computer cluster

AuthorsKlemm, Konstantin ; Eguíluz, Víctor M. ; San Miguel, Maxi
KeywordsTrees (mathematics)
Tree data structures
[PACS] Computer science and technology
[PACS] Self-organized systems
[PACS] Systems obeying scaling laws
[PACS] Networks and genealogical trees
Issue Date14-Sep-2005
PublisherAmerican Physical Society
CitationPhysical Review Letters 95, 128701 (2005)
AbstractWe 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.
Description4 pages, 2 figures.-- PACS nrs.: 89.20.Ff, 05.65.+b, 89.75.Da, 89.75.Hc.-- PMID: 16197119 [PubMed].-- ArXiv pre-print available at: http://arxiv.org/abs/cond-mat/0403239
Publisher version (URL)http://dx.doi.org/10.1103/PhysRevLett.95.128701
Appears in Collections:(IFISC) Artículos
Files in This Item:
File Description SizeFormat 
filetrees_PRL_05.pdf289,68 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.