|
Title:
|
REDUCIBLE COMPLEXITY IN DNS |
|
Author(s):
|
Gert Pfeifer , André Martin , Christof Fetzer |
|
ISBN:
|
978-972-8924-68-3 |
|
Editors:
|
Pedro Isaías, Miguel Baptista Nunes and Dirk Ifenthaler |
|
Year:
|
2008 |
|
Edition:
|
Single |
|
Keywords:
|
Domain Name System, Internet, Dependability, Data Mining, Configuration Issues |
|
Type:
|
Full Paper |
|
First Page:
|
153 |
|
Last Page:
|
160 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
DNS is one of the most important components of the Internet infrastructure. Unfortunately, it is known to be difficult to
implement, and available implementations are difficult to configure correctly. DNS performance and availability often
suffer from poor configuration which leads to unavailability or erroneous behavior of distributed systems that depend on
DNS. The data structures of DNS are historically grown. Some are no longer needed, some have changed their semantics.
However, they have to be maintained by implementations. We measure the extent and configuration issues in DNS data
and propose simplifications to DNS data types and semantics that would allow building more dependable
implementations. New DNS implementations could also reduce complexity by ignoring certain functionality of DNS that
are not needed or that can be implemented in other ways. |
|
|
|
|
|
|
