| A time efficient algorithm based on bloom filters for longest prefix matching in IP lookups | |
| Yu M.; Wang D. | |
| 刊名 | Journal of Computers (Finland)
 |
| 2013 | |
| 卷号 | 8页码:2724-2729 |
| ISSN号 | 1796203X |
| URL标识 | 查看原文 |
| 内容类型 | 期刊论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/4640298 |
| 专题 | 大连理工大学 |
| 作者单位 | School of Information and Communication Engineering, Dalian University of Technology, Dalian, China |
| 推荐引用方式 GB/T 7714 | Yu M.,Wang D.. A time efficient algorithm based on bloom filters for longest prefix matching in IP lookups[J]. Journal of Computers (Finland),2013,8:2724-2729. |
| APA | Yu M.,&Wang D..(2013).A time efficient algorithm based on bloom filters for longest prefix matching in IP lookups.Journal of Computers (Finland),8,2724-2729. |
| MLA | Yu M.,et al."A time efficient algorithm based on bloom filters for longest prefix matching in IP lookups".Journal of Computers (Finland) 8(2013):2724-2729. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论