[1]杨鹏,方水明,吕培培.播存网络中的内容广播补包机制[J].东南大学学报(自然科学版),2018,48(1):19-24.[doi:10.3969/j.issn.1001-0505.2018.01.004]
　Yang Peng,Fang Shuiming,Lü Peipei.Packet-patching mechanism for content broadcast in broadcast-storage network[J].Journal of Southeast University (Natural Science Edition),2018,48(1):19-24.[doi:10.3969/j.issn.1001-0505.2018.01.004]
点击复制

播存网络中的内容广播补包机制()
分享到：

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
48
期数:
2018年第1期
页码:
19-24
栏目:
计算机科学与工程
出版日期:
2018-01-20

文章信息/Info

Title:
Packet-patching mechanism for content broadcast in broadcast-storage network
作者:
杨鹏; 方水明; 吕培培
东南大学计算机科学与工程学院, 南京 211189; 东南大学计算机网络与信息集成教育部重点实验室, 南京 211189
Author(s):
Yang Peng1; 2;  Fang Shuiming1; 2;  Lü Peipei1; 2
School of Computer Science and Engineering, Southeast University, Nanjing 211189, China
Key Laboratory of Computer Network and Information Integration of Ministry of Education, Southeast University, Nanjing 211189, China
关键词:
播存网络;  补包机制;  内容广播;  统一内容标签;  概率模型
Keywords:
broadcast-storage network;  packet-patching mechanism;  content broadcast;  uniform content label;  probability model
分类号:
TP393
DOI:
10.3969/j.issn.1001-0505.2018.01.004
摘要:
为解决环境因素导致的播存网络中内容广播丢包错包问题,提高内容分发性能,提出了一种面向播存网络的补包机制.首先利用32位循环冗余检验方法对数据包进行检错;然后从检测到的出错内容中提取相关参数,并通过服从指数分布的补包概率模型计算补包概率,以此概率值为依据对出错内容进行筛选和优先级评估;最后利用优先级队列对出错数据包进行有序补包.分析了补包的场景、约束条件和要求,并对补包流程、算法和概率模型进行了详细叙述.实验结果表明,该补包机制能在保证数据包正确补回的基础上,充分兼顾播存网络的个性化特色和资源利用率,并能通过灵活地改变补包阈值来增强播存网络的内容广播分发性能.
Abstract:
To solve the problems of packet errors and packet losses of broadcast in the broadcast-storage network caused by environmental factors and improve the performance of the content distribution, a packet-patching mechanism for the broadcast-storage network is proposed. First, a 32-bit cyclic redundancy test is used to detect the received packets. Then, the related parameters are extracted from the detected error content, and the patching probability is calculated by the probability model which obeys the exponential distribution. Based on this probability, the error information is filtered and the priority is evaluated.Finally, a priority queue is used to patch packets accordingly. The scenario, the constraints and the requirements of packet-patching are analyzed, and the process, the algorithm and the probability model are described. The experimental results show that the packet-patching mechanism can correctly patch the loss or error packets and maintain the personalized advantage and the efficient utilization of resources of the broadcast-storage network. Besides, it can improve the distribution performance of the content broadcast in the broadcast-storage network by flexibly adjusting the packet-patching threshold.

参考文献/References:

