Priority-based content processing with Q-routing in information-centric networking (ICN)

With exponential increase in the number of users and available data, service providers are facing hard times to satisfy and improve end user experience. Researchers have come up with the idea of exploiting increasing number of routers in a network, and it leads to the development of information-centric networking (ICN). Efficient usage of the in-network caches and content forwarding methodology are the key issues in an ICN architecture. ICN reduces average hop count and correspondingly average content download delay because the intra-domain routers in ICN have storage capacity and they can act as temporary content provider. In this paper, we address the content management issue in a cache with finite storage capability and propose an efficient content management policy that changes a router to a self-sustained cache. We propose a novel methodology to process content packets in the buffer of a cache and correspondingly reduce the propagation delay through a cache. We simulate our proposed algorithm over real-life network environment and evaluate the performance of different user experience metrics, e.g. average latency, throughput, goodput, and link load. Simulation results suggest that our proposed model outperforms the existing state-of-the-art on-path caching strategies.     

基于内容流行度和节点中心度匹配的信息中心网络缓存策略

在信息中心网络(Information-Centric Network, ICN)中,利用网络内置缓存提高内容获取及传输效率是该网络构架最重要的特性。然而,网络内置的缓存存在应对大量的需要转发的内容时能力相对弱小,对内容放置缺乏均衡分布的问题。该文提出基于内容流行度和节点中心度匹配的缓存策略(Popularity and Centrality Based Caching Scheme, PCBCS),通过对经过的内容进行选择性缓存来提高内容分发沿路节点的缓存空间使用效率,减少缓存冗余。仿真结果表明,该文提出的算法和全局沿路缓存决策方案,LCD(Leave Copy Down)以及参数为0.7及0.3的Prob(copy with Probability)相比较,在服务器命中率上平均减少30%,在命中缓存内容所需的跳数上平均减少20%,最重要的是,和全局沿路缓存决策方案相比总体缓存替换数量平均减少了40%。     

Cooperative caching algorithm of UAV and user in UAV-assisted cellular network

Aiming at the problem of mass data content transmission and limited wireless backhaul resource of UAV in UAV-assisted cellular network,a cooperative caching algorithm for cache-enabled UAV and user was proposed.By deploying caches on UAV and user device,the popular content requested by user was cached and delivered,which alleviated the backhaul resource and energy consumption of UAV,reduced the traffic load and user delay.A joint optimization problem of UAV and user caching was established with the goal of minimizing user content acquisition delay,and decomposed into UAV caching sub-problem and user caching sub-problem,which were solved based on alternating direction method of multiplier and global greedy algorithm respectively.The iterative way was used to obtain convergent optimization result,and the cooperative caching of UAV and user was realized.Simulation results show that the proposed algorithm can effectively reduce user content acquisition delay and improve system performance.     

CCN中基于业务类型的多样化内容分发机制

针对内容中心网络(Content Centric Networking,CCN)如何提供差异化的业务需求服务的问题,采用区分服务的思想,从内容传输和缓存决策的角度出发,提出了一种基于业务类型的多样化内容分发机制.该机制依据不同的业务请求特征,分别设计了持久推送、并行预测和逐包请求的数据分发模式,对应提出了透明转发、边缘概率缓存和渐进式推进的沿途存储策略,实现了内容传递对于业务类型的感知和匹配.仿真结果表明,该机制减小了内容请求时延,提高了缓存命中率,以少量额外的控制开销提升了CCN网络整体的内容分发性能.     

内容中心网络中面向隐私保护的协作缓存策略

针对内容中心网络节点普遍缓存带来的隐私泄露问题,在兼顾内容分发性能的基础上,该文提出一种面向隐私保护的协作缓存策略。该策略从信息熵的角度提出隐私度量指标,以增大攻击者的不确定度为目标,首先对于缓存策略的合理性给予证明;其次,通过构建空间匿名区域,扩大用户匿名集合,增大缓存内容的归属不确定性。缓存决策时,针对垂直请求路径和水平匿名区域,分别提出沿途热点缓存和局域hash协同的存储策略,减小缓存冗余和隐私信息泄露。仿真结果表明,该策略可减小内容请求时延,提高缓存命中率,在提升内容分发效率的同时增强了用户隐私保护水平。     

