Modeling and defense denial-of-service in content-centric networking
Feng, Tao1; J., Zhao; X., Guo; C., Liu
2016
会议名称2016 6th International Workshop on Computer Science and Engineering, WCSE 2016
会议录名称2016 6th International Workshop on Computer Science and Engineering, WCSE 2016
页码261-271
会议日期June 17, 2016 - June 19, 2016
会议地点Tokyo, Japan
出版者International Workshop on Computer Science and Engineering (WCSE)
摘要In order to solve Denial-of-service problems in Content-Centric Networking (CCN), we develop an analytical model by using queuing theory and consider several important parameters of CCN such as request rate, TTL of PIT entry, the size of CS, finally we use MATLAB to simulate the effect of these parameters on the probability of Denial-of-service and make a brief analysis. Our simulation results show that if we control rate of interest requests, as well as a reasonable set of CS size and TTL of each PIT entry according to different requirements, we could effectively mitigate the damage of Denial-of-service on CCN.
关键词Models Queueing theory Transistor transistor logic circuits Content-centric networkings Control rates Denial of Service Queuing theory
收录类别EI
语种英语
EI入藏号20163202697553
EI主题词MATLAB
来源库Compendex
分类代码721.2 Logic Elements - 921 Mathematics - 922.1 Probability Theory
文献类型会议论文
条目标识符https://ir.lut.edu.cn/handle/2XXMBERH/117222
专题经济管理学院
计算机与通信学院
作者单位1.School of Computer and Communication, Lanzhou University of Technology, Lanzhou; 730050, China;
2.School of Economics and Management, Lanzhou University of Technology, Lanzhou; 730050, China
第一作者单位兰州理工大学
推荐引用方式
GB/T 7714
Feng, Tao,J., Zhao,X., Guo,et al. Modeling and defense denial-of-service in content-centric networking[C]:International Workshop on Computer Science and Engineering (WCSE),2016:261-271.
条目包含的文件
条目无相关文件。
个性服务
查看访问统计
谷歌学术
谷歌学术中相似的文章
[Feng, Tao]的文章
[J., Zhao]的文章
[X., Guo]的文章
百度学术
百度学术中相似的文章
[Feng, Tao]的文章
[J., Zhao]的文章
[X., Guo]的文章
必应学术
必应学术中相似的文章
[Feng, Tao]的文章
[J., Zhao]的文章
[X., Guo]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。