自适应与效用驱动的群通信服务扩展策略
105 浏览量
更新于2024-07-15
收藏 1.2MB PDF 举报
本文档标题为"Scaling Group Communication Services with Self-adaptive and Utility-driven Message Routing"，是一篇研究论文，发表于MobileNetwAppl期刊，DOI为10.1007/s11036-011-0348-9。该研究主要关注在互联网边缘如何有效地处理大量组通信数据流，这是当前面临的一个挑战，因为这会给网络链接、资源需求以及路由节点能力带来巨大压力。
传统上，许多研究集中在地理距离（Geo-distance）为基础的路由算法优化上，旨在减少路径长度或通过利用网络局部性来提升效率。然而，这些方法在应对网络动态变化时往往表现不足，尤其是在资源利用率和组通信效率方面存在局限。作者指出，现有的基于地理距离的路由协议在很多多播Overlay网络中并不高效。
为解决这个问题，研究者提出了一种自适应和以效用为导向的消息路由策略。这种方法不再单纯依赖地理距离，而是转向一种更加灵活和智能化的方式，旨在优化资源分配，提升通信效率，并能动态适应网络条件的变化。效用驱动的路由机制可能包括但不限于流量负载均衡、带宽管理、冗余路径选择等，以确保在满足服务质量的同时，最小化网络资源的消耗。
论文的核心贡献可能包括：
1. **效用模型的构建**：设计了一个新的效用函数，用于衡量不同路由决策的性能，结合了延迟、带宽、网络拥塞等因素，以实现更科学的路由决策。
2. **自适应路由算法**：开发了一种能根据网络状况实时调整的路由算法，它可以根据网络动态变化和效用模型动态选择最佳路径，从而提高整体系统性能。
3. **性能评估与优化**：论文可能详细分析了新方法在实际网络环境中的性能对比实验，展示了其在大规模组通信服务中的优越性，如降低延迟、减少拥塞、提升吞吐量等方面。
4. **潜在的应用场景**：讨论了这种自适应和效用驱动的路由策略在移动互联网、物联网、云计算等领域的潜在应用价值，以及对现有路由技术的改进和扩展。
这篇论文提供了针对大规模组通信服务的一种创新解决方案，通过引入效用驱动和自适应策略，有效解决了传统路由方法在面对网络动态性和资源限制时的不足，为网络服务的可扩展性和效率提升开辟了新的研究方向。
Mobile Netw Appl
become shortcut nodes when they are not adjacent to
the given node.
Each node in the basic GeoCast maintains a list
peernodelist. Such list contains two kinds of nodes:
immediate neighbor node and shortcut node. Instead
of removing old immediate neighbors from the lists,
GeoCast keeps those nodes in peernodelists and uses
them to speed up the procedures of message deliv-
ery. For a node E
i
,itspeernodelist is denoted by
peernodelist(i) ={S
0
i
, S
1
i
,...,S
j
i
,...,S
Q
i
},whereQ is
defined by log
2
(G.w ∗G.h/(E
i
.R.w ∗E
i
.R.h)). For each
subset S
j
i
(1 ≤ j ≤ Q), it contains the nodes in the
geographical enclosing zone EZ
j
i
with the size of 1/2
j
of the geographical plane G. EZ
j
i
is defined by: EZ
j
i
:<
x, y,w,h >,where(x, y) represents the coordinates of
top left vertex of enclosing zone and (w, h) refers to
the width and height of EZ
j
i
. Nodes in the subset S
j
i
are viewed as representatives of the enclosing zone
EZ
j
i
. If a message needs to be routed from node i
to a destination node contained in the enclosing zone
EZ
k
i
, it is likely that a shortcut node in the subset S
k
i
be
chosen as the next message forwarding hop.
Figure 1a provides a snapshot of GeoCast over-
lay network with three end system nodes. At this
point, there is no shortcut node included in the peern-
odelists of the nodes. For E
2
, peernodelist(2) ={S
0
2
}=
{{E
1
, E
3
}}, where node E
1
and node E
3
are its neigh-
bors included in EZ
0
2
that is identical to the entire plane
G. With the arrival of node E
4
as shown in Fig. 1b,
node E
3
is no longer a neighbor of node E
2
and is
now recorded as a shortcut node in peernodelist(2).For
node E
2
, shortcuts are the nodes whose regions have
no intersection with region 2. Given the locations of
nodes, S
0
2
is represented by: S
0
2
={E
1
, E
3
, E
4
},where
E
1
, E
3
, E
4
∈ EZ
0
2
. Similarly, node E
4
becomes another
shortcut node of node E
2
after node E
5
joins the
network as shown in Fig. 1c. Now peernodelist(2) =
{{E
1
, E
3
, E
4
}, {E
5
}},whereE
5
∈ EZ
1
2
and E
5
/∈ EZ
0
2
.
In this way, each node keeps building up its peernodelist
as the topology of network evolves with the arrival or
departure of nodes.
Different nodes may have their peernodelist in
different sizes. The exact length of the list for a node
E
j
is decided by the relative size of the region R
owned by E
j
. If the region R is 1/2
Q
of the size
of the geographical plane, the list length is Q.This
allows to cover the entire geographical plane by the
shortcuts of E
j
according to the following equation:
Q
i=1
1/2
i
+1/2
Q
= 1 (The full version of the proof can
be found in our technical report [28]).
Let Gdist
i→j
=
(x
i
− x
j
)
2
+(y
i
− y
j
)
2
be the geo-
distance between two nodes E
i
and E
j
on the space
G, where (x
i
, y
i
) and (x
j
, y
j
) are the unique identifier
of E
i
and E
j
respectively. Let destination be a point or
aregioninthespaceG[13]. In GeoCast, we consider
the destination as a spatial point in the plane and tag
its coordinates with a request message, consisting of
a spatial query point D(x, y), a description of request
data, information of the node who issued such request.
When the end system node that covers D(x, y) receives
this request, it sends the requested information related
to its region back to the request sender. In location-
based service (LBS), an example of such request is
“send me the current traffic state of I-85 on exit 94.”
When a node E
i
wants to route a message to the
node with the given destination coordinates, it first
checks if the coordinates are contained by the region it
owns. If not, it looks up the routing nodes in its peern-
odelist and chooses the node with the smallest Gdist
to the destination as its next routing hop to route the
message. This procedure is executed repeatedly until
the message reaches the node whose region covers the
destination. In SGD, the use of shortcuts ensures that
at each hop, the routing search space can be reduced
Fig. 1 A GeoCast overlay network
剩余20页未读，继续阅读
2018-07-29 上传
2018-04-04 上传
2009-08-14 上传
2021-02-21 上传
2021-05-21 上传
2022-04-01 上传
2022-03-14 上传
2022-03-27 上传
weixin_38519763
- 粉丝: 5
- 资源: 922
我的内容管理
展开
最新资源
- 单片机串口通信仿真与代码实现详解
- LVGL GUI-Guider工具：设计并仿真LVGL界面
- Unity3D魔幻风格游戏UI界面与按钮图标素材详解
- MFC VC++实现串口温度数据显示源代码分析
- JEE培训项目：jee-todolist深度解析
- 74LS138译码器在单片机应用中的实现方法
- Android平台的动物象棋游戏应用开发
- C++系统测试项目：毕业设计与课程实践指南
- WZYAVPlayer：一个适用于iOS的视频播放控件
- ASP实现校园学生信息在线管理系统设计与实践
- 使用node-webkit和AngularJS打造跨平台桌面应用
- C#实现递归绘制圆形的探索
- C++语言项目开发：烟花效果动画实现
- 高效子网掩码计算器：网络工具中的必备应用
- 用Django构建个人博客网站的学习之旅
- SpringBoot微服务搭建与Spring Cloud实践