Coordinated caching scheme based on popular content awareness and tracking

To overcome the problems of the on-path caching schemes in the content centric networking,a coordinated caching scheme based on the node with the max betweenness value and edge node was designed.According to the topol-ogy characteristics,the popular content was identified at the node with the max betweenness value and tracked at the edge node.The on-path caching location was given by the popularity and the cache size.Simulation results show that,com-pared with the classical schemes,this scheme promotes the cache hit ratio and decreases the average hop ratio,thus en-hancing the efficiency of the cache system.     

Centralized congestion control routing protocol based on multi-metrics for low power and lossy networks

Owing to the unreliability of wireless link and the resource constraints of embedded devices in terms of energy, processing power, and memory size in low power and lossy networks (LLNs), network congestion may occur in an emergency and lead to significant packet loss and end-to-end delay. To mitigate the effect of network congestion, this paper proposes a centralized congestion control routing protocol based on multi-metrics (CCRPM). It combines the residual energy of a node, buffer occupancy rate, wireless link quality, and the current number of sub-nodes for the candidate parent to reduce the probability of network congestion in the process of network construction. In addition, it adopts a centralized way to determine whether the sub-nodes of the congested node need to be switched based on the traffic analysis when network congestion occurs. Theoretical analysis and extensive simulation results show that compared with the existing routing protocol, the performance of CCRPM is improved significantly in reducing the probability of network congestion, prolonging average network lifetime, increasing network throughput, and decreasing end-to-end delay.     

一种基于无线电环境地图的路由优化机制

设计认知无线网络路由算法时,需要兼顾主用户保护与路由性能两个方面。为了提高认知无线网络中次用户之间路由的端到端性能,提出了基于无线电环境地图的路由优化机制,该机制中无线电环境地图能够为次用户提供主用户保护有关的无线电环境数据。首先,无线电环境地图根据次用户的数据请求将各授权频段的可用概率与功率控制相关信息反馈到该次用户;其次,次用户可以计算出与上一跳次用户之间的链路稳定性以及传输时延;最后,目的次用户通过计算每条路由的端到端吞吐量的期望值,然后选取期望值最大的一条路由。仿真结果表明,该路由机制在平均分组投递率、平均端到端吞吐量、平均端到端时延方面均优于对比路由算法。     

命名数据网络中基于局部请求相似性的协作缓存路由机制

该文针对命名数据网络(Named Data Networking, NDN)应答内容的高效缓存和利用问题,依据内容请求分布的局域相似特征,提出一种协作缓存路由机制。缓存决策时,将垂直请求路径上的冗余消除和水平局域范围内的内容放置进行有效结合。垂直方向上,提出基于最大内容活跃因子的路径缓存策略,确定沿途转发对应的最大热点请求区域;水平方向上,采用一致性Hash协同缓存思想,实现应答内容的局域定向存储。路由查找时,将局域节点缓存引入到路由转发决策中,依据内容活跃等级动态执行局域缓存查找,增大内容请求就近响应概率。该机制减小了内容请求时延和缓存冗余,提高了缓存命中率,以少量额外的代价换取了内容请求开销的大幅下降,仿真结果验证了其有效性。     

Caching strategy based on node’s importance to community in information-centric networks

In-network caching is one of the most important features of ICN (information-centric networks).A caching strategy based on node’s importance to community was proposed to make content objects cached more reasonable in temporal and spatial distribution.Within each community,the strategy not only caches content objects in those nodes where users are easy to access the content,but also makes different popularity of content objects more reasonable in temporal distribution.The CSNIC strategy was implemented under a variety of experimental conditions,and compare it with the previous strategies CEE-LRU,Betw-LFU and Opportunistic.The simulation results show that the strategy can yield a significant performance improvement,such as,cache hit ratio,hop reduction ratio,content diversity ratio and number of replacement.Furthermore,the additional overhead of CSNIC is small.     

