基于双重检索修正域名系统的最长匹配规则

计算机工程与科学 ›› 2023, Vol. 45 ›› Issue (09): 1572-1577.

• 计算机网络与信息安全 • 上一篇下一篇

基于双重检索修正域名系统的最长匹配规则

周聪,陶静,赵宝康，李安艺

(国防科技大学计算机学院，湖南长沙 410073)

收稿日期:2022-10-15 修回日期:2023-02-14 接受日期:2023-09-25 出版日期:2023-09-25 发布日期:2023-09-12
基金资助:
国家自然科学基金（61972412;U22B2005）

A dual search strategy for modifying the longest matching rule in domain name service

ZHOU Cong,TAO Jing,ZHAO Bao-kang,LI An-yi

(College of Computer Science and Technology,National University of Defense Technology,Changsha 410073,China)

Received:2022-10-15 Revised:2023-02-14 Accepted:2023-09-25 Online:2023-09-25 Published:2023-09-12

摘要/Abstract

摘要： 域名服务在Internet中具有重要作用，ENUM技术与域名解析结合在三网融合中被广泛应用，在域名服务领域BIND系统占比很高。对比RFC对最长匹配规则定义与BIND系统实现存在的差异，通过2类域名服务软件解析结果确认，提出双重检索的策略修正BIND系统，使得NAPTR记录的解析结果更符合标准RFC描述，为更多的标准服务定制化过程提供了思路，并在实网中部署了应用。

关键词: 域名服务, 最长匹配, 修正策略, 定制化服务

Abstract: Domain name service (DNS) plays an important role in the Internet. The combination of ENUM technology and DNS has been widely used in the three networks convergence, and the BIND system accounts for a high rate in the DNS. This paper compares the difference between the RFC and the BIND system on the longest matching rule. By comparing the results of the two types of DNS, a dual search strategy is proposed to modify the BIND system, so that the DNS conforms to the standard RFC. This can provide ideas for more standard service customization processing, and deploy an application in the real network.

Key words: domain name system (DNS), the longest matching, modification strategy, customization service

周聪, 陶静, 赵宝康, 李安艺. 基于双重检索修正域名系统的最长匹配规则[J]. 计算机工程与科学, 2023, 45(09): 1572-1577.

ZHOU Cong, TAO Jing, ZHAO Bao-kang, LI An-yi. A dual search strategy for modifying the longest matching rule in domain name service[J]. Computer Engineering & Science, 2023, 45(09): 1572-1577.

基于双重检索修正域名系统的最长匹配规则

A dual search strategy for modifying the longest matching rule in domain name service

PDF

可视化

摘要/Abstract

引用本文

使用本文

相关文章 0

编辑推荐

Metrics

本文评价