{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:56:23Z","timestamp":1760241383389,"version":"build-2065373602"},"reference-count":25,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T00:00:00Z","timestamp":1516665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Decentralized clustering of modern information technology is widely adopted in various fields these years. One of the main reason is the features of high availability and the failure-tolerance which can prevent the entire system form broking down by a failure of a single point. Recently, toolkits such as Akka are used by the public commonly to easily build such kind of cluster. However, clusters of such kind that use Gossip as their membership managing protocol and use link failure detecting mechanism to detect link failures cannot deal with the scenario that a node stochastically drops packets and corrupts the member status of the cluster. In this paper, we formulate the problem to be evaluating the link quality and finding a max clique (NP-Complete) in the connectivity graph. We then proposed an algorithm that consists of two models driven by data from application layer to respectively solving these two problems. Through simulations with statistical data and a real-world product, we demonstrate that our algorithm has a good performance.<\/jats:p>","DOI":"10.3390\/s18020320","type":"journal-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T13:06:51Z","timestamp":1516712811000},"page":"320","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Data-Driven Packet Loss Estimation for Node Healthy Sensing in Decentralized Cluster"],"prefix":"10.3390","volume":"18","author":[{"given":"Hangyu","family":"Fan","sequence":"first","affiliation":[{"name":"Department of Electronic Engineering, Tsinghua University, Beijing 100084, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huandong","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, Tsinghua University, Beijing 100084, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, Tsinghua University, Beijing 100084, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,1,23]]},"reference":[{"key":"ref_1","unstructured":"Wikipedia (2017, October 20). Computer Cluster\u2014Wikipedia, The Free Encyclopedia. Available online: https:\/\/en.wikipedia.org\/w\/index.php?title=Computer_cluster&oldid=802238893."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/263932.263940","article-title":"Decentralised approaches for network management","volume":"27","author":"Kahani","year":"1997","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Xiong, N., Yang, Y., Cao, M., He, J., and Shu, L. (2009, January 29\u201331). A survey on fault-tolerance in distributed network systems. Proceedings of the IEEE International Conference on Computational Science and Engineering (CSE\u201909), Vancouver, BC, Canada.","DOI":"10.1109\/CSE.2009.497"},{"key":"ref_4","first-page":"471","article-title":"Fault tolerance mechanisms in distributed systems","volume":"8","author":"Sari","year":"2015","journal-title":"Int. J. Commun. Netw. Syst. Sci."},{"key":"ref_5","unstructured":"Renesse, R.V., Minsky, Y., and Hayden, M. (1998). A Gossip-Style Failure Detection Service, Springer."},{"key":"ref_6","unstructured":"Bertier, M., Marin, O., and Sens, P. (2002, January 23\u201326). Implementation and Performance Evaluation of an Adaptable Failure Detector. Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN), Washington, DC, USA."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/12.980014","article-title":"On the quality of service of failure detectors","volume":"51","author":"Chen","year":"2002","journal-title":"IEEE Trans. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Hayashibara, N., Dfago, X., Yared, R., and Katayama, T. (2004, January 18\u201320). The \u03d5 Accrual Failure Detector. Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, Florianpolis, Brazil.","DOI":"10.1109\/RELDIS.2004.1353004"},{"key":"ref_9","unstructured":"Xiong, N., Vasilakos, A., Yang, Y., Wei, S., Qiao, C., and Wu, J. (2011). General Traffic-Feature Analysis for an Effective Failure Detector in Fault-Tolerant Wired and Wireless Networks, Georgia State University. Technical Report."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Tomsic, A., Sens, P., Garcia, J., Arantes, L., and Sopena, J. (2015, January 25\u201329). 2W-FD: A failure detector algorithm with QoS. Proceedings of the Parallel and Distributed Processing Symposium, Hyderabad, India.","DOI":"10.1109\/IPDPS.2015.74"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Liu, J., Wu, Z., Wu, J., Dong, J., Zhao, Y., and Wen, D. (2017). A Weibull distribution accrual failure detector for cloud computing. PLoS ONE, 12.","DOI":"10.1371\/journal.pone.0173666"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1186\/s13174-016-0051-y","article-title":"A QoS-configurable failure detection service for internet applications","volume":"7","author":"Turchetti","year":"2016","journal-title":"J. Internet Serv. Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/TC.2003.1176982","article-title":"Peer-to-peer membership management for gossip-based protocols","volume":"52","author":"Ganesh","year":"2003","journal-title":"IEEE Trans. Comput."},{"key":"ref_14","unstructured":"Akka (2017, October 20). Akka Introduction. Available online: https:\/\/doc.akka.io\/docs\/akka\/current\/scala\/guide\/introduction.html."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TNET.2007.900412","article-title":"A geometric approach to improving active packet loss measurement","volume":"16","author":"Sommers","year":"2008","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Wu, H., and Gong, J. (2009). Packet Loss Estimation of TCP Flows Based on the Delayed ACK Mechanism, Springer.","DOI":"10.1007\/978-3-642-04492-2_72"},{"key":"ref_17","first-page":"45","article-title":"Strengthening measurements from the edges: Application-level packet loss rate estimation","volume":"43","author":"Basso","year":"2013","journal-title":"ACM"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1109\/JSAC.2010.100918","article-title":"Low-complexity algorithms for event detection in wireless sensor networks","volume":"28","author":"Sun","year":"2010","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1002\/net.21578","article-title":"Maximizing lifetime and handling reliability in wireless sensor networks","volume":"64","author":"Cerulli","year":"2014","journal-title":"Networks"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2332","DOI":"10.3390\/s100302332","article-title":"An adaptive fault-tolerant event detection scheme for wireless sensor networks","volume":"10","author":"Yim","year":"2010","journal-title":"Sensors"},{"key":"ref_21","first-page":"3","article-title":"Fault-tolerant digital systems development using triple modular redundancy","volume":"8","year":"2017","journal-title":"Int. Rev. Appl. Sci. Eng."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"2748","DOI":"10.1109\/TSP.2009.2016247","article-title":"Broadcast gossip algorithms for consensus","volume":"57","author":"Aysal","year":"2009","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_23","first-page":"1248","article-title":"Node importance of data center network based on contribution matrix of information entropy","volume":"8","author":"Peng","year":"2013","journal-title":"J. Netw."},{"key":"ref_24","unstructured":"Feige, U., Goldwasser, S., Lovasz, L., Saila, S., and Szegedy, M. (1991, January 1\u20134). Approximating clique is almost NP-complete. Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico."},{"key":"ref_25","first-page":"37","article-title":"Evaluation: From precision, recall and F-measure to ROC, informedness, markedness and correlation","volume":"2","author":"Powers","year":"2011","journal-title":"J. Mach. Learn. Technol."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/18\/2\/320\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T14:52:18Z","timestamp":1760194338000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/18\/2\/320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,23]]},"references-count":25,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,2]]}},"alternative-id":["s18020320"],"URL":"https:\/\/doi.org\/10.3390\/s18020320","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2018,1,23]]}}}