An Anycast Communication Model on Solving Scalability in IPv6

Xiaonan Wang, Huan-yan Qian
{"title":"An Anycast Communication Model on Solving Scalability in IPv6","authors":"Xiaonan Wang, Huan-yan Qian","doi":"10.1109/ICARCV.2006.345082","DOIUrl":null,"url":null,"abstract":"The existing designs for providing Anycast services are either to confine each Anycast group to a preconfigured topological region or to globally distribute routes to individual Anycast groups which causes the routing tables to grow proportionally to the number of all global Anycast groups in the entire Internet, both of which restrict and hinder the application and development of Anycast services. A new kind of Anycast communication model is proposed on the basis of Anycast tree in this paper. Since this model achieves dynamic Anycast group and allows Anycast members to freely leave and join Anycast group it radically solves the existing scalability problem. In addition, this model accomplishes the distributed maintenance and transaction of Anycast nodes so it accomplishes the load balance. This paper deeply analyzes and discusses the feasibility and validity of this communication model, and argues that it supports the large-scale Anycast group.","PeriodicalId":415827,"journal":{"name":"2006 9th International Conference on Control, Automation, Robotics and Vision","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 9th International Conference on Control, Automation, Robotics and Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARCV.2006.345082","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The existing designs for providing Anycast services are either to confine each Anycast group to a preconfigured topological region or to globally distribute routes to individual Anycast groups which causes the routing tables to grow proportionally to the number of all global Anycast groups in the entire Internet, both of which restrict and hinder the application and development of Anycast services. A new kind of Anycast communication model is proposed on the basis of Anycast tree in this paper. Since this model achieves dynamic Anycast group and allows Anycast members to freely leave and join Anycast group it radically solves the existing scalability problem. In addition, this model accomplishes the distributed maintenance and transaction of Anycast nodes so it accomplishes the load balance. This paper deeply analyzes and discusses the feasibility and validity of this communication model, and argues that it supports the large-scale Anycast group.
一种解决IPv6可扩展性的任播通信模型
现有的任播服务设计要么将每个任播组限制在一个预先配置的拓扑区域内,要么将路由全局分布到各个任播组,导致路由表的增长与整个互联网中所有全局任播组的数量成比例,这两者都限制和阻碍了任播服务的应用和发展。本文提出了一种基于任播树的新型任播通信模型。由于该模型实现了动态的任意cast组,并且允许任意cast成员自由离开和加入任意cast组,从根本上解决了现有的可扩展性问题。此外,该模型还实现了Anycast节点的分布式维护和事务处理,从而实现了负载均衡。本文对该通信模型的可行性和有效性进行了深入的分析和讨论,并论证了该通信模型支持大规模任播组。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信