Ipv6地址空间分配方案-问题和挑战,调查

M. Raja Kumar, S. Ramadass
{"title":"Ipv6地址空间分配方案-问题和挑战,调查","authors":"M. Raja Kumar, S. Ramadass","doi":"10.1109/NETAPPS.2010.37","DOIUrl":null,"url":null,"abstract":"Research and discussion on the Internets addressing and routing scalability problems has been for more than a decade. IP aware growing population, and learned needs in terms of site multi-homing, traffic engineering, non-aggregatable address allocations and policy based routing have resulted in the continuous alarming growth of the routing tables in the Default Free Zone (DFZ). Constraints posed by the existing router technology, address allocation and architectural history have made identifying and deploying an effective solution difficult. These sources that influence the core routing table growth can lead to fragmentation or de-aggregation of address prefixes. Much of the growths of the routing tables in the DFZ are a result of de-aggregation of address prefixes. Aggressive topological aggregation is the solution to scale the routing system, that is, IP address allocations should follow topology. IP address allocation and management and the scalability of the routing system are interrelated and only certain IP address allocation and management policies yield scalable routing. The Regional Internet Registries (RIRs) individually use various allocation techniques within their respective regional pools of address space. Proper choice of address allocation algorithm would help in reducing fragmentation, thus reducing routing table size and hence increase Internet addressing and routing scalability. This paper analyzes the various address allocation algorithms used by the RIR’s and based on the lessons learnt proposes a hybrid address allocation scheme for IPv6 that would achieve appreciable address aggregation compared to the existing IPv6 address allocation algorithms, and effectively reduce routing table size in the DFZ. This would help in increasing the Internet addressing and routing scalability and thus enhance the performance of the Internet.","PeriodicalId":265699,"journal":{"name":"2010 Second International Conference on Network Applications, Protocols and Services","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Ipv6 Address Space Allocation Schemes - Issues and Challenges, A Survey\",\"authors\":\"M. Raja Kumar, S. Ramadass\",\"doi\":\"10.1109/NETAPPS.2010.37\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Research and discussion on the Internets addressing and routing scalability problems has been for more than a decade. IP aware growing population, and learned needs in terms of site multi-homing, traffic engineering, non-aggregatable address allocations and policy based routing have resulted in the continuous alarming growth of the routing tables in the Default Free Zone (DFZ). Constraints posed by the existing router technology, address allocation and architectural history have made identifying and deploying an effective solution difficult. These sources that influence the core routing table growth can lead to fragmentation or de-aggregation of address prefixes. Much of the growths of the routing tables in the DFZ are a result of de-aggregation of address prefixes. Aggressive topological aggregation is the solution to scale the routing system, that is, IP address allocations should follow topology. IP address allocation and management and the scalability of the routing system are interrelated and only certain IP address allocation and management policies yield scalable routing. The Regional Internet Registries (RIRs) individually use various allocation techniques within their respective regional pools of address space. Proper choice of address allocation algorithm would help in reducing fragmentation, thus reducing routing table size and hence increase Internet addressing and routing scalability. This paper analyzes the various address allocation algorithms used by the RIR’s and based on the lessons learnt proposes a hybrid address allocation scheme for IPv6 that would achieve appreciable address aggregation compared to the existing IPv6 address allocation algorithms, and effectively reduce routing table size in the DFZ. This would help in increasing the Internet addressing and routing scalability and thus enhance the performance of the Internet.\",\"PeriodicalId\":265699,\"journal\":{\"name\":\"2010 Second International Conference on Network Applications, Protocols and Services\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Network Applications, Protocols and Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETAPPS.2010.37\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Network Applications, Protocols and Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETAPPS.2010.37","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

关于因特网寻址和路由可伸缩性问题的研究和讨论已经有十多年了。IP感知人口的不断增长,以及站点多归属、流量工程、不可聚合地址分配和基于策略的路由等方面的学习需求,导致了缺省自由区内路由表的持续惊人增长。现有路由器技术、地址分配和架构历史的限制使得识别和部署有效的解决方案变得困难。这些影响核心路由表增长的来源可能导致地址前缀的碎片化或非聚合。DFZ中路由表的增长大部分是地址前缀去聚合的结果。主动拓扑聚合是一种扩展路由系统的解决方案,即IP地址分配应遵循拓扑结构。IP地址分配和管理与路由系统的可扩展性是相互关联的,只有某些IP地址分配和管理策略才能产生可扩展性路由。区域互联网注册管理机构(rir)在各自的区域地址空间池中单独使用各种分配技术。正确选择地址分配算法有助于减少碎片,从而减少路由表的大小,从而提高Internet寻址和路由的可伸缩性。本文分析了RIR使用的各种地址分配算法,并在吸取经验教训的基础上提出了一种IPv6的混合地址分配方案,与现有的IPv6地址分配算法相比,该方案可以实现可观的地址聚合,并有效地减少了DFZ中的路由表大小。这将有助于增加互联网寻址和路由的可伸缩性,从而提高互联网的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Ipv6 Address Space Allocation Schemes - Issues and Challenges, A Survey
Research and discussion on the Internets addressing and routing scalability problems has been for more than a decade. IP aware growing population, and learned needs in terms of site multi-homing, traffic engineering, non-aggregatable address allocations and policy based routing have resulted in the continuous alarming growth of the routing tables in the Default Free Zone (DFZ). Constraints posed by the existing router technology, address allocation and architectural history have made identifying and deploying an effective solution difficult. These sources that influence the core routing table growth can lead to fragmentation or de-aggregation of address prefixes. Much of the growths of the routing tables in the DFZ are a result of de-aggregation of address prefixes. Aggressive topological aggregation is the solution to scale the routing system, that is, IP address allocations should follow topology. IP address allocation and management and the scalability of the routing system are interrelated and only certain IP address allocation and management policies yield scalable routing. The Regional Internet Registries (RIRs) individually use various allocation techniques within their respective regional pools of address space. Proper choice of address allocation algorithm would help in reducing fragmentation, thus reducing routing table size and hence increase Internet addressing and routing scalability. This paper analyzes the various address allocation algorithms used by the RIR’s and based on the lessons learnt proposes a hybrid address allocation scheme for IPv6 that would achieve appreciable address aggregation compared to the existing IPv6 address allocation algorithms, and effectively reduce routing table size in the DFZ. This would help in increasing the Internet addressing and routing scalability and thus enhance the performance of the Internet.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信