Tunneling and Replication in Hierarchical DFS
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F23%3A43969614" target="_blank" >RIV/49777513:23520/23:43969614 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007/978-981-99-3236-8_21" target="_blank" >https://link.springer.com/chapter/10.1007/978-981-99-3236-8_21</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-981-99-3236-8_21" target="_blank" >10.1007/978-981-99-3236-8_21</a>
Alternative languages
Result language
angličtina
Original language name
Tunneling and Replication in Hierarchical DFS
Original language description
Nowadays, distance learning, 5G mobile networks, and 4K cameras in mobile phones generate a large amount of data consumed on demand. The storage systems must fulfill these demands. This chapter presents a counting algorithm to optimize access in the hierarchical distributed file system.Different access strategies, such as tunneling, replication, and reconnection, are discussed and used to optimize file access.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of Eighth International Congress on Information and Communication Technology Lecture Notes in Networks and Systems, vol 696.
ISBN
978-981-9932-35-1
ISSN
2367-3370
e-ISSN
2367-3389
Number of pages
10
Pages from-to
271-280
Publisher name
Springer
Place of publication
singapore
Event location
London
Event date
Feb 20, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—