{"title":"一种解决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":"{\"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}","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}
An Anycast Communication Model on Solving Scalability in IPv6
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.