{"id":6131,"date":"2018-11-12T08:04:17","date_gmt":"2018-11-12T00:04:17","guid":{"rendered":"https:\/\/www.icnalb.cn\/?p=6131"},"modified":"2018-12-06T12:55:50","modified_gmt":"2018-12-06T04:55:50","slug":"%e8%bf%91%e5%b9%b4%e6%9d%a5%e5%86%85%e5%ae%b9%e4%b8%ad%e5%bf%83%e7%bd%91%e7%bb%9c%e4%b8%8e%e5%8c%ba%e5%9d%97%e9%93%be%e9%87%8d%e7%82%b9%e5%ae%9e%e9%aa%8c%e5%ae%a4%e4%bc%98%e7%a7%80%e6%96%87%e7%ab%a0","status":"publish","type":"post","link":"https:\/\/www.icnlab.cn\/?p=6131","title":{"rendered":"\u8fd1\u5e74\u6765\u5185\u5bb9\u4e2d\u5fc3\u7f51\u7edc\u4e0e\u533a\u5757\u94fe\u91cd\u70b9\u5b9e\u9a8c\u5ba4\u4f18\u79c0\u6587\u7ae0\u6982\u89c8\uff08\u4e8c\uff09"},"content":{"rendered":"<h2>\u5b9e\u9a8c\u5ba4\u7ecf\u8fc7\u8fd9\u51e0\u5e74\u7684\u79ef\u7d2f\uff0c\u53d1\u8868\u4e86\u4e0d\u5c11\u4f18\u79c0\u7684\u6587\u7ae0\uff0c\u73b0\u5728\u5728\u8fd9\u505a\u4e00\u4e2a\u5c55\u793a\u6982\u8981\uff0c\u5305\u62ec\u6587\u7ae0\u7684\u7b80\u4ecb\uff0cpdf\u94fe\u63a5\u4ee5\u53ca\u90e8\u5206\u6587\u7ae0\u7684\u5f00\u6e90\u4ee3\u7801github\u94fe\u63a5\u3002<\/h2>\n<h3><strong>IEEE Transactions on Industrial Informatics ( Volume: 14 , Issue: 6 , June 2018 )<\/strong><\/h3>\n<ul>\n<li>An NDN IoT Content Distribution Model With Network Coding Enhanced Forwarding Strategy for 5G<\/li>\n<li>\u6587\u7ae0\u94fe\u63a5\uff1a<a href=\"https:\/\/ieeexplore.ieee.org\/document\/8170270\">https:\/\/ieeexplore.ieee.org\/document\/8170270<\/a><\/li>\n<li>\u4f5c\u8005\uff1aKai Lei\uff0cShangru Zhong \uff0cFangxing Zhu\uff0cKuai Xu\uff0cHaijun Zhang<\/li>\n<\/ul>\n<p>\u7b80\u4ecb\uff1a\u7b2c\u4e94\u4ee3\uff085G\uff09\u7269\u8054\u7f51\uff08IoT\uff09\u5e94\u7528\u7684\u6311\u6218\u6027\u8981\u6c42\u6fc0\u53d1\u4e86\u5bf9\u53ef\u884c\u7f51\u7edc\u67b6\u6784\u7684\u671f\u671b\u9700\u6c42\uff0c\u800c\u547d\u540d\u6570\u636e\u7f51\u7edc\uff08NDN\uff09\u662f\u652f\u6301\u9ad8\u5bc6\u5ea6\u7269\u8054\u7f51\u5e94\u7528\u7684\u5408\u9002\u5019\u9009\u8005\u3002\u4e3a\u4e86\u5728\u5927\u89c4\u6a21\u7269\u8054\u7f51\u5e94\u7528\u4e2d\u6709\u6548\u5730\u5206\u53d1\u8d8a\u6765\u8d8a\u591a\u7684\u6570\u636e\uff0c\u672c\u6587\u5c06\u7f51\u7edc\u7f16\u7801\u6280\u672f\u5e94\u7528\u5230NDN\u4e2d\uff0c\u4ee5\u63d0\u200b\u200b\u9ad8\u7269\u8054\u7f51\u7f51\u7edc\u541e\u5410\u91cf\u548c5G\u5185\u5bb9\u4f20\u8f93\u6548\u7387\u3002\u57fa\u4e8e\u6982\u7387\u7684\u591a\u5f84\u8f6c\u53d1\u7b56\u7565\u88ab\u8bbe\u8ba1\u7528\u4e8e\u7f51\u7edc\u7f16\u7801\u4ee5\u5145\u5206\u5229\u7528\u5176\u6f5c\u529b\u3002\u4e3a\u4e86\u91cf\u5316\u57285G NDN\u4e2d\u5e94\u7528\u7f51\u7edc\u7f16\u7801\u7684\u6027\u80fd\u4f18\u52bf\uff0c\u672c\u6587\u5c06\u7f51\u7edc\u7f16\u7801\u96c6\u6210\u5230ndnSIM\u6a21\u62df\u5668\u4e2d\u5b9e\u73b0\u7684NDN\u6d41\u5a92\u4f53\u7cfb\u7edf\u4e2d\u3002\u5b9e\u9a8c\u7ed3\u679c\u6e05\u695a\u800c\u516c\u6b63\u5730\u8868\u660e\uff0c\u8003\u86515G NDN\u4e2d\u7684\u7f51\u7edc\u7f16\u7801\u53ef\u4ee5\u663e\u7740\u63d0\u9ad8\u6027\u80fd\uff0c\u53ef\u9760\u6027\u548cQoS\u3002\u6b64\u5916\uff0c\u8fd9\u662f\u4e00\u822c\u89e3\u51b3\u65b9\u6848\uff0c\u56e0\u4e3a\u5b83\u9002\u7528\u4e8e\u5927\u591a\u6570\u7f13\u5b58\u65b9\u6cd5\u3002\u66f4\u91cd\u8981\u7684\u662f\uff0c\u6211\u4eec\u7684\u65b9\u6cd5\u5728\u63d0\u4f9b\u5305\u62ec\u9ad8\u8d28\u91cf\u6d41\u89c6\u9891\u670d\u52a1\u5728\u5185\u7684\u4e0d\u65ad\u589e\u957f\u7684\u7269\u8054\u7f51\u5e94\u7528\u65b9\u9762\u5177\u6709\u5de8\u5927\u7684\u6f5c\u529b\u3002<\/p>\n<p>Abstract:<\/p>\n<p>The challenging requirements of fifth-generation (5G) Internet-of-Things (IoT) applications have motivated a desired need for feasible network architecture, while Named Data Networking (NDN) is a suitable candidate to support the high density IoT applications. To effectively distribute increasingly large volumes of data in large-scale IoT applications, this paper applies network coding techniques into NDN to improve IoT network throughput and efficiency of content delivery for 5G. A probability-based multipath forwarding strategy is designed for network coding to make full use of its potential. To quantify performance benefits of applying network coding in 5G NDN, this paper integrates network coding into a NDN streaming media system implemented in the ndnSIM simulator. The experimental results clearly and fairly demonstrate that considering network coding in 5G NDN can significantly improve the performance, reliability, and QoS. Besides, this is a general solution as it is applicable for most cache approaches. More importantly, our approach has promising potentials in delivering growing IoT applications including high-quality streaming video services.<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<h3>2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery<\/h3>\n<ul>\n<li>A RCP-Based Congestion Control Protocol in Named Data Networking<\/li>\n<li>\u6587\u7ae0\u94fe\u63a5\uff1a<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=2860054&amp;preflayout=flat\">https:\/\/dl.acm.org\/citation.cfm?id=2860054&amp;preflayout=flat<\/a><\/li>\n<li>\u4f5c\u8005\uff1a\u00a0\u00a0 Kai Lei\uff0cChaojun Hou\uff0cLihua Li\uff0cKuai Xu<\/li>\n<\/ul>\n<p>\u7b80\u4ecb\uff1a\u968f\u7740\u547d\u540d\u6570\u636e\u7f51\u7edc\uff08NDN\uff09\u7684\u4e0d\u65ad\u589e\u957f\u7684\u5e94\u7528\u4e0d\u65ad\u589e\u52a0\u5bf9\u7f51\u7edc\u5e26\u5bbd\u7684\u9700\u6c42\uff0c\u5f00\u53d1\u6709\u6548\u7684\u62e5\u585e\u673a\u5236\u5df2\u6210\u4e3aNDN\u67b6\u6784\u7684\u9ad8\u4f18\u5148\u7ea7\u7814\u7a76\u4efb\u52a1\u4e4b\u4e00\u3002\u672c\u6587\u63a2\u8ba8\u4e86\u901f\u7387\u63a7\u5236\u534f\u8bae\uff08RCP\uff09\uff0c\u8fd9\u662fNDN\u8def\u7531\u4e2d\u552f\u4e00\u7684\u9010\u8df3\u7279\u6027\uff0c\u4ee5\u53ca\u5174\u8da3\u8bf7\u6c42\u548c\u6570\u636e\u5305\u4e4b\u95f4\u7684\u4e00\u5bf9\u4e00\u5173\u7cfb\uff0c\u4e3aNDN\u5f00\u53d1\u4e86\u4e00\u79cd\u65b0\u7684\u62e5\u585e\u63a7\u5236\u673a\u5236\u3002\u5177\u4f53\u6765\u8bf4\uff0c\u6211\u4eec\u8bbe\u8ba1\u5e76\u5b9e\u73b0\u4e86\u57fa\u4e8e\u901f\u7387\uff0c\u663e\u5f0f\u548c\u9010\u8df3\u7684\u62e5\u585e\u63a7\u5236\u7b97\u6cd5\uff0c\u5373NDN Hop-by-Hop RCP\uff0c\u5373NHBH-RCP\uff0c\u4ee5\u5b9e\u73b0\u9ad8\u94fe\u8def\u5229\u7528\u7387\u5e76\u63d0\u9ad8\u6574\u4f53\u7f51\u7edc\u541e\u5410\u91cf\u3002\u6b64\u5916\uff0c\u6211\u4eec\u901a\u8fc7\u5404\u79cd\u5b9e\u9a8c\u6bd4\u8f83\u4e86NDN\u4e2d\u7684\u6734\u7d20\u62e5\u585e\u63a7\u5236\u7b97\u6cd5\u548cNHBH-RCP\uff0c\u53d1\u73b0\u6211\u4eec\u63d0\u51fa\u7684\u7b97\u6cd5\u663e\u7740\u63d0\u9ad8\u4e86NDN\u4e2d\u6570\u636e\u4f20\u8f93\u7684\u6027\u80fd\uff0c\u51cf\u5c11\u4e86\u6d88\u8d39\u8005\u548c\u751f\u4ea7\u8005\u4e4b\u95f4\u7684\u6d41\u5b8c\u6210\u65f6\u95f4\u3002<\/p>\n<p>Abstract<\/p>\n<p>As the rising applications of Named Data Networking (NDN) continue to increase the demand on network bandwidth, developing effective congestion mechanisms has become one of the high-priority research tasks for NDN architecture. This paper explores rate control protocol (RCP), a unique hop-by-hop feature in NDN routing, and one-to-one relationship between interest requests and data packets to develop a novel congestion control mechanism for NDN. Specifically, we have designed and implemented a rate-based, explicit and hop-by-hop congestion control algorithm, NDN Hop-by-Hop RCP, namely NHBH-RCP, to achieve high link utilization and increase overall network throughput. In addition, we compare the naive congestion control algorithm in NDN with NHBH-RCP via various experiments and find that our proposed algorithm significantly enhances the performance of data transfer in NDN and reduces flow-completion time between consumers and producers.<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<h3>2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)<\/h3>\n<ul>\n<li>An encryption and probability based access control model for named data networking<\/li>\n<li>\u6587\u7ae0\u94fe\u63a5\uff1a<a href=\"https:\/\/ieeexplore.ieee.org\/document\/7017100\">https:\/\/ieeexplore.ieee.org\/document\/7017100<\/a><\/li>\n<li>\u4f5c\u8005\uff1aTao Chen ; Kai Lei ; Kuai Xu<\/li>\n<\/ul>\n<p>\u7b80\u4ecb\uff1a\u65b0\u7684\u547d\u540d\u6570\u636e\u7f51\u7edc\uff08NDN\uff09\u5df2\u7ecf\u5c06\u4e92\u8054\u7f51\u4ece\u4eca\u5929\u7684\u57fa\u4e8eIP\u7684\u6570\u636e\u5305\u4f20\u8f93\u6a21\u578b\u8f6c\u79fb\u5230\u57fa\u4e8e\u540d\u79f0\u7684\u6570\u636e\u68c0\u7d22\u6a21\u578b\u3002\u4f53\u7cfb\u7ed3\u6784\u4eceIP\u5730\u5740\u8f6c\u79fb\u5230\u547d\u540d\u6570\u636e\uff0c\u4ece\u800c\u901a\u8fc7\u7f51\u7edc\u5185\u7f13\u5b58\u548c\u76f4\u63a5\u5bf9\u8c61\u68c0\u7d22\u5b9e\u73b0\u6709\u6548\u7684\u5185\u5bb9\u4ea4\u4ed8\u3002\u7136\u800c\uff0c\u7531\u4e8e\u5e7f\u6cdb\u7684\u6570\u636e\u590d\u5236\u548c\u7f51\u7edc\u5468\u8fb9\u7684\u4e22\u5931\uff0c\u8fd9\u79cd\u8f6c\u53d8\u4e5f\u4e3a\u4fdd\u62a4\u6570\u636e\u5bf9\u8c61\u548c\u5bf9\u547d\u540d\u6570\u636e\u63d0\u4f9b\u9002\u5f53\u7684\u8bbf\u95ee\u63a7\u5236\u5e26\u6765\u4e86\u6311\u6218\u548c\u969c\u788d\u3002\u672c\u6587\u4ee5\u89c6\u9891\u6d41\u670d\u52a1\u4e3a\u6848\u4f8b\u7814\u7a76\uff0c\u4e3aNDN\u8bbe\u8ba1\uff0c\u5b9e\u73b0\u548c\u8bc4\u4f30\u57fa\u4e8e\u52a0\u5bc6\u548c\u6982\u7387\u7684\u8bbf\u95ee\u63a7\u5236\u6a21\u578b\u3002\u7279\u522b\u662f\uff0c\u6211\u4eec\u63a2\u7d22\u4e86\u516c\u94a5\u52a0\u5bc6\u548c\u5bf9\u79f0\u5bc6\u7801\u7684\u7ec4\u5408\u6765\u52a0\u5bc6\u89c6\u9891\u6570\u636e\uff0c\u4ee5\u9632\u6b62\u672a\u7ecf\u6388\u6743\u7684\u8bbf\u95ee\u3002\u6b64\u5916\uff0c\u6211\u4eec\u6784\u5efa\u4e86\u4e00\u4e2abloom-filter\u6982\u7387\u6570\u636e\u7ed3\u6784\uff0c\u7528\u4e8e\u9884\u5148\u8fc7\u6ee4\u6765\u81ea\u6d88\u8d39\u8005\u7684\u5174\u8da3\uff0c\u800c\u65e0\u9700\u6240\u9700\u7684\u51ed\u636e\u3002\u6211\u4eec\u7684\u5b9e\u9a8c\u7ed3\u679c\u8bc1\u660e\u4e86\u6240\u63d0\u51fa\u7684\u6a21\u578b\u63d0\u4f9b\u8bbf\u95ee\u63a7\u5236\u7684\u80fd\u529b\uff0c\u540c\u65f6\u7ed9\u751f\u4ea7\u8005\u548c\u6d88\u8d39\u8005\u5e26\u6765\u4e86\u4f4e\u7cfb\u7edf\u548c\u6027\u80fd\u5f00\u9500\u3002<\/p>\n<p>Abstract<\/p>\n<p>The new named data networking (NDN) has shifted the Internet from today&#8217;s IP-based packet-delivery model to the name-based data retrieval model. The architecture shift from IP addresses to named data results in effective content delivery via in-networking cache and direct object retrieval. However, this shift has also created challenges and obstacles for securing data objects and providing appropriate access control on named data due to broad data replications and the loss of network perimeters. This paper designs, implements, and evaluates an encryption and probability based access control model for NDN with video streaming service as a case study. In particularly, we explore a combination of public-key cryptography and symmetric ciphers to encrypt video data for preventing unauthorized access. In addition, we build a bloom-filter probabilistic data structure for pre-filtering Interests from consumers without desired credentials. Our experimental results have demonstrated the capabilities of the proposed model for providing access control while incurring low system and performance overhead on producers and consumers.<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<h3>2015 IEEE International Conference on Communications (ICC)<\/h3>\n<ul>\n<li>An entropy-based probabilistic forwarding strategy in Named Data Networking<\/li>\n<li>\u6587\u7ae0\u94fe\u63a5\uff1a<a href=\"https:\/\/ieeexplore.ieee.org\/abstract\/document\/7249225\">https:\/\/ieeexplore.ieee.org\/abstract\/document\/7249225<\/a><\/li>\n<li>\u4f5c\u8005\uff1aKai Lei ; Jiawei Wang ; Jie Yuan<\/li>\n<\/ul>\n<p>\u7b80\u4ecb\uff1a<\/p>\n<p>\u8f6c\u53d1\u7b56\u7565\u662f\u547d\u540d\u6570\u636e\u7f51\u7edc\uff08NDN\uff09\u7684\u5f39\u6027\u548c\u6548\u7387\u7684\u5173\u952e\uff0cNDN\u662f\u4e00\u4e2a\u65b0\u7684\u57fa\u7840\u7814\u7a76\u9886\u57df\u3002\u5bf9\u4e8e\u8f6c\u53d1\u7b56\u7565\uff0c\u4ece\u591a\u4e2a\u5907\u9009\u63a5\u53e3\u52a8\u6001\u9009\u62e9\u6700\u4f73\u63a5\u53e3\u4ee5\u8f6c\u53d1\u5174\u8da3\u5305\u786e\u5b9e\u662f\u591a\u5c5e\u6027\u51b3\u7b56\uff08MADM\uff09\u95ee\u9898\u3002\u672c\u6587\u63d0\u51fa\u4e86\u4e00\u79cd\u57fa\u4e8e\u71b5\u7684\u6982\u7387\u8f6c\u53d1\uff08EPF\uff09\u7b56\u7565\uff0c\u57fa\u4e8e\u63a5\u53e3\u7684\u52a8\u6001\u53ef\u7528\u6027\u548c\u9759\u6001\u8def\u7531\u4fe1\u606f\u7684\u7ec4\u5408\uff0c\u8fdb\u884c\u968f\u673a\u63a5\u53e3\u9009\u62e9\uff0c\u4e0e\u786e\u5b9a\u6027\u63a5\u53e3\u9009\u62e9\u76f8\u6bd4\uff0c\u5b9e\u73b0\u4e86\u66f4\u597d\u7684\u8d1f\u8f7d\u5747\u8861\u3002\u901a\u8fc7\u5ba2\u89c2\u5730\u4e3a\u5c5e\u6027\u5206\u914d\u6743\u91cd\u5e76\u8003\u8651\u591a\u4e2a\u5b9e\u65f6\u7f51\u7edc\u6761\u4ef6\u5ea6\u91cf\uff0cEPF\u53ef\u4ee5\u66f4\u51c6\u786e\uff0c\u66f4\u5168\u9762\u5730\u83b7\u5f97\u63a5\u53e3\u7684\u53ef\u7528\u6027\u3002\u7531\u4e8e\u53ef\u4ee5\u8f7b\u677e\u6dfb\u52a0\u5176\u4ed6\u7f51\u7edc\u6307\u6807\u5e76\u5c06\u5176\u96c6\u6210\u5230\u754c\u9762\u7684\u8bc4\u4f30\u6a21\u578b\u4e2d\uff0c\u56e0\u6b64EPF\u63d0\u4f9b\u4e86\u826f\u597d\u7684\u53ef\u6269\u5c55\u6027\u3002\u6b64\u5916\uff0c\u6211\u4eec\u521b\u65b0\u5730\u5b9a\u4e49\u4e86\u4e24\u4e2a\u53c2\u6570\uff08\u03b3\uff0c\u03b4\uff09\uff0c\u53ef\u7528\u4e8e\u6743\u8861\u9759\u6001\u8def\u7531\u4fe1\u606f\u548c\u63a5\u53e3\u52a8\u6001\u8fd0\u884c\u72b6\u6001\u4e4b\u95f4\u7684\u5f71\u54cd\u56e0\u7d20\uff0c\u4e3a\u4e0d\u540c\u7684\u7f51\u7edc\u548c\u5e94\u7528\u573a\u666f\u5b9a\u5236EPF\u7b56\u7565\u3002\u5b9e\u9a8c\u8868\u660e\uff0c\u4e0e\u4ee3\u8868\u6027\u7684BestRoute\u8f6c\u53d1\u7b56\u7565\u76f8\u6bd4\uff0cEPF\u53ef\u4ee5\u5b9e\u73b0\u66f4\u597d\u7684\u8d1f\u8f7d\u5e73\u8861\u5e76\u5b9e\u73b0\u66f4\u9ad8\u7684\u541e\u5410\u91cf\u3002<\/p>\n<p>Abstract<\/p>\n<p>The forwarding strategy is the key to the resiliency and efficiency of Named Data Networking (NDN), which is a new and fundamental research area. For forwarding strategy, dynamically selecting an optimal interface from multiple alternative interfaces to forward an Interest packet is indeed a multiple attribute decision making (MADM) problem. In this paper, an entropy-based probabilistic forwarding (EPF) strategy is proposed to make a stochastic interface selection based on the combination of interfaces&#8217; dynamic availabilities and static routing information, which achieves better load balance in comparison with deterministic interface selection. By objectively assigning weights to attributes and considering multiple real-time network condition metrics, EPF can obtain the availabilities of interfaces more accurately and comprehensively. Since additional network metrics can be easily added and integrated into interfaces&#8217; assessment model, EPF provides good extensibility. In addition, we innovatively define two parameters (\u03b3, \u03b4) which can be used to trade off the effect factors between static routing information and dynamic running status of interfaces to customize EPF strategy for different network and application scenarios. Experiments show that EPF can realize preferable load balance and achieve higher throughput compared to the representative BestRoute forwarding strategy\u3002<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<h3>2017 Ninth International Conference on Ubiquitous and Future Networks (ICUFN)<\/h3>\n<ul>\n<li>BlockNDN: A bitcoin blockchain decentralized system over named data networking<\/li>\n<li>\u6587\u7ae0\u94fe\u63a5\uff1a<a href=\"https:\/\/ieeexplore.ieee.org\/document\/7993751\">https:\/\/ieeexplore.ieee.org\/document\/7993751<\/a><\/li>\n<li>\u4f5c\u8005\uff1aTong Jin ; Xiang Zhang ; Yirui Liu ; Kai Lei<\/li>\n<\/ul>\n<p>\u7b80\u4ecb\uff1aBlockchain\u4e3a\u53c2\u4e0e\u8005\u63d0\u4f9b\u4e86\u4e00\u79cd\u65b0\u65b9\u6cd5\uff0c\u53ef\u4ee5\u5728\u4e0d\u53d7\u4fe1\u4efb\u7684\u7f51\u7edc\u4e2d\u7ef4\u62a4\u53ef\u9760\u7684\u6570\u636e\u5e93\uff0c\u800c\u65e0\u9700\u96c6\u4e2d\u7ba1\u7406\u3002\u7136\u800c\uff0c\u5728IP\u7f51\u7edc\u4e2d\u7684\u5b9e\u9645\u533a\u5757\u94fe\u7cfb\u7edf\u4e2d\u4ecd\u5b58\u5728\u8bb8\u591a\u4e25\u91cd\u95ee\u9898\uff0c\u4f8b\u5982\u7f3a\u4e4f\u5bf9\u591a\u64ad\u7684\u652f\u6301\u548c\u72b6\u6001\u7684\u5c42\u6b21\u7ed3\u6784\u3002\u5728\u672c\u6587\u4e2d\uff0c\u6211\u4eec\u8bbe\u8ba1\u4e86\u4e00\u4e2a\u7c7b\u4f3c\u6bd4\u7279\u5e01\u7684\u533a\u5757\u94fe\u7cfb\u7edf\uff0c\u540d\u4e3aBlockNDN over Named Data Networking\uff0c\u6211\u4eec\u4e5f\u5728\u6211\u4eec\u7684\u96c6\u7fa4\u4e0a\u5b9e\u73b0\u548c\u90e8\u7f72\u5b83\u3002\u7531\u6b64\u4ea7\u751f\u7684\u8bbe\u8ba1\u89e3\u51b3\u4e86IP\u7f51\u7edc\u4e2d\u7684\u90a3\u4e9b\u95ee\u9898\u3002\u5b83\u63d0\u4f9b\u5b8c\u5168\u5206\u6563\u7684\u7cfb\u7edf\u5e76\u7b80\u5316\u7cfb\u7edf\u67b6\u6784\u3002\u5b83\u8fd8\u6539\u5584\u4e86\u5f31\u8fde\u63a5\u73b0\u8c61\u5e76\u51cf\u5c11\u4e86\u5e7f\u64ad\u5f00\u9500\u3002<\/p>\n<p>Abstract:<\/p>\n<p>Blockchain provides a new approach for participants to maintain reliable databases in untrusted networks without centralized authorities. However, there are still many serious problems in real blockchain systems in IP network such as the lack of support for multicast and the hierarchies of status. In this paper, we design a bitcoin-like blockchain system named BlockNDN over Named Data Networking and we implement and deploy it on our cluster as well. The resulting design solves those problems in IP network. It provides completely decentralized systems and simplifies system architecture. It also improves the weak-connectivity phenomenon and decreases the broadcast overhead.<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<h3>2016 IEEE Trustcom\/BigDataSE\/ISPA<\/h3>\n<ul>\n<li>Intelligent forwarding strategy based on online machine learning in named data networking<\/li>\n<li>\u6587\u7ae0\u94fe\u63a5\uff1a<a href=\"https:\/\/ieeexplore.ieee.org\/document\/7847089\">https:\/\/ieeexplore.ieee.org\/document\/7847089<\/a><\/li>\n<li>\u4f5c\u8005\uff1aLirui Gong ; Jiawei Wang ; Xiang Zhang ; Kai Lei<\/li>\n<\/ul>\n<p>\u7b80\u4ecb\uff1a\u547d\u540d\u6570\u636e\u7f51\u7edc\uff08NDN\uff09\u7684\u9762\u5411\u5185\u5bb9\u7684\u6a21\u578b\u5141\u8bb8\u6d88\u8d39\u8005\u66f4\u591a\u5730\u5173\u6ce8\u76ee\u6807\u6570\u636e\u672c\u8eab\u800c\u4e0d\u662f\u6570\u636e\u5b58\u50a8\u4f4d\u7f6e\u3002\u4e0eIP\u4e0d\u540c\uff0cNDN\u5177\u6709\u72ec\u7279\u7684\u7279\u6027\uff0c\u5373\u8f6c\u53d1\u5e73\u9762\u4f7f\u6bcf\u4e2a\u8def\u7531\u5668\u80fd\u591f\u72ec\u7acb\u5730\u9009\u62e9\u4e0b\u4e00\u4e2a\u8f6c\u53d1\u8df3\uff0c\u800c\u4e0d\u4f9d\u8d56\u4e8e\u8def\u7531\u3002\u56e0\u6b64\uff0c\u8f6c\u53d1\u7b56\u7565\u5728NDN\u4e2d\u7684\u81ea\u9002\u5e94\u548c\u6709\u6548\u6570\u636e\u4f20\u8f93\u4e2d\u8d77\u7740\u91cd\u8981\u4f5c\u7528\u3002\u73b0\u6709\u7684\u8f6c\u53d1\u7b56\u7565\u4e0d\u591f\u667a\u80fd\uff0c\u65e0\u6cd5\u5e94\u5bf9\u7f51\u7edc\u7684\u590d\u6742\u6027\u548c\u5e94\u7528\u9700\u6c42\u7684\u591a\u6837\u6027\u3002\u672c\u6587\u63d0\u51fa\u4e86\u4e00\u79cd\u667a\u80fd\u8f6c\u53d1\u7b56\u7565\uff0c\u5b83\u5c06\u5728\u7ebf\u673a\u5668\u5b66\u4e60\u65b9\u6cd5\u96c6\u6210\u5230\u8f6c\u53d1\u8fc7\u7a0b\u4e2d\u63a5\u53e3\u6982\u7387\u7684\u4f18\u5316\u4e2d\u3002\u6700\u521d\uff0c\u63d0\u51fa\u4e86\u4e00\u79cd\u6982\u7387\u4e8c\u53c9\u6811\u7ed3\u6784\uff0c\u5c06\u8f6c\u53d1\u8fc7\u7a0b\u62bd\u8c61\u4e3a\u4ece\u6839\u8282\u70b9\u5230\u53f6\u8282\u70b9\u7684\u8def\u5f84\u9009\u62e9\u8fc7\u7a0b\uff0c\u4e3a\u673a\u5668\u5b66\u4e60\u63d0\u4f9b\u7406\u8bba\u652f\u6301\uff0c\u964d\u4f4e\u8f6c\u53d1\u8fc7\u7a0b\u7684\u590d\u6742\u5ea6\u3002\u6b64\u5916\uff0c\u6211\u4eec\u901a\u8fc7\u91c7\u7528\u6a21\u62df\u7ed3\u5408\u7684\u601d\u60f3\u6539\u8fdb\u4e86\u6211\u4eec\u7684\u7b56\u7565\uff0c\u4ee5\u9632\u6b62\u6536\u655b\u5230\u6709\u9650\u7684\u5c40\u90e8\u6700\u4f18\u89e3\u3002\u5b9e\u9a8c\u7ed3\u679c\u8868\u660e\uff0c\u4e0e\u5176\u4ed6\u73b0\u6709\u7684\u8f6c\u53d1\u7b56\u7565\u76f8\u6bd4\uff0c\u8be5\u7b56\u7565\u53ef\u4ee5\u964d\u4f4e\u65f6\u95f4\u590d\u6742\u5ea6\uff0c\u5e76\u5b9e\u73b0\u66f4\u9ad8\u7684\u541e\u5410\u91cf\uff0c\u66f4\u597d\u7684\u8d1f\u8f7d\u5e73\u8861\u548c\u66f4\u4f4e\u7684\u4e22\u5305\u7387\u3002\u4e0eBestRoute\uff08NDN\u4e2d\u5e7f\u6cdb\u4f7f\u7528\u7684\u7b56\u7565\uff09\u76f8\u6bd4\uff0c\u5728\u4e0d\u540c\u60c5\u51b5\u4e0b\uff0c\u4e22\u5f03\u7387\u5206\u522b\u964d\u4f4e\u4e8660\uff05\u548c34\uff05\u3002<\/p>\n<p>Abstract:<\/p>\n<p>The content-oriented model of Named Data Networking (NDN) allows consumers to pay more attention to the targeting data itself instead of the location of where the data is stored. Different from IP, NDN has a unique feature that forwarding plane enables each router to select the next forwarding hop independently without relying on routing. Therefore, forwarding strategies play a significant role for adaptive and efficient data transmission in NDN. Existing forwarding strategies are not smart enough to cope with the complexity of network and diversity of application demands. This paper presents an intelligent forwarding strategy, which integrates online machine learning method into the optimization of interface probabilities during forwarding process. Originally, a probabilistic binary tree structure is proposed to abstract the forwarding process as a path selection process traversing from the root node to the leaf node, which provides theoretical support for machine learning and reduces the complexity of forwarding process. In addition, we improved our strategy to prevent the convergence into limited local optimal solution by adopting the idea of simulated an nealing. Experimental results show that the proposed strategy can reduce time complexity, as well as achieve higher throughput, better load balance and lower packet drop rates in comparison with other existing forwarding strategies. The drop rates are reduced by 60% and 34% respectively in different scenarios compared with BestRoute, a strategy widely used in NDN.<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<h3>2015 IEEE Global Communications Conference (GLOBECOM)<\/h3>\n<ul>\n<li>MDPF: An NDN Probabilistic Forwarding Strategy Based on Maximizing Deviation Method<\/li>\n<li>\u6587\u7ae0\u94fe\u63a5\uff1a<a href=\"https:\/\/ieeexplore.ieee.org\/document\/7417024?arnumber=7417024\">https:\/\/ieeexplore.ieee.org\/document\/7417024?arnumber=7417024<\/a><\/li>\n<li>\u4f5c\u8005\uff1a<a>Kai Lei\u00a0<\/a>;\u00a0<a>Jie Yuan\u00a0<\/a>;\u00a0<a>Jiawei Wang<\/a><\/li>\n<\/ul>\n<p>\u7b80\u4ecb\uff1a\u8f6c\u53d1\u7b56\u7565\u662f\u547d\u540d\u6570\u636e\u7f51\u7edc\uff08NDN\uff09\u5b9e\u73b0\u52a8\u6001\uff0c\u81ea\u9002\u5e94\u548c\u667a\u80fd\u8f6c\u53d1\u7684\u5173\u952e\u7279\u6027\uff0c\u4f46\u8be5\u9886\u57df\u7684\u5de5\u4f5c\u4ecd\u5904\u4e8e\u521d\u7ea7\u9636\u6bb5\u3002\u5728\u672c\u6587\u4e2d\uff0c\u9009\u62e9NDN\u4e2d\u591a\u4e2a\u5907\u9009\u65b9\u6848\u4e2d\u7684\u54ea\u4e2a\u8f6c\u53d1\u63a5\u53e3\u88ab\u5b9a\u4e49\u4e3a\u591a\u5c5e\u6027\u51b3\u7b56\uff08MADM\uff09\u95ee\u9898\u548c\u57fa\u4e8e\u6700\u5927\u5316\u504f\u5dee\u7684\u6982\u7387\u8f6c\u53d1\uff08MDPF\uff09\u7b56\u7565\uff0c\u4ee5\u9009\u62e9\u6982\u7387\u8f6c\u53d1\u63a5\u53e3\u3002\u7531\u4e8e\u591a\u4e2a\u7f51\u7edc\u6307\u6807\uff08\u5982\u63a5\u53e3\u72b6\u6001\uff0c\u5f85\u5904\u7406\u7684\u5174\u8da3\u7f16\u53f7\uff09\u88ab\u4e00\u8d77\u8003\u8651\uff0c\u56e0\u6b64\u53ef\u4ee5\u66f4\u51c6\u786e\u5730\u83b7\u5f97\u6bcf\u4e2a\u66ff\u4ee3\u63a5\u53e3\u7684\u53ef\u7528\u6027\u3002\u56e0\u6b64\uff0c\u53ef\u4ee5\u5b9e\u73b0\u66f4\u597d\u7684\u5185\u5bb9\u4f20\u9012\u6548\u7387\u3002\u6b64\u5916\uff0cMDPF\u63d0\u4f9b\u4e86\u826f\u597d\u7684\u53ef\u6269\u5c55\u6027\uff0c\u56e0\u4e3a\u53ef\u4ee5\u6dfb\u52a0\u4efb\u4f55\u9002\u5f53\u7684\u5ea6\u91cf\u6765\u589e\u5f3a\u6216\u81ea\u5b9a\u4e49\u5b83\u3002\u6211\u4eec\u5728ndnSIM\u4e2d\u5b9e\u65bd\u8be5\u63d0\u6848\uff0c\u5e76\u5c06\u5176\u4e0e\u5404\u79cd\u62d3\u6251\u548c\u65b9\u6848\u4e0b\u7684BestRoute\u548c\u57fa\u4e8ePI\u7684\u7b56\u7565\u8fdb\u884c\u6bd4\u8f83\u3002\u5b9e\u9a8c\u7ed3\u679c\u8868\u660e\uff0cMDPF\u7b56\u7565\u5bf9\u7f51\u7edc\u53d8\u5316\u54cd\u5e94\u66f4\u5feb\uff0c\u66f4\u654f\u611f\uff0c\u53ef\u4ee5\u5b9e\u73b0\u66f4\u9ad8\u7684\u541e\u5410\u91cf\uff0c\u66f4\u4f4e\u7684\u4e22\u5f03\u7387\u4ee5\u53ca\u66f4\u597d\u7684\u8d1f\u8f7d\u5747\u8861\u3002<\/p>\n<p>Abstract:<\/p>\n<p>Forwarding strategy is the key feature of Named Data Networking (NDN) to realize dynamic, adaptive and intelligent forwarding, but work in this area is still at a very preliminary stage. In this paper, selecting which forwarding interface among multiple alternatives in NDN is defined as a multiple attribute decision making (MADM) problem and a maximizing deviation based probabilistic forwarding (MDPF) strategy is proposed to select forwarding interface on probability. Since multiple network metrics such as interface status, pending Interest numbers are considered together, each alternative interface&#8217;s availability is obtained more accurately. Thus, better content delivery efficiency can be achieved. In addition, MDPF provides good extensibility, as any appropriate metric can be added to enhance or customize it. We implement the proposal in ndnSIM and compare it with BestRoute and PI-based strategies under various topologies and scenarios. Experimental results show that MDPF strategy is more responsive and sensitive to network changes, and can realize higher throughput, lower drop rate as well as better load balance.<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<h3>ACM-ICN 2014<\/h3>\n<ul>\n<li>Scalable control panel for media streaming in NDN<\/li>\n<li>\u6587\u7ae0\u94fe\u63a5\uff1a<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=2660129.2660138&amp;coll=DL&amp;dl=GUIDE&amp;preflayout=flat\">https:\/\/dl.acm.org\/citation.cfm?id=2660129.2660138&amp;coll=DL&amp;dl=GUIDE&amp;preflayout=flat<\/a><\/li>\n<li>\u4f5c\u8005\uff1aKai Lei, LongYu Yu\uff0cJun Wei<\/li>\n<\/ul>\n<p>\u7b80\u4ecb\uff1a\u672c\u6587\u8bbe\u8ba1\u5e76\u5b9e\u73b0\u4e86\u4e00\u4e2a\u57fa\u4e8eNDN\u7684\u5a92\u4f53\u6d41\u7cfb\u7edf\u53ef\u6269\u5c55\u63a7\u5236\u9762\u677f\u3002\u8be5\u7cfb\u7edf\u662f\u57fa\u4e8e\u5148\u524d\u57fa\u4e8eIP\u7684P2P\u5a92\u4f53\u6d41\u7cfb\u7edfHippo [1]\u5f00\u53d1\u7684\uff0c\u8be5\u7cfb\u7edf\u5305\u542b\u4e00\u7ec4\u7528\u4e8e\u64cd\u7eb5P2P\u529f\u80fd\u7684\u63a7\u5236\u670d\u52a1\u5668\uff0c\u4f8b\u5982\u8ddf\u8e2a\u5668\u7b49\u3002\u7cfb\u7edf\u53ef\u6269\u5c55\u6027\u6210\u4e3a\u6700\u56f0\u96be\u7684\u95ee\u9898\u4e4b\u4e00\u3002 P2P\u7cfb\u7edf\u7684\u7528\u6237\u89c4\u6a21\u53d8\u5f97\u975e\u5e38\u5927\u3002\u6211\u4eec\u5229\u7528SNC [2]\u7684\u76f8\u540c\u539f\u7406\u8bbe\u8ba1\u4e86NDN-Hippo\u7684\u63a7\u5236\u5c42\u3002\u81f3\u4e8e\u5b9e\u73b0\uff0c\u6211\u4eec\u91c7\u53d6\u4e86\u4e24\u6b65\u7684\u65b9\u6cd5\uff1a\u9996\u5148\u5c06Hippo\u7684\u63a7\u5236\u5c42\u79fb\u690d\u5230\u57fa\u4e8eNDN\u7684\u7cfb\u7edf\uff0c\u7136\u540e\u518d\u79fb\u690d\u5a92\u4f53\u6d41\u91cf\u5c42\u3002\u901a\u8fc7\u5206\u79bb\u63a7\u5236\u5c42\u548c\u5a92\u4f53\u5c42\uff0c\u6211\u4eec\u7684\u6f14\u793a\u8bc1\u660e\uff0c\u4e0d\u4ec5\u53ef\u4ee5\u5728NDN\u4e2d\u5de7\u5999\u5730\u548c\u672c\u80fd\u5730\u5b9e\u73b0\u8ddf\u8e2a\u5668\u7684\u67d0\u4e9b\u7ba1\u7406\u529f\u80fd\uff0c\u800c\u4e14\u8fd8\u5927\u5927\u63d0\u9ad8\u4e86NDN\u7248\u672c\u7684Hippo\u7684\u53ef\u6269\u5c55\u6027\u3002<\/p>\n<p>ABSTRACT<\/p>\n<p>An NDN-based scalable control panel for a media streaming system was designed and implemented in this paper. The system is developed based on a previous IP-based P2P media streaming system named Hippo [1], which contains a group of control servers to manipulate P2P functionalities, such as the tracker, etc. System scalability becomes one of the most difficult problems when the user size of P2P system grows very large. We took the advantages from the same principle of SNC [2] to design the NDN-Hippo&#8217;s control layer. As for implementation, we took a two-step approach: First porting the control layer of Hippo to NDN-based system, then porting media traffic layer later. By separating control and media layers, our demo demonstrates that not only some management functions of tracker can be smartly and instinctively achieved in NDN, but also the scalability of NDN version of Hippo has been greatly improved.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u5b9e\u9a8c\u5ba4\u7ecf\u8fc7\u8fd9\u51e0\u5e74\u7684\u79ef\u7d2f\uff0c\u53d1\u8868\u4e86\u4e0d\u5c11\u4f18\u79c0\u7684\u6587\u7ae0\uff0c\u73b0\u5728\u5728\u8fd9\u505a\u4e00\u4e2a\u5c55\u793a\u6982\u8981\uff0c\u5305\u62ec\u6587\u7ae0\u7684\u7b80\u4ecb\uff0cpdf\u94fe\u63a5\u4ee5\u53ca\u90e8\u5206\u6587\u7ae0\u7684 [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[16,31,4],"tags":[],"_links":{"self":[{"href":"https:\/\/www.icnlab.cn\/index.php?rest_route=\/wp\/v2\/posts\/6131"}],"collection":[{"href":"https:\/\/www.icnlab.cn\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.icnlab.cn\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.icnlab.cn\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.icnlab.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=6131"}],"version-history":[{"count":4,"href":"https:\/\/www.icnlab.cn\/index.php?rest_route=\/wp\/v2\/posts\/6131\/revisions"}],"predecessor-version":[{"id":6135,"href":"https:\/\/www.icnlab.cn\/index.php?rest_route=\/wp\/v2\/posts\/6131\/revisions\/6135"}],"wp:attachment":[{"href":"https:\/\/www.icnlab.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=6131"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.icnlab.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=6131"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.icnlab.cn\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=6131"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}