MSN中ICN缓存感知路由策略研究

67 浏览量更新于2024-07-15 收藏 1.37MB PDF 举报

"MSN中基于ICN的缓存感知路由方案" 本文是一篇研究论文，主要探讨了在移动社交网络（MSN）中应用基于信息中心网络（ICN）的缓存感知路由策略。ICN是一种新兴的网络架构，与传统的IP网络不同，它以内容为中心而非以地址为中心，更侧重于数据的请求和分发。在这种架构下，节点可以缓存内容，从而提高网络效率和用户体验。在MSNs中，由于用户移动性和内容的高需求，缓存策略显得尤为重要。这篇论文提出了一种新的路由方案，旨在利用ICN的特性，实现更有效的数据传输和缓存利用。作者Junling Shi、Xingwei Wang和Min Huang通过分析和设计，考虑了如何在MSNs中构建一个能感知缓存状态的路由系统，以优化内容分发和减少延迟。论文中可能包含了以下关键点： 1. **ICN基础**：首先，作者可能会详细介绍ICN的基本概念，包括名称空间、内容分发机制和 Interest 数据包的工作原理，以及ICN如何支持内容的按需获取和缓存。 2. **缓存策略**：针对MSN的特点，作者可能提出了特定的缓存策略，如基于流行度的缓存、位置感知的缓存或者混合策略，以适应用户的行为模式和网络动态性。 3. **路由算法**：论文的核心部分可能描述了一种新的路由算法，该算法能够考虑到沿途节点的缓存状态，避免重复传输和降低拥塞，同时优化内容的获取路径。 4. **性能评估**：为了验证方案的有效性，作者可能进行了仿真或实验，对比了传统IP路由与ICN缓存感知路由在延迟、吞吐量、能量消耗等方面的表现。 5. **挑战与未来工作**：论文可能还讨论了实施这种方案面临的挑战，如移动性管理、安全性问题，以及对未来研究方向的展望。此研究对于理解如何在MSNs中利用ICN的潜力以改善网络性能具有重要意义。通过缓存感知路由，可以预期网络资源利用率的提升，用户访问内容的速度加快，以及整体网络效率的显著改善。然而，实际部署还需要解决许多技术和工程上的问题，包括如何在移动环境中有效地维护和更新缓存信息，以及如何确保缓存内容的安全性和隐私保护。

ACCEPTED MANUSCRIPT

for MSN, which were designed by the friendship derived from

the regular meetings of users. In [21], by exploiting the social

characteristics of mobile nodes in MSN, a routing protocol was

proposed, which was referred to as the social contact probabil-

ity assisted routing protocol.

However, the above MSN routing schemes did not consider

the user interest information implied in his interest request,

which can help improve MSN routing eﬃciency signiﬁcantly.

Besides, in most MSN routing schemes, contents were not

cached and managed eﬀectively, causing unsatisfactory con-

tent delivery for the forthcoming request. In contrast, our pro-

posed routing scheme integrates ICN paradigm into MSN, ﬁnd-

ing content provider based on the user interest preference and

managing the cached contents to response to the forthcoming

requests quickly.

About ICN routing, in [22], a ﬂat-name based routing scheme

for ICN was proposed. The structure of a container was ex-

ploited as space where contents or information objects resided,

and bloom ﬁlters were utilized as an aggregated form of ﬂat

names and enabled the deepest match routing. In [23], con-

tent management in a cache with ﬁnite storage capability was

formulated, and an eﬃcient content management policy which

metamorphosed a node to a self-sustained cache was proposed.

In [24], an intra-domain cache aware routing scheme which

computed paths with the minimum transportation cost was pro-

posed, and it was based on information item demands and

had in-networking caching capabilities. In [25], a geometric

scheme routing was presented based on ﬂat name to conduct

massive content distribution and retrieval, and a tree-based met-

ric space was proposed according to the hierarchical division of

symbol space. In [26], an integrated routing and caching so-

lution were proposed which reduced caching redundancy and

maximized the probability of ﬁnding the nearby cached content.

In [27], the Named-data Link State Routing protocol (NLSR)

was presented for Named Data Networking (NDN). Since NDN

used names to identify and retrieve content, the NLSR propa-

gated the reachability to name preﬁxes instead of IP preﬁxes.

In [28], a name-based overlay routing scheme named αRoute

was proposed, and both the routing table size and the num-

ber of hops for content lookup were logarithmically bounded

by network size. In [29], the Ant Colony Optimization (ACO)

was introduced into ICN and a novel ACO-inspired ICN rout-

ing mechanism was proposed to retrieve the content. However,

the above ICN routing schemes neglected the social properties

of users which imply their social regularities. In fact, our pro-

posed routing scheme exploits these properties and improves

routing eﬃciency.

As far as we know, there exist a few researches about inte-

grating ICN paradigm into MSN routing. In [30], by leveraging

the NDN principle, a social-aware NDN framework was pro-

posed to achieve eﬃcient cooperative content retrieval. In [31],

a content retrieval architecture based on social metric was pro-

posed in disruption tolerant mobile ICN. In [32], the routing

scheme delivered the content by using the selective agent and

relay nodes. In particular, we respectively compare our work to

the above three researches on interest routing, data routing and

in-network caching.

Figure 1: The structure of interest packet and data packet

Figure 2: ICRS system framework

When routing interest packet, [30] was based on the en-

counter times to the requested content of the node. However,

since contents were held by nodes sparsely, the majority of

nodes did not have encountered the requested content, thus

impacting routing eﬃciency. In our work, even if the major-

ity of nodes have never encountered the requested content be-

fore, the node that has similar interest preference with the con-

tent provider can encounter the provider with high probabil-

ity at their common PoI. In addition, in [31], interest packet

was ﬁrstly forwarded to the node with the highest social sta-

tus, since such node was allowed to know which node is the

content provider. Then, interest packet was forwarded to the

content provider based on the encounter time duration with the

provider. However, before routing interest packet to the con-

tent provider, routing scheme should ﬁnd the node with the

highest social status. Such method brought the high number

of packet delivery hops and long packet delivery delay since

it separated the process of content provider ﬁnding and that of

interest packet forwarding. In contrast, our work selects the

forwarding node for interest packet based on the user interest

preference to ﬁnd the content provider. Moreover, in [32], in-

terest packet was forwarded to the node with many friends and

much caching space. However, it could not ﬁnd out the con-

tent provider eﬀectively, since it was unaware of the requested

content. In contrast, our work has awareness of the requested

content based on the user interest preference.

剩余15页未读，继续阅读

weixin_38639615

粉丝: 4
资源: 922

MSN中ICN缓存感知路由策略研究

校园信息化网络安全的ICN缓存机制研究.pdf

基于缓存节点之间角色划分的混合ICN缓存协调方案

ICN中基于预取操作的缓存方案

信息中心网络中基于缓存的基于社交的QoS路由方案

基于边缘优先的ICN缓存协作策略

基于区域划分的混合ICN缓存策略

用于ICN的基于压缩感知的缓存内容定位

论文研究-ICN中基于节点权重的缓存大小分配方案研究.pdf

基于节点角色划分的混合ICN缓存协调方案

社团感知ICN缓存策略优化内容分布与性能

最新资源