无线自组织网络中一种拥塞意识的多径路由算法

提出了无线自组织网络中一种拥塞意识的多径路由算法。该算法在路由发现过程中,综合节点的队列长度和路径跳数来动态确定路由请求消息的转发概率,可以在保证路由请求消息有一定送达率的条件下,降低路由开销;在路径选择和流量分配过程中,综合考虑节点的队列长度和路径质量作为路由度量,发现流量高吞吐量低拥塞路径,并基于该度量值进行流量分配。仿真结果显示,所提出的多径路由算法能有效提高网络性能。     

Routing algorithm design of satellite network architecture based on SDN and ICN

In view of the problems of low routing efficiency, complex control process, and difficult network management in big data environment in the traditional integrated space‐terrestrial network, in the paper, we propose a satellite network architecture called software‐defined information centric satellite networking (SDICSN) based on software‐defined networking (SDN) and information‐centric networking (ICN), and we design a virtual node matrix routing algorithm (VNMR) under the SDICSN architecture. The SDICSN architecture realizes the flexibility of network management and business deployment through the features of the separation of forwarding and controlling by the SDN architecture and improves the response speed of requests in the network by the centric of “content” as the ICN idea. According to the periodicity and predictability of the satellite network, the VNMR algorithm obtains the routing matrix through the relative orientation of the source and destination nodes, thus reducing the spatial complexity of the input matrix of the Dijkstra algorithm and then reducing the time complexity of the routing algorithm. For forwarding information base (FIB), the mechanism of combination of event driven and polling can be quickly updated in real time. Finally, the advantages of the SDICSN architecture in routing efficiency, request delay, and request aggregation are verified by simulation.     

A novel delay-aware routing algorithm (DARA) for a hybrid wireless-optical broadband access network (WOBAN)

A hybrid wireless-optical broadband access network (WOBAN) is a promising architecture for future access networks. Recently, the WOBAN has been gaining increasing attention, and early versions are being deployed as municipal access solutions. This architecture saves on network deployment cost because fiber need not penetrate to each end user. However, a major research opportunity exists in developing an efficient routing algorithm for the wireless front-end of the WOBAN. We propose and investigate the characteristics of the delay-aware routing algorithm (DARA) that minimizes the average packet delay in the wireless front-end of a WOBAN. In DARA we model wireless routers as queues and predict wireless link states periodically. Our performance studies show that DARA achieves less delay and congestion, and improved load balancing compared to traditional approaches such as the minimum-hop routing algorithm, shortest-path routing algorithm, and predictive throughput routing algorithm.     

命名数据网络中基于内容请求相关性的协作缓存算法

针对命名数据网络(Named Data Networking, NDN)存储空间的有效利用和应答内容的高效缓存问题,该文采用差异化缓存的方式,提出一种依据内容请求序列相关性的协作缓存算法。在内容请求中,预先发送对于后续相关数据单元的并行预测请求,增大内容请求的就近响应概率;缓存决策时,提出联合空间存储位置与缓存驻留时间的2维差异化缓存策略。根据内容活跃度的变化趋势,空间维度上逐跳推进内容存储位置,时间维度上动态调整内容缓存时间,以渐进式的方式将真正流行的请求内容推送至网络边缘存储。该算法减小了内容请求时延和缓存冗余,提高了缓存命中率,仿真结果验证了其有效性。     

Link failure and congestion-aware reliable data delivery mechanism for mobile ad hoc networks

