Domain Names Based on Fault Tree Analysis

Ning Zhang; Le Jun Chi; Hai Yan Xu

doi:10.4028/www.scientific.net/AMM.667.143

Paper Titles

A Dynamic Load Balancing Method with Available Bandwidth Information
p.121

An Effective Multicast Stream Scheduling Mechanism in Passive Optical Networks
p.125

An Improved TCP Congestion Control Algorithm in High Speed Satellite Links
p.129

Distributed Potential Field Based Routing with Priority Connection Probability for NDN
p.133

Domain Names Based on Fault Tree Analysis
p.143

Performance Evaluation of Ethernet Passive Optical Network for Smart Grid
p.149

Real-Time Validation for Satellite Navigation Signal Simulation System
p.153

The Design of Heterogeneous Network Integration Gateway System Based on Multi-Threaded
p.157

Building Agent Software with JADE Framework
p.165

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 667Domain Names Based on Fault Tree Analysis

Domain Names Based on Fault Tree Analysis

Abstract:

The success rate of domain name resolution has a direct influence on the service of DNS. Analytical performance of DNS server is the key to measure the satisfaction degree of users when they access to the network. This article establishes the dependence model for the domain name server. In order to get DNS fault model and analytical model, this article uses Fault Tree Analysis theory to describe the relationship of tree basic events and target events of fault tree of dependency. On the basis of fault tree model, dependencies of domain names are qualitative analyzed, including number of sets and element composition of fault model and analytical model. This study provided a theoretical basis for DNS dependencies and technical support for the DNS vulnerability analysis. It has a great importance for domain name system security.

You might also be interested in these eBooks

Advances in Computers, Electronics and Mechatronics

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 667)

Pages:

143-148

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.667.143

Citation:

Cite this paper

Online since:

October 2014

Authors:

Ning Zhang*, Le Jun Chi, Hai Yan Xu

Keywords:

DNS, Domain Name Dependence, Fault Tree Analysis

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Yuejin Du, Zhaoxin Zhang, Ke Wang, etal. Quantitative evaluation model of DNS resolvability based on propositional logic[J]. High Technology letters, 2013(2): 116-122.

Google Scholar

[2] Sethi A S. A survey of fault localization techniques in computer networks[J]. Science of computer programming, 2004, 53(2): 165-194.

DOI: 10.1016/j.scico.2004.01.010

Google Scholar

[3] Ramasubramanian V, Sirer E G. Perils of transitive trust in the domain name system[C]/ Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement. USENIX Association, 2005: 35-35.

DOI: 10.1145/1330107.1330152

Google Scholar

[4] Liu C, Albitz P. DNS and Bind[M]. O'Reilly Media, Inc., (2006).

Google Scholar

[5] Schuler R. An algorithm for the satisfiability problem of formulas in conjunctive normal form [J]. Journal of Algorithms, 2005, 54(1): 40-44.

DOI: 10.1016/j.jalgor.2004.04.012

Google Scholar

[6] Davis M, Putnam H. A computing procedure for quantification theory[J]. Journal of the ACM (JACM), 1960, 7(3): 201-215.

Google Scholar