{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T17:40:37Z","timestamp":1738777237017,"version":"3.37.0"},"reference-count":12,"publisher":"Academy Publisher","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JNW"],"DOI":"10.4304\/jnw.9.10.2591-259","type":"journal-article","created":{"date-parts":[[2014,10,6]],"date-time":"2014-10-06T14:03:16Z","timestamp":1412604196000},"source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Routing in Distributed File System"],"prefix":"10.4304","volume":"9","author":[{"given":"Lubo\u0161","family":"Mat\u011bjka","sequence":"first","affiliation":[]},{"given":"Jind\u0159ich","family":"Skupa","sequence":"additional","affiliation":[]},{"given":"Radek","family":"Strejc","sequence":"additional","affiliation":[]},{"given":"Ladislav","family":"Pe\u0161i\u010dka","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"\u0160afa\u0159\u00edk","sequence":"additional","affiliation":[]}],"member":"2838","published-online":{"date-parts":[[2014,10,6]]},"reference":[{"key":"ref1","first-page":"23","article-title":"Distributed file systems: focus on Andrew File System\/Distributed File Service (AFS\/DFS","volume-title":"Proc Thirteenth IEEE Symp","author":"T\u00f6bbicke","year":"1994","unstructured":"[1] R. T\u00f6bbicke, \"Distributed file systems: focus on Andrew File System\/Distributed File Service (AFS\/DFS),\" in Mass Storage Systems, 1994. 'Towards Distributed Storage and Data Management Systems.' First Int. Symp. Proc., Thirteenth IEEE Symp., Annecy, France, 1994, pp. 23\u201326"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/35037.35059"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/2.53351"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2007.4367971"},{"key":"ref5","first-page":"29","article-title":"The Google file system","volume-title":"19th ACM Symp Operating Systems Principles","author":"Ghemawat","year":"2003","unstructured":"[5] S. Ghemawat, H. Gobioff, and S.-T. Leung, \"The Google file system,\" in SOSP '03 Proc. 19th ACM Symp. Operating Systems Principles, New York, NY, USA, 2003, pp. 29\u201343."},{"key":"ref6","first-page":"13","article-title":"Distributed file system with online multi-master replicas","volume-title":"2nd Eastern European Regional Conf Engineering of Computer Based Systems (ECBS-EERC)","author":"Matejka","year":"2011","unstructured":"[7] L. Matejka, J. Safarik, and L. Pesicka, \"Distributed file system with online multi-master replicas,\" in 2nd Eastern European Regional Conf. Engineering of Computer Based Systems (ECBS-EERC), 2011, pp. 13\u201318."},{"key":"ref7","first-page":"1","article-title":"Process of migration of routing protocols in a LAN: RIP to OSPF","volume-title":"3rd Int Conf Electrical and Electronics Engineering","author":"P\u00e9rez","year":"2006","unstructured":"[10] M. H. P\u00e9rez, and A. M. Santiago, \"Process of migration of routing protocols in a LAN: RIP to OSPF,\" 3rd Int. Conf. Electrical and Electronics Engineering, 2006, pp. 1\u20135"},{"key":"ref8","first-page":"355","volume-title":"\"Performance analysis of dynamic routing protocol EIGRP and OSPF in IPv4 and IPv6 network\" in Informatics and Computational Intelligence","author":"Wijaya","year":"2011","unstructured":"[11] C. Wijaya, \"Performance analysis of dynamic routing protocol EIGRP and OSPF in IPv4 and IPv6 network\" in Informatics and Computational Intelligence (ICI), 2011, pp. 355\u2013360."},{"key":"ref9","volume-title":"Introduction to Algorithms","author":"Cormen","year":"2009","unstructured":"[12] T. H. Cormen, C. E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 3rd ed., MIT Press, 2009"},{"key":"ref10","first-page":"663","article-title":"All-pairs shortest paths in O(n\u00b2) time with high probability","volume-title":"IEEE Symp Foundations of Computer Science (FOCS)","author":"Peres","year":"2010","unstructured":"[13] Y. S. Peres, D. Sotnikov, B. Sudakov, and U. Zwick, \"All-pairs shortest paths in O(n\u00b2) time with high probability\" in 51st Annu. IEEE Symp. Foundations of Computer Science (FOCS), 2010, pp. 663\u2013672"},{"key":"ref11","first-page":"206","article-title":"Algorithms for file replication in a distributed system","volume-title":"13th Conf Local Computer Networks","author":"Hac","year":"1988","unstructured":"[14] A. Hac, J. Xiaowei, and J-H. Soo, \"Algorithms for file replication in a distributed system\" in Proc. 13th. Conf. Local Computer Networks, 1988, pp. 206\u2013214."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"}],"container-title":["Journal of Networks"],"original-title":[],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T17:08:08Z","timestamp":1738775288000},"score":1,"resource":{"primary":{"URL":"https:\/\/dblp.org\/db\/journals\/jnw\/index.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,6]]},"references-count":12,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2014,10,6]]}},"URL":"https:\/\/doi.org\/10.4304\/jnw.9.10.2591-259","relation":{},"ISSN":["1796-2056"],"issn-type":[{"type":"print","value":"1796-2056"}],"subject":[],"published":{"date-parts":[[2014,10,6]]}}}