An Efficient Addressing Scheme for Flexible IP Address

Shi-Hai Liu, Wanming Luo, Xu Zhou, YiHao Jia, Zhe Chen, Sheng Jiang
{"title":"An Efficient Addressing Scheme for Flexible IP Address","authors":"Shi-Hai Liu, Wanming Luo, Xu Zhou, YiHao Jia, Zhe Chen, Sheng Jiang","doi":"10.1145/3483845.3483865","DOIUrl":null,"url":null,"abstract":"Along with the popularization and adoption of IP in various emerging scenarios, challenges also arise with the ossified address structures. The reason is that conventional IP address is designed with fixed length and lacking extensibility, while the demand for IP varies greatly in different scenarios. Flexible IP (FlexIP), as a variable-length IP address, proactively makes address structure flexible enough to adapt to various network cases and solves the problem of low transmission efficiency faced by current IP addresses. However, due to the variable length of FlexIP, the conventional routing addressing scheme is not suitable for it. In this paper, we propose a new Bloom filter addressing scheme suitable for FlexIP address. We use controllable prefix extension to limit the prefix distribution of FlexIP, and use one-hashing to improve the computational overhead of the Bloom filter. Simulations show that the addressing scheme we proposed is more suitable for FlexIP than other schemes, and has better query efficiency.","PeriodicalId":134636,"journal":{"name":"Proceedings of the 2021 2nd International Conference on Control, Robotics and Intelligent System","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2021 2nd International Conference on Control, Robotics and Intelligent System","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3483845.3483865","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Along with the popularization and adoption of IP in various emerging scenarios, challenges also arise with the ossified address structures. The reason is that conventional IP address is designed with fixed length and lacking extensibility, while the demand for IP varies greatly in different scenarios. Flexible IP (FlexIP), as a variable-length IP address, proactively makes address structure flexible enough to adapt to various network cases and solves the problem of low transmission efficiency faced by current IP addresses. However, due to the variable length of FlexIP, the conventional routing addressing scheme is not suitable for it. In this paper, we propose a new Bloom filter addressing scheme suitable for FlexIP address. We use controllable prefix extension to limit the prefix distribution of FlexIP, and use one-hashing to improve the computational overhead of the Bloom filter. Simulations show that the addressing scheme we proposed is more suitable for FlexIP than other schemes, and has better query efficiency.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
灵活IP地址的高效寻址方案
随着IP在各种新兴场景中的普及和采用,地址结构的僵化也带来了挑战。原因是传统的IP地址设计固定长度,缺乏可扩展性,而不同场景对IP的需求差异很大。FlexIP (Flexible IP)是一种可变长度的IP地址,它主动使地址结构具有足够的灵活性,以适应各种网络情况,解决了当前IP地址传输效率低的问题。然而,由于FlexIP的长度可变,传统的路由寻址方案不适合它。在本文中,我们提出了一种新的适用于FlexIP地址的Bloom滤波器寻址方案。我们使用可控前缀扩展来限制FlexIP的前缀分布,并使用单哈希来改善Bloom过滤器的计算开销。仿真结果表明,该寻址方案比其他寻址方案更适合FlexIP,具有更好的查询效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Improved non-autoregressive dialog state tracking model Dynamic characteristics analysis of a new variable stiffness robot joint Interactive Intention Prediction Model for Humanoid Robot Based on Visual Features A propelled multiple fusion Deep Belief Network for weld defects detection Detection of Fatigued Face
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1