TY - GEN
T1 - Overcoming DNSSEC performance issues with DHT-based architectures
AU - Migault, Daniel
AU - Francfort, Stanislas
AU - Senecal, Stephane
AU - Herbert, Emmanuel
AU - Laurent, Maryline
PY - 2013/9/10
Y1 - 2013/9/10
N2 - DNSSEC deployment for large Internet Service Provider (ISP) is an important issue. With the current architecture, the migration of current DNS resolving platforms requires 5 times more nodes. This paper introduces alternative architectures where the DNS traffic is split between the nodes of the platform according to the queried Fully Qualified Domain Names (FQDN), rather than the IP addresses of the queries. We show that such type of architecture requires up to 30% less nodes. However, this load balancing techniques results in a non-uniform distribution of the resources among the nodes of the platform. Furthermore, operational teams are reluctant to modify the existing load balancing infrastructure. Thus, we investigate how pro-active caching over a Distributed Hash Table (DHT) protocol, can optimize the resources of an ISP operational DNSSEC resolving platform. We find out that it can reduce the number of nodes by 3.5.
AB - DNSSEC deployment for large Internet Service Provider (ISP) is an important issue. With the current architecture, the migration of current DNS resolving platforms requires 5 times more nodes. This paper introduces alternative architectures where the DNS traffic is split between the nodes of the platform according to the queried Fully Qualified Domain Names (FQDN), rather than the IP addresses of the queries. We show that such type of architecture requires up to 30% less nodes. However, this load balancing techniques results in a non-uniform distribution of the resources among the nodes of the platform. Furthermore, operational teams are reluctant to modify the existing load balancing infrastructure. Thus, we investigate how pro-active caching over a Distributed Hash Table (DHT) protocol, can optimize the resources of an ISP operational DNSSEC resolving platform. We find out that it can reduce the number of nodes by 3.5.
UR - https://www.scopus.com/pages/publications/84883467541
M3 - Conference contribution
AN - SCOPUS:84883467541
SN - 9783901882517
T3 - Proceedings of the 2013 IFIP/IEEE International Symposium on Integrated Network Management, IM 2013
SP - 816
EP - 819
BT - Proceedings of the 2013 IFIP/IEEE International Symposium on Integrated Network Management, IM 2013
T2 - 2013 IFIP/IEEE International Symposium on Integrated Network Management, IM 2013
Y2 - 27 May 2013 through 31 May 2013
ER -