Distributed Environment Modeling using Path Compression Algorithm

Year 2020, , 226 - 231, 31.12.2020

Çiğdem Bakır , Veli Hakkoymaz

https://doi.org/10.18100/ijamec.797074

Cited By: 1

Abstract

In distributed environment, some operations related to objects are performed. For example, objects can be accessed or they can be moved. In our study, events related to objects (object-access, object-move) were created as independent events. In this study, the distributed environment simulation was performed and the effectiveness and success of the path compression algorithm, which we proposed as a result of the experimental study, was demonstrated. The purpose of this study is to show the effectiveness and benefits of the path compression algorithm. Path compression algorithm is an efficient algorithm whose runtime is linear. With the path compression, the long node chain that is formed while data objects are passing between the source node and the destination is broken, so that the objects are retrieved fast and the cost of access is reduced. This result is shown with experimental study by modeling the distributed environment. It is shown comparative the results of the distributed environment simulation according to the various Access/Move (%) rates using binomial distribution. When we use the path compression, the maximum length and mean length of the chain decreases. Thus, with the path compression algorithm, the long node chain created by the objects is broken, the cost of accessing the objects is reduced, and fast access to the objects is ensured. In short, with our study, fast access to data is ensured in a distributed environment.

Keywords

distribıted environment, object access, object move, path compression

References

• W.Cheng, D.R.Ports at all, “Abstractions for Usable Information Flow Control in Aeolus”, 2012 Usenix Annual Technical Conference, 2012, pp.1-13. DOI: 10.5555/2342821.2342833
• H.Esfandiari, M.Hajigohayi at all, “Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond”, ACM Transactions on Algorithms, 2018, vol 14, no.8. DOI: 10.1145/3230819
• J. Liu and M. D. George, “ Fabric: A Platform for Secure Distributed Computation and Storage”, ACM Symposium on Operating Systems Principles and Implementation (SOSP), 2009, pp.321-334. DOI: 10.1145/1629575.1629606
• J.Liu, O.Arden at all, “ Fabric:Building Open Distributed Systems Securely by Construction”, Journal of Computer Security, vol 25, no.4-5, 2017, pp. 367-426. DOI: 10.3233/JCS-15805
• M.Alizadeh, S.Abolfazli at all, “Authentication in Mobile cloud computing:A survey”, Journal of Network and Computer Applications, vol 61, 2016, pp.59-80. DOI: 10.1016/j.jnca.2015.10.005.
• R.Barejee, S.Chatterjee at all, “Performance of a Discrete Wavelet Transform Based Path Merging Compression Technique for Wireless Multimedia Sensor Networks”, Wireless Personal Communications, vol.4, 2019, pp.57-71. DOI: 10.1007/s11277-018-6008-7
• J.Janet, S.Balahrishnan at all, “Optimizing Data Movement within Cloud Environment using Efficient Compression Techniques”, International Conference on Information Communication and Embedded Systems, 2016.
• J.Cui, L.Shao at all, “Data aggregation with end-to-end Confidentiliaty and Integrity for large-scale Wireless Sensor Networks”, Peer to Peer Networking and Applications, vol.25, no.5, 2018, pp. 1022-1037. DOI: 10.1007/s12083-017-0581-5
• Y. Vural and Ş.Sağıroğlu, “ A review on Enterprise Information Security and Standards”, Journal of the Faculty of Engineering and Architecture of Gazi University, vol 23, no.2, pp. 507-522, 2008.
• O.Arden and A.C.Myers, “A calculus for flow-limited authorization”, IEEE Computer Security Foundations, 2016, pp. 135-149. DOI: 10.1109/CSF.2016.17
• Ç.Bakir and V.Hakkoymaz, “Dağıtık Veritabanında Veri Etiketleme ile Bilgi Akış Denetimi”, 5.Ulusal Yüksek Başarımlı Hesaplama Konferansı, Esenler İstanbul, 2017.
• A. C.Myers and B.Liskov, “Protecting Privacy using the Decentralized Label Model”, ACM Transactions on Software Engineering and Methodology, vol 9, no.4, pp. 410-442, 2000.