Self-Limiting Epidemic Forwarding
Self-Limiting Epidemic Forwarding
复制标题
DOI：
--
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
A. E. Fawal;J. L. Boudec;Kave Salamatian
中科院分区：
文献类型：
--
作者：
A. E. Fawal;J. L. Boudec;Kave Salamatian
我们定义了一个自限性的流行病服务作为一个传播服务的特设环境中，广播的性质，但仅限于每个源周围的本地范围。示例应用是在交通堵塞中聊天或公告板，在校园中的即时人群中，或者相反，沿着沙漠公路。我们的目标是在广泛的条件下（密集或稀疏）支持这样的服务。主要的问题是自适应地控制范围和流量率，以避免拥塞。我们提出了一种系统设计，具有以下要素：（1）通过自适应老化机制操纵TTL;（2）通过自抑制和间抑制控制转发因子;（3）通过源控制注入速率。我们验证的设计在Java中实现，并分析它使用模拟和常微分方程。我们展示了如何调整它，以实现范围和信息速率之间的适当平衡。我们的设计是完全自组织的，没有任何形式的聚类或领导选举。
We define a self-limiting epidemic service as a dissemination service for ad-hoc environments that is broadcast in nature, but is limited to a local scope around each source. Example applications are chatting or bulletin boards in a traffic jam, in an instant crowd in a campus or, in contrast, along a desert highway. Our goal is to support such a service across a wide range of conditions (dense or sparse). The main problems are to adaptively control scoping and traffic rates to avoid congestion. We propose a system design with the following elements: (1) manipulation of TTL by adaptive aging mechanisms; (2) control of forwarding factor by self-inhibition and inter-inhibition and (3) control of rate of injection by sources. We validate the design by an implementation in Java and analyze it using both simulation and ordinary differential equations. We show how it can be tuned to achieve an appropriate balance between limitation of scope and rate of information. Our design is entirely self-organized, and is free of any form of clustering or leader election.