Link failures and packet drops due to congestion are two frequently occurring problems in mobile ad hoc networks, degrading the network performance significantly. In this paper, we propose a link failure and congestion-aware reliable data delivery (LCRDD) mechanism that jointly exploits local packet buffering and multilevel congestion detection and control approaches for increasing the data delivery performance. On the detection of link failure or congestive state, an LCRDD intermediate node buffers the incoming data packets at the transport layer queue and resumes transmission when the route is repaired locally. In addition, LCRDD’s multilevel congestion detection helps it to take the most appropriate action proactively. Thus, it offers increased reliability and throughput and decreased end-to-end packet delivery delay and routing overhead compared to state-of-the-art protocols, as shown in results of performance evaluations carried out in network simulator v-2.34.     

UAV deployment and caching scheme based on user preference prediction

In order to design an efficient edge caching policy considering spatial heterogeneity and temporal fluctuations of users’ content requests,a proactive caching scheme was proposed with UAV’s deployment location design based on user preference prediction.Firstly,each user’s preference characteristics were predicted based on file similarity and user similarity,and the request time and user location were also predicted when a content request occurs.Thereafter,on the basis of the predicted geographical location,request time and user preference,each UAV’s deployment location and the corresponding content placement were determined by virtue of clustering method based on SOM and AGNES.Simulation results show that the proposed scheme outperforms other three comparison schemes in terms of hit ratio and transmission delay.Furthermore,the results also reveal that content preference is correlated with different user features by different weights.Accordingly,different impact weights should be matched with different user features.     

Node centrality metric based caching mechanism in content-centric network

In order to reduce the cache redundancy as well as increase the cache hit ratios in content-centric networks,the node centrality metric based caching mechanism (CMC) was proposed.CMC utilized controllers to obtain the topology of the whole network and the idle rate of cache space.According to the connection relation of the topology,the degree centrality,closeness centrality and betweenness centrality of nodes were calculated.When CMC choose the caching nodes,it took the three metrics and the idle rate of cache space into account.Simulation results show that CMC can effectively increase the cache hit ratios and reduce the content fetching hops and average request delay compared with the traditional routing algorithms in CCN.     

命名数据网络下基于K-medoids的簇内Hash路由机制

命名数据网络（Named Data Networking,NDN）是以内容为中心的新型网络架构,其随处缓存策略存在缓存冗余过多、邻居缓存利用率低等问题,导致缓存空间的浪费及缓存效率的低下.本文提出的融合沿路径非协作和路径外协作的缓存路由机制（K-Medoids Hash Routing,KMHR）,使用K-medoids算法选取层次簇内的中心点,并针对不同流行度的内容分别采用Hash路由及最短路径路由,保证簇内高流行度内容的精确定位和唯一性,降低缓存冗余,提高缓存效率.通过真实网络拓扑仿真得出,KMHR机制具有最低的请求时间、最优的路由增益和较少的缓存内容数量.     

Data Congestion Control Using Offloading in IoT Network

Internet of Things (IoT) is being used by a large number of applications and transmitting huge amounts of data. IPv6 routing protocol for low power and lossy networks (RPL) is being standardized for routing in IoT networks. However, it is difficult to handle such huge transmission as it is initially designed for Low power and lossy networks. In this paper, we present the mechanism for the reduction of overhead from the congested parent node by offloading its partial load. For offloading the packet, a suitable neighbor is selected based on its status of energy, buffer, link quality, number of child nodes, and distance. This approach focuses on the enhancement of RPL by including the mechanism for congestion control. The approach reduces the delay and packet loss rate while avoiding congestion in a suitable manner. The proposed approach is beneficial in terms of throughput and packet receiving ratio as compared to the comparative approaches.

     

Hadoop平台下一种改进蚂蚁算法的QoS路由研究

随着未来云计算的发展,各种云服务的应用将需要更高的网络性能。链路拥塞导致的数据包传输时延或数据包丢弃使得网络无法保障业务的QoS。目前普遍使用的链路状态路由算法不具有拥塞响应机制。本文通过在拥塞节点间发送连接蚂蚁寻找新路由来解决拥塞问题。NS2仿真结果表明,该算法能加快新的路由搜索,满足QoS的需求,并有效控制丢包率,时延等性能。