2021-09-27T05:14:43Zhttps://tsukuba.repo.nii.ac.jp/oaioai:tsukuba.repo.nii.ac.jp:000198762021-03-01T17:27:05ZA new parameter for a broadcast algorithm with locally bounded Byzantine faults繁野, 麻衣子Ichimura, AkiraShigeno, MaikoThis paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a certified propagation algorithm (CPA), which is the only algorithm we know that does not use any global knowledge of the network topology. Hence, it is worth focusing on a graph-theoretic parameter such that CPA will work correctly. Using the theory of maximum adjacency (MA) ordering, a new graph-theoretic parameter for CPA is proposed. Within a factor of two, this parameter approximates the largest t such that CPA works for t-locally bounded Byzantine faults.journal articleElsevier B.V.2010-06application/pdfInformation processing letters12-13110514517http://hdl.handle.net/2241/1058430020-0190AA00674407https://tsukuba.repo.nii.ac.jp/record/19876/files/IPL_110-12.pdfeng10.1016/j.ipl.2010.04.003© 2010 Elsevier B.V.