[1] 杨鹏,李幼平.播存网络体系结构普适模型及实现模式[J].电子学报,2015,43(5):974-979. DOI:10.3969/j.issn.0372-2112.2015.05.021.
Yang Peng, Li Youping. General architecture model of broadcast-storage network and its realization patterns[J]. Acta Electronica Sinica, 2015, 43(5): 974-979. DOI:10.3969/j.issn.0372-2112.2015.05.021. (in Chinese)
[2] 杨鹏,李幼平.基于播存思想的未来互联网次结构[J].复杂系统与复杂性科学,2015,12(2):18-22,31. DOI:10.13306/j.1672-3813.2015.02.003.
Yang Peng, Li Youping. Secondary structure of future internet based on broadcast-storage concept[J]. Complex Systems and Complexity Science, 2015, 12(2): 18-22,31. DOI:10.13306/j.1672-3813.2015.02.003. (in Chinese)
[3] Cisco. Cisco visual networking index: Forecast and methodology: 2016—2021 [DB/OL]. [2017-09-15]. https://www.cisco.com/c/en/us/solutions/collateral/service-provider/visual-networking-index-vni/complete-white-paper-c11-481360.html.
[4] Xylomenos G, Ververidis C N, Siris V A, et al. A survey of information-centric networking research[J]. IEEE Communications Surveys & Tutorials, 2014, 16(2): 1024-1049. DOI:10.1109/SURV.2013.070813.00063.
[5] 孙彦斌,张宇,张宏莉.信息中心网络体系结构研究综述[J].电子学报,2016,44(8):2009-2017. DOI:10.3969/j.issn.0372-2112.2016.08.034.
Sun Yanbin, Zhang Yu, Zhang Hongli. Survey of research on information-centric networking architecture[J]. Acta Electronica Sinica, 2016, 44(8): 2009-2017. DOI:10.3969/j.issn.0372-2112.2016.08.034. (in Chinese)
[6] Nunes B A A, Mendonca M, Nguyen X N, et al. A survey of software-defined networking: Past, present, and future of programmable networks[J]. IEEE Communications Surveys & Tutorials, 2014, 16(3): 1617-1634. DOI:10.1109/surv.2014.012214.00180.
[7] 谢高岗,张玉军,李振宇,等.未来互联网体系结构研究综述[J].计算机学报,2012,35(6):1109-1119. DOI:10.3724/SP.J.1016.2012.01109.
Xie Gaogang, Zhang Yujun, Li Zhenyu, et al. A survey on future internet architecture[J]. Chinese Journal of Computers, 2012, 35(6): 1109-1119. DOI:10.3724/SP.J.1016.2012.01109. (in Chinese)
[8] 杨鹏,李幼平.二元互补未来互联网体系结构[J].复杂系统与复杂性科学,2014,11(1):53-59. DOI:10.13306/j.1672-3813.2014.01.007.
Yang Peng, Li Youping. On the complementary binary future internet architecture[J]. Complex Systems and Complexity Science, 2014, 11(1): 53-59. DOI:10.13306/j.1672-3813.2014.01.007. (in Chinese)
[9] 李幼平.共享信息的第二类网络[J].中国工程科学,2002,4(8):8-11. DOI:10.3969/j.issn.1009-1742.2002.08.002.
Li Youping. The secondary web of knowledge embodiment[J]. Engineering Science, 2002, 4(8): 8-11. DOI:10.3969/j.issn.1009-1742.2002.08.002. (in Chinese)
[10] 李幼平,杨鹏.共享文化大数据的新机制[J].中国计算机学会通讯,2013,9(5):36-40.
　　Li Youping, Yang Peng. New mechanism for sharing cultural big data[J]. China Computer Society Newsletter, 2013, 9(5): 36-40.(in Chinese)
[11] Shekatkar S M, Ambika G. Complex networks with scale-free nature and hierarchical modularity[J]. The European Physical Journal B, 2015, 88(9): 1-7. DOI:10.1140/epjb/e2015-60501-y.

备注/Memo

备注/Memo:
收稿日期: 2017-06-21.
作者简介: 杨鹏(1975—),男,博士,副教授,pengyang@seu.edu.cn.
基金项目: 国家自然科学基金资助项目(61472080,61672155)、中国工程院咨询研究资助项目(2015-XY-04).
引用本文: 杨鹏,方水明,吕培培.播存网络中的内容广播补包机制[J].东南大学学报(自然科学版),2018,48(1):19-24. DOI:10.3969/j.issn.1001-0505.2018.01.004.
更新日期/Last Update: 2018-01-20