A network of observers is considered,where through asynchronous(with bounded delay)communications,they cooperatively estimate the states of a linear time-invariant(LTI)system.In such a setting,a new type of adversary ...A network of observers is considered,where through asynchronous(with bounded delay)communications,they cooperatively estimate the states of a linear time-invariant(LTI)system.In such a setting,a new type of adversary might affect the observation process by impersonating the identity of the regular node,which is a violation of communication authenticity.These adversaries also inherit the capabilities of Byzantine nodes,making them more powerful threats called smart spoofers.We show how asynchronous networks are vulnerable to smart spoofing attack.In the estimation scheme considered in this paper,information flows from the sets of source nodes,which can detect a portion of the state variables each,to the other follower nodes.The regular nodes,to avoid being misguided by the threats,distributively filter the extreme values received from the nodes in their neighborhood.Topological conditions based on strong robustness are proposed to guarantee the convergence.Two simulation scenarios are provided to verify the results.展开更多
Resilient Packet Ring (RPR) is MAN technology with two counter-rotating rings that multiple stations share the bandwidth. The stations on ring must negotiate the allowed rate that they can transmit fairness eligible t...Resilient Packet Ring (RPR) is MAN technology with two counter-rotating rings that multiple stations share the bandwidth. The stations on ring must negotiate the allowed rate that they can transmit fairness eligible traffic based on the total amount of uncommitted bandwidth. RPR draft employs distributed bandwidth control algorithm in order to assure global fairness. In this paper, we suggest a new fairness control algorithm termed Congestion Distributed Fairness Algorithm (CDFA) that exhibits better pe...展开更多
We propose a k-d tree variant that is resilient to a pre-described number of memory corruptions while still us- ing only linear space. While the data structure is of indepen- dent interest, we demonstrate its use in t...We propose a k-d tree variant that is resilient to a pre-described number of memory corruptions while still us- ing only linear space. While the data structure is of indepen- dent interest, we demonstrate its use in the context of high- radiation environments. Our experimental evaluation demon- strates that the resulting approach leads to a significantly higher resiliency rate compared to previous results. This is es- pecially the case for large-scale multi-spectral satellite data, which renders the proposed approach well-suited to operate aboard today＇s satellites.展开更多
文摘A network of observers is considered,where through asynchronous(with bounded delay)communications,they cooperatively estimate the states of a linear time-invariant(LTI)system.In such a setting,a new type of adversary might affect the observation process by impersonating the identity of the regular node,which is a violation of communication authenticity.These adversaries also inherit the capabilities of Byzantine nodes,making them more powerful threats called smart spoofers.We show how asynchronous networks are vulnerable to smart spoofing attack.In the estimation scheme considered in this paper,information flows from the sets of source nodes,which can detect a portion of the state variables each,to the other follower nodes.The regular nodes,to avoid being misguided by the threats,distributively filter the extreme values received from the nodes in their neighborhood.Topological conditions based on strong robustness are proposed to guarantee the convergence.Two simulation scenarios are provided to verify the results.
文摘Resilient Packet Ring (RPR) is MAN technology with two counter-rotating rings that multiple stations share the bandwidth. The stations on ring must negotiate the allowed rate that they can transmit fairness eligible traffic based on the total amount of uncommitted bandwidth. RPR draft employs distributed bandwidth control algorithm in order to assure global fairness. In this paper, we suggest a new fairness control algorithm termed Congestion Distributed Fairness Algorithm (CDFA) that exhibits better pe...
文摘We propose a k-d tree variant that is resilient to a pre-described number of memory corruptions while still us- ing only linear space. While the data structure is of indepen- dent interest, we demonstrate its use in the context of high- radiation environments. Our experimental evaluation demon- strates that the resulting approach leads to a significantly higher resiliency rate compared to previous results. This is es- pecially the case for large-scale multi-spectral satellite data, which renders the proposed approach well-suited to operate aboard today＇s satellites.
