Sökning: onr:"swepub:oai:DiVA.org:ltu-13619" >
D2 FL: Design and I...
D2 FL: Design and Implementation of Distributed Dynamic Fault Localization
-
- Zhou, Fanfu (författare)
- hanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, Shanghai 200240, China
-
- Qi, Zhengwei (författare)
- hanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, Shanghai 200240, China
-
- Yao, Jianguo (författare)
- hanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, Shanghai 200240, China
-
visa fler...
-
- Ma, Ruhui (författare)
- hanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, Shanghai 200240, China
-
- Wang, Bing (författare)
- igh Performance and Distributed Computing, Queen’s University, Belfast BT7 1NN, United Kingdom
-
- Vasilakos, Athanasios (författare)
- Luleå tekniska universitet,Datavetenskap
-
- Guan, Haibing (författare)
- hanghai Key Laboratory of Scalable Computing and Systems, Shanghai Jiao Tong University, Shanghai 200240, China
-
visa färre...
-
(creator_code:org_t)
- IEEE, 2018
- 2018
- Engelska.
-
Ingår i: IEEE Transactions on Dependable and Secure Computing. - : IEEE. - 1545-5971 .- 1941-0018. ; 15:3, s. 378-392
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Compromised or misconfigured routers have been a major concern in large-scale networks. Such routers sabotage packet delivery, and thus hurt network performance. Data-plane fault localization (FL) promises to solve this problem. Regrettably, the path-based FL fails to support dynamic routing, and the neighbor-based FL requires a centralized trusted administrative controller (AC) or global clock synchronization in each router and introduces storage overhead for caching packets. To address these problems, we introduce a dynamic distributed and low-cost model, D2FL. Using random 2-hop neighborhood authentication, D2FL supports volatile path without the AC or global clock synchronization. Besides, D2FL requires only constant tens of KB for caching which is independent of the packet transmission rate. This is much less than the cache size of DynaFL or DFL which consumes several MB. The simulations show that D2FL achieves low false positive and false negative rate with no more than 3% bandwidth overhead. We also implement an open source prototype and evaluate its effect. The result shows that the performance burden in user space is less than 10% with the dynamic sampling algorithm.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Medieteknik (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Media and Communication Technology (hsv//eng)
Nyckelord
- Pervasive Mobile Computing
- Distribuerade datorsystem
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas