As a named data-based clean-slate future Internet architecture,Content-Centric Networking(CCN)uses entirely different protocols and communication patterns from the host-to-host IP network.In CCN,communication is wholl...As a named data-based clean-slate future Internet architecture,Content-Centric Networking(CCN)uses entirely different protocols and communication patterns from the host-to-host IP network.In CCN,communication is wholly driven by the data consumer.Consumers must send Interest packets with the content name and not by the host’s network address.Its nature of in-network caching,Interest packets aggregation and hop-byhop communication poses unique challenges to provision of Internet applications,where traditional IP network no long works well.This paper presents a comprehensive survey of state-of-the-art application research activities related to CCN architecture.Our main aims in this survey are(a)to identify the advantages and drawbacks of CCN architectures for application provisioning;(b)to discuss the challenges and opportunities regarding service provisioning in CCN architectures;and(c)to further encourage deeper thinking about design principles for future Internet architectures from the perspective of upper-layer applications.展开更多
Content-centric Networking(CCN) is progressively flattering the substitutable approach to the Internet architecture through illuminating information(content) dissemination on the Internet with content forenames.The em...Content-centric Networking(CCN) is progressively flattering the substitutable approach to the Internet architecture through illuminating information(content) dissemination on the Internet with content forenames.The emergent proportion of Internet circulation has expectant adjusting Content-centric architecture to enhance serve the user prerequisites of accessing content.In recent years,one of the key aspects of CCN is ubiquitous in-network caching,which has been widely received great attention in research interest.One foremost shortcoming of in-network caching is that content producers have no awareness about where their content is put in storage.Because routers in CCN have caching capabilities,therefore,each and every content router can cache the content item in its storage capacity.This is problematic in the case in which a producer wishes to update or make the changes in its content item.In this paper,we present an approach regarding how to address this issue with a scheme called efficient content update(ECU).Our proposed ECU scheme achieves content update via trifling packets that resemble contemporary CCN communication messages with the use of additional table.We measure the performance of ECU scheme by means of simulations and make available a comprehensive exploration of its results.展开更多
There were two strategies for the data forwarding in the content-centric networking(CCN): forwarding strategy and routing strategy. Forwarding strategy only considered a separated node rather than the whole network pe...There were two strategies for the data forwarding in the content-centric networking(CCN): forwarding strategy and routing strategy. Forwarding strategy only considered a separated node rather than the whole network performance, and Interest flooding led to the network overhead and redundancy as well. As for routing strategy in CCN, each node was required to run the protocol. It was a waste of routing cost and unfit for large-scale deployment.This paper presents the super node routing strategy in CCN. Some super nodes selected from the peer nodes in CCN were used to receive the routing information from their slave nodes and compute the face-to-path to establish forwarding information base(FIB). Then FIB was sent to slave nodes to control and manage the slave nodes. The theoretical analysis showed that the super node routing strategy possessed robustness and scalability, achieved load balancing,reduced the redundancy and improved the network performance. In three topologies, three experiments were carried out to test the super node routing strategy. Network performance results showed that the proposed strategy had a shorter delay, lower CPU utilization and less redundancy compared with CCN.展开更多
On-path caching is the prominent module in Content-Centric Networking(CCN),equipped with the capability to handle the demands of future networks such as the Internet of Things(IoT)and vehicular networks.The main focus...On-path caching is the prominent module in Content-Centric Networking(CCN),equipped with the capability to handle the demands of future networks such as the Internet of Things(IoT)and vehicular networks.The main focus of the CCN caching module is data dissemination within the network.Most of the existing strategies of in-network caching in CCN store the content at the maximumnumber of routers along the downloading path.Consequently,content redundancy in the network increases significantly,whereas the cache hit ratio and network performance decrease due to the unnecessary utilization of limited cache storage.Moreover,content redundancy adversely affects the cache resources,hit ratio,latency,bandwidth utilization,and server load.We proposed an in-network caching placement strategy named Coupling Parameters to Optimize Content Placement(COCP)to address the content redundancy and associated problems.The novelty of the technique lies in its capability tominimize content redundancy by creating a balanced cache space along the routing path by considering request rate,distance,and available cache space.The proposed approach minimizes the content redundancy and content dissemination within the network by using appropriate locations while increasing the cache hit ratio and network performance.The COCP is implemented in the simulator(Icarus)to evaluate its performance in terms of the cache hit ratio,path stretch,latency,and link load.Extensive experiments have been conducted to evaluate the proposed COCP strategy.The proposed COCP technique has been compared with the existing state-of-theart techniques,namely,Leave Copy Everywhere(LCE),Leave Copy Down(LCD),ProbCache,Cache Less forMore(CL4M),and opt-Cache.The results obtained with different cache sizes and popularities show that our proposed caching strategy can achieve up to 91.46%more cache hits,19.71%reduced latency,35.43%improved path stretch and 38.14%decreased link load.These results confirm that the proposed COCP strategy has the potential capability to handle the demands of future networks such as the Internet of Things(IoT)and vehicular networks.展开更多
Accurately estimating of Retransmission TimeOut (RTO) in Content-Centric Networking (CCN) is crucial for efficient rate control in end nodes and effective interface ranking in intermediate routers. Toward this end, th...Accurately estimating of Retransmission TimeOut (RTO) in Content-Centric Networking (CCN) is crucial for efficient rate control in end nodes and effective interface ranking in intermediate routers. Toward this end, the Jacobson algorithm, which is an Exponentially Weighted Moving Average (EWMA) on the Round Trip Time (RTT) of previous packets, is a promising scheme. Assigning the lower bound to RTO, determining how an EWMA rapidly adapts to changes, and setting the multiplier of variance RTT have the most impact on the accuracy of this estimator for which several evaluations have been performed to set them in Transmission Control Protocol/Internet Protocol (TCP/IP) networks. However, the performance of this estimator in CCN has not been explored yet, despite CCN having a significant architectural difference with TCP/IP networks. In this study, two new metrics for assessing the performance of RTO estimators in CCN are defined and the performance of the Jacobson algorithm in CCN is evaluated. This evaluation is performed by varying the minimum RTO, EWMA parameters, and multiplier of variance RTT against different content popularity distribution gains. The obtained results are used to reconsider the Jacobson algorithm for accurately estimating RTO in CCN. Comparing the performance of the reconsidered Jacobson estimator with the existing solutions shows that it can estimate RTO simply and more accurately without any additional information or computation overhead.展开更多
Content-Centric Networking is a novel future network architecture that attracts increasing research interests in recent years. In-network caching has been regarded as a prominent feature of Content-Centric Networking ...Content-Centric Networking is a novel future network architecture that attracts increasing research interests in recent years. In-network caching has been regarded as a prominent feature of Content-Centric Networking since it is able to reduce the network traffic, alleviate the server bottleneck and decrease the user access latency. However, the CCN default caching scheme results in a high caching redundancy, causing an urgent need for an efficient caching scheme. To address this issue, we propose a novel implicit cooperative caching scheme to efficiently reduce the caching redundancy and improve the cache resources utilization. The simulation results show that our design achieves a higher hit ratio and a shorter cache hit distance in comparison with the other typical caching schemes.展开更多
In-network caching and Interest packets aggregation are two important features of Content-Centric Networking(CCN).CCN routers can directly respond to the Interest request by Content Store(CS)and aggregate the same Int...In-network caching and Interest packets aggregation are two important features of Content-Centric Networking(CCN).CCN routers can directly respond to the Interest request by Content Store(CS)and aggregate the same Interest packets by Pending Interest Table(PIT).In this way,most popular content requests will not reach the origin content server.Thus,content providers will be unaware of the actual usages of their contents in network.This new network paradigm presents content providers with unprecedented challenge.It will bring a great impact on existing mature business model of content providers,such as advertising revenue model based on hits amount.To leverage the advantages of CCN and the realistic business needs of content providers,we explore the hits-based content provisioning mechanism in CCN.The proposed approaches can avoid the unprecedented impact on content providers' existing business model and promote content providers to embrace the real deployment of CCN network.展开更多
车联网中,如何有效选择缓存位置和缓存内容对于提高整体网络性能至关重要。针对上述问题,引入了内容中心网络技术,提出了一种新的优化缓存策略——缓存位置和缓存内容的选择取决于车辆节点值和内容流行度(Vehicle Node Value and Conten...车联网中,如何有效选择缓存位置和缓存内容对于提高整体网络性能至关重要。针对上述问题,引入了内容中心网络技术,提出了一种新的优化缓存策略——缓存位置和缓存内容的选择取决于车辆节点值和内容流行度(Vehicle Node Value and Content Popularity,VNVCP)。首先,定义了连通性、中间中心性和特征向量中心性3个车辆节点属性用来评估车辆节点的值,具有不同值的车辆节点缓存具有不同流行度的内容,内容的重要性由其受欢迎程度决定。其次,该策略利用不同类型内容受欢迎程度的差异确保缓存内容分布均匀,同时评估来自多个属性的车辆节点的值以提高车辆节点利用率。仿真结果表明,VNVCP在缓存命中率、平均跳数和传输延迟方面明显优于传统的LCE(Leave Copy Every where)、Prob(0.5)和MPC(Most Popular Content)。展开更多
缓存是命名数据网络(named data networking,NDN)有别于传统网络最突出的特性之一,NDN中默认所有节点都具有缓存所有经过数据的功能.这种"处处缓存"策略导致网内大量冗余数据的产生,使网内缓存被严重浪费.针对上述问题,首次...缓存是命名数据网络(named data networking,NDN)有别于传统网络最突出的特性之一,NDN中默认所有节点都具有缓存所有经过数据的功能.这种"处处缓存"策略导致网内大量冗余数据的产生,使网内缓存被严重浪费.针对上述问题,首次提出了一种基于节点分类(based on node classification,BNC)的数据存储策略.基于节点位置的不同,将数据返回客户端所经过的节点分为"边缘"类节点与"核心"类节点.当数据经过"核心"类节点时,通过权衡该类节点的位置与数据在不同节点的流行度分布,将数据存储在对其他节点最有利的节点中;当数据经过"边缘"类节点时,通过该数据流行度来选择最有利于客户端的位置.仿真结果表明,提出的策略将有效提高数据命中率,减少数据请求时延和距离.展开更多
基金supported in part by the National Natural Science Foundation of China (NSFC) under Grant 61671081in part by the Funds for International Cooperation and Exchange of NSFC under Grant 61720106007+2 种基金in part by the 111 Project under Grant B18008in part by the Beijing Natural Science Foundation under Grant 4172042in part by the Fundamental Research Funds for the Central Universities under Grant 2018XKJC01
文摘As a named data-based clean-slate future Internet architecture,Content-Centric Networking(CCN)uses entirely different protocols and communication patterns from the host-to-host IP network.In CCN,communication is wholly driven by the data consumer.Consumers must send Interest packets with the content name and not by the host’s network address.Its nature of in-network caching,Interest packets aggregation and hop-byhop communication poses unique challenges to provision of Internet applications,where traditional IP network no long works well.This paper presents a comprehensive survey of state-of-the-art application research activities related to CCN architecture.Our main aims in this survey are(a)to identify the advantages and drawbacks of CCN architectures for application provisioning;(b)to discuss the challenges and opportunities regarding service provisioning in CCN architectures;and(c)to further encourage deeper thinking about design principles for future Internet architectures from the perspective of upper-layer applications.
文摘Content-centric Networking(CCN) is progressively flattering the substitutable approach to the Internet architecture through illuminating information(content) dissemination on the Internet with content forenames.The emergent proportion of Internet circulation has expectant adjusting Content-centric architecture to enhance serve the user prerequisites of accessing content.In recent years,one of the key aspects of CCN is ubiquitous in-network caching,which has been widely received great attention in research interest.One foremost shortcoming of in-network caching is that content producers have no awareness about where their content is put in storage.Because routers in CCN have caching capabilities,therefore,each and every content router can cache the content item in its storage capacity.This is problematic in the case in which a producer wishes to update or make the changes in its content item.In this paper,we present an approach regarding how to address this issue with a scheme called efficient content update(ECU).Our proposed ECU scheme achieves content update via trifling packets that resemble contemporary CCN communication messages with the use of additional table.We measure the performance of ECU scheme by means of simulations and make available a comprehensive exploration of its results.
基金Supported by the National Basic Research Program of China("973"Program,No.2013CB329100)Beijing Higher Education Young Elite Teacher Project(No.YETP0534)
文摘There were two strategies for the data forwarding in the content-centric networking(CCN): forwarding strategy and routing strategy. Forwarding strategy only considered a separated node rather than the whole network performance, and Interest flooding led to the network overhead and redundancy as well. As for routing strategy in CCN, each node was required to run the protocol. It was a waste of routing cost and unfit for large-scale deployment.This paper presents the super node routing strategy in CCN. Some super nodes selected from the peer nodes in CCN were used to receive the routing information from their slave nodes and compute the face-to-path to establish forwarding information base(FIB). Then FIB was sent to slave nodes to control and manage the slave nodes. The theoretical analysis showed that the super node routing strategy possessed robustness and scalability, achieved load balancing,reduced the redundancy and improved the network performance. In three topologies, three experiments were carried out to test the super node routing strategy. Network performance results showed that the proposed strategy had a shorter delay, lower CPU utilization and less redundancy compared with CCN.
基金This work was supported by Taif University Researchers Supporting Project Number(TURSP-2020/292),Taif University,Taif,Saudi Arabia。
文摘On-path caching is the prominent module in Content-Centric Networking(CCN),equipped with the capability to handle the demands of future networks such as the Internet of Things(IoT)and vehicular networks.The main focus of the CCN caching module is data dissemination within the network.Most of the existing strategies of in-network caching in CCN store the content at the maximumnumber of routers along the downloading path.Consequently,content redundancy in the network increases significantly,whereas the cache hit ratio and network performance decrease due to the unnecessary utilization of limited cache storage.Moreover,content redundancy adversely affects the cache resources,hit ratio,latency,bandwidth utilization,and server load.We proposed an in-network caching placement strategy named Coupling Parameters to Optimize Content Placement(COCP)to address the content redundancy and associated problems.The novelty of the technique lies in its capability tominimize content redundancy by creating a balanced cache space along the routing path by considering request rate,distance,and available cache space.The proposed approach minimizes the content redundancy and content dissemination within the network by using appropriate locations while increasing the cache hit ratio and network performance.The COCP is implemented in the simulator(Icarus)to evaluate its performance in terms of the cache hit ratio,path stretch,latency,and link load.Extensive experiments have been conducted to evaluate the proposed COCP strategy.The proposed COCP technique has been compared with the existing state-of-theart techniques,namely,Leave Copy Everywhere(LCE),Leave Copy Down(LCD),ProbCache,Cache Less forMore(CL4M),and opt-Cache.The results obtained with different cache sizes and popularities show that our proposed caching strategy can achieve up to 91.46%more cache hits,19.71%reduced latency,35.43%improved path stretch and 38.14%decreased link load.These results confirm that the proposed COCP strategy has the potential capability to handle the demands of future networks such as the Internet of Things(IoT)and vehicular networks.
文摘Accurately estimating of Retransmission TimeOut (RTO) in Content-Centric Networking (CCN) is crucial for efficient rate control in end nodes and effective interface ranking in intermediate routers. Toward this end, the Jacobson algorithm, which is an Exponentially Weighted Moving Average (EWMA) on the Round Trip Time (RTT) of previous packets, is a promising scheme. Assigning the lower bound to RTO, determining how an EWMA rapidly adapts to changes, and setting the multiplier of variance RTT have the most impact on the accuracy of this estimator for which several evaluations have been performed to set them in Transmission Control Protocol/Internet Protocol (TCP/IP) networks. However, the performance of this estimator in CCN has not been explored yet, despite CCN having a significant architectural difference with TCP/IP networks. In this study, two new metrics for assessing the performance of RTO estimators in CCN are defined and the performance of the Jacobson algorithm in CCN is evaluated. This evaluation is performed by varying the minimum RTO, EWMA parameters, and multiplier of variance RTT against different content popularity distribution gains. The obtained results are used to reconsider the Jacobson algorithm for accurately estimating RTO in CCN. Comparing the performance of the reconsidered Jacobson estimator with the existing solutions shows that it can estimate RTO simply and more accurately without any additional information or computation overhead.
基金supported in part by the 973 Program under Grant No.2013CB329100in part by NSFC under Grant No.61422101,62171200,and 62132017+1 种基金in part by the Ph.D. Programs Foundation of MOE of China under Grant No.20130009110014in part by the Fundamental Research Funds for the Central Universities under Grant No.2016JBZ002
文摘Content-Centric Networking is a novel future network architecture that attracts increasing research interests in recent years. In-network caching has been regarded as a prominent feature of Content-Centric Networking since it is able to reduce the network traffic, alleviate the server bottleneck and decrease the user access latency. However, the CCN default caching scheme results in a high caching redundancy, causing an urgent need for an efficient caching scheme. To address this issue, we propose a novel implicit cooperative caching scheme to efficiently reduce the caching redundancy and improve the cache resources utilization. The simulation results show that our design achieves a higher hit ratio and a shorter cache hit distance in comparison with the other typical caching schemes.
基金This work was supported by National Key Basic Research Program of China (973 Program) under Grant No. 2012CB315802 National Natural Science Foundation of China under Grant No. 61171102 and No. 61132001 Prospective Research on Future Networks of Jiangsu Future Networks Innovation institute under Grant No. BY2013095-4-01. Beijing Nova Program under Grant No.2008B50 and Beijing Higher Education Young Elite Teacher Project under Grant No.YETP0478.
文摘In-network caching and Interest packets aggregation are two important features of Content-Centric Networking(CCN).CCN routers can directly respond to the Interest request by Content Store(CS)and aggregate the same Interest packets by Pending Interest Table(PIT).In this way,most popular content requests will not reach the origin content server.Thus,content providers will be unaware of the actual usages of their contents in network.This new network paradigm presents content providers with unprecedented challenge.It will bring a great impact on existing mature business model of content providers,such as advertising revenue model based on hits amount.To leverage the advantages of CCN and the realistic business needs of content providers,we explore the hits-based content provisioning mechanism in CCN.The proposed approaches can avoid the unprecedented impact on content providers' existing business model and promote content providers to embrace the real deployment of CCN network.
文摘车联网中,如何有效选择缓存位置和缓存内容对于提高整体网络性能至关重要。针对上述问题,引入了内容中心网络技术,提出了一种新的优化缓存策略——缓存位置和缓存内容的选择取决于车辆节点值和内容流行度(Vehicle Node Value and Content Popularity,VNVCP)。首先,定义了连通性、中间中心性和特征向量中心性3个车辆节点属性用来评估车辆节点的值,具有不同值的车辆节点缓存具有不同流行度的内容,内容的重要性由其受欢迎程度决定。其次,该策略利用不同类型内容受欢迎程度的差异确保缓存内容分布均匀,同时评估来自多个属性的车辆节点的值以提高车辆节点利用率。仿真结果表明,VNVCP在缓存命中率、平均跳数和传输延迟方面明显优于传统的LCE(Leave Copy Every where)、Prob(0.5)和MPC(Most Popular Content)。
文摘缓存是命名数据网络(named data networking,NDN)有别于传统网络最突出的特性之一,NDN中默认所有节点都具有缓存所有经过数据的功能.这种"处处缓存"策略导致网内大量冗余数据的产生,使网内缓存被严重浪费.针对上述问题,首次提出了一种基于节点分类(based on node classification,BNC)的数据存储策略.基于节点位置的不同,将数据返回客户端所经过的节点分为"边缘"类节点与"核心"类节点.当数据经过"核心"类节点时,通过权衡该类节点的位置与数据在不同节点的流行度分布,将数据存储在对其他节点最有利的节点中;当数据经过"边缘"类节点时,通过该数据流行度来选择最有利于客户端的位置.仿真结果表明,提出的策略将有效提高数据命中率,减少数据请求时延和距离.