检索结果-内蒙古大学图书馆

Autonomous gossiping: A self-organizing epidemic algorithm for selective information dissemination in wireless mobile ad-hoc networks

引用

1st International Conference on Semantics of a Networked World (ICSNW 2004)

作者： Datta, A Quarteroni, S Aberer, K Swiss Fed Inst Technol Sch Comp & Commun Sci I&C EPFL CH-1015 Lausanne Switzerland

ISBN: (纸本)3540236090

We introduce autonomous gossiping (A/G), a new genre epidemic algorithm for selective dissemination of information in contrast to previous usage of epidemic algorithms which flood the whole network. A/G is a paradigm which suits well in a mobile ad-hoc networking (MANET) environment because it does not require any infrastructure or middleware like multicast tree and (un) subscription maintenance for publish/subscribe, but uses ecological and economic principles in a self-organizing manner in order to achieve any arbitrary selectivity (flexible casting). The trade-off of using a stateless self-organizing mechanism like A/G is that it does not guarantee completeness deterministically as is one of the original objectives of alternate selective dissemination schemes like publish/subscribe. We argue that such incompleteness is not a problem in many non-critical real-life civilian application scenarios and realistic node mobility patterns, where the overhead of infrastructure maintenance may outweigh the benefits of completeness, more over, at present there exists no mechanism to realize publish/subscribe or other paradigms for selective dissemination in MANET environments.

关键词： mobile ad-hoc network (MANET) selective information dissemination content driven communication epidemic algorithm self-organization any-to-many communication flexible casting

来源：评论

学校读者我要写书评

暂无评论

EpTO: An epidemic Total Order algorithm for Large-Scale Distributed Systems 15

EpTO: An Epidemic Total Order Algorithm for Large-Scale Dist...

引用

16th Annual Middleware Conference

作者： Matos, Miguel Mercier, Hugues Felber, Pascal Oliveira, Rui Pereira, Jose INESC TEC HASLab Oporto Portugal Univ Minho P-4719 Braga Portugal Univ Neuchatel Inst Comp Sci CH-2000 Neuchatel Switzerland

ISBN: (纸本)9781450336185

The ordering of events is a fundamental problem of distributed computing and has been extensively studied over several decades. From all the available orderings, total ordering is of particular interest as it provides a powerful abstraction for building reliable distributed applications. Unfortunately, deterministic total order algorithms scale poorly and are therefore unfit for modern large-scale applications. The main contribution of this paper is EPTO, a total order algorithm with probabilistic agreement that scales both in the number of processes and events. EPTO provides deterministic safety and probabilistic liveness: integrity, total order and validity are always preserved, while agreement is achieved with arbitrarily high probability. We show that EPTO is well-suited for large-scale dynamic distributed systems: it does not require a global clock nor synchronized processes, and it is highly robust even when the network suffers from large delays and significant churn and message loss.

关键词： large-scale distributed systems data dissemination total order epidemic algorithm

来源：评论

学校读者我要写书评

暂无评论

Precise Analysis of epidemic algorithms

Precise Analysis of Epidemic Algorithms

引用

作者： Anatolii Kostrygin Universite Paris-Saclay ECOLE POLYTECHNIQUE

学位级别：博士

In epidemic algorithms the agents in the network involve peers similarly to the spread of epi- demics. In this work, we focus on the randomized rumor spreading? a class of epidemic algorithms. We suppose that nodes of the network communicate with neigh- bors chosen at random. This approach has found nu- merous applications from the consistency maintenance of replicated databases to news spreading in social net- works. Numerous mathematical analyses of di? erent ru- mor spreading protocols can be found in the literature. Although some of them provide extremely sharp esti- mates for the performance of such processes, most of them are based on the inherent properties of concrete protocols. We develop new simple and generic method to ana- lyze randomized rumor spreading processes in complete graphs. In contrast to all previous works, we only need to understand the probability and the covariance of the events that uninformed nodes learn the rumor. This uni- versality allows us to easily analyze the classic push, pull, and push-pull protocols in their pure version as well as in several variations such as when messages fail with constant probability or when nodes call a random number of others each round. Some dynamic models can also be analyzed, e. g., when the network is a random graph sampled independently each round [Clementi et al. (ESA 2013)]. Despite this generality, our method de- termines the expected rumor spreading time precisely apart from additive constants, i. e., more precise than almost all previous works. We show that a deviation from the expectation by more than r rounds occurs with probability at most exp(−Ω(r)). We further use our method to discuss the assumption that nodes can answer any number of incoming calls. Restricting that only one call can be answered, we ob- serve a signi? cant increase of the runtime of the push- pull protocol. In particular, the double logarithmic end phase of the process now takes logarithmic time. This also increases the m

关键词： Distributed algorithm epidemic algorithm rumor spreading dynamic graph

来源：评论

学校读者我要写书评

暂无评论

epidemic and transmission priority based data dissemination model in vehichular adhoc networks (VANETs)

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2021年第4期14卷 2524-2536页

作者： Kumar, D. N. S. Ravi Barani, S. Sathyabama Inst Sci & Technol Sch Elect & Elect Engn Chennai Tamil Nadu India

Vehicular Adhoc Networks (VANETs) is one of the prominent and most important technologies that have reached a milestone in today's modern world. One of the important key functions of VANET is known to be data dissemination that attracted most researchers to deal the problem and technical aspects towards its development. As collective perception technique is used by VANETs for expanding the perceptual range for the road traffic by sharing the sensor data regarding the objects in region using Vehicle-to-Vehicle communication. However, hidden terminal problem and packet collision occurs due to high vehicle density which makes data dissemination more difficult to deliver its messages which contains sensor data. In this paper, the proposed epidemic and Transmission Control Priority (ETCP) based data dissemination model is presented. The proposed technique is used for controlling the transmission frequency of the sensor data or messages to avoid collision and to find the infected number of vehicles which are affected by the message without network overload. Furthermore, the vehicles are selected automatically with high probability for broadcasting sensor data. The simulation results of proposed ETCP algorithm is compared with existing Epic and Condensation Based Forwarding (CBF) algorithms, where transmission delay is as low as 214 millisecond which is lower when compared to other existing models. Packet delivery ratio of the proposed model is 99.12% which is significantly higher when compared to other existing models. The performance evaluation shows that the proposed model can deliberately avoid collision accidents and minimize the overhead and delay by comparing with other existing techniques.

关键词： Vehicular Adhoc networks (VANETs) Data dissemination epidemic algorithm Transmission control epidemic with transmission control priority (ETCP) Sensor data

来源：评论

学校读者我要写书评

暂无评论

Analysis of push-type epidemic data dissemination in fully connected networks

引用

PERFORMANCE EVALUATION 2014年第Jul.期77卷 21-36页

作者： Caglar, Mine Sezer, Ali Devin Koc Univ Dept Math Istanbul Turkey Univ Evry Lab Anal & Probabilites Evry France Middle E Tech Univ Inst Appl Math Ankara Turkey

Consider a fully connected network of nodes, some of which have a piece of data to be disseminated to the whole network. We analyze the following push-type epidemic algorithm: in each push round, every node that has the data, i.e., every infected node, randomly chooses c E Z. other nodes in the network and transmits, i.e., pushes, the data to them. We write this round as a random walk whose each step corresponds to a random selection of one of the infected nodes;this gives recursive formulas for the distribution and the moments of the number of newly infected nodes in a push round. We use the formula for the distribution to compute the expected number of rounds so that a given percentage of the network is infected and continue a numerical comparison of the push algorithm and the pull algorithm (where the susceptible nodes randomly choose peers) initiated in an earlier work. We then derive the fluid and diffusion limits of the random walk as the network size goes to infinity and deduce a number of properties of the push algorithm: (1) the number of newly infected nodes in a push round, and the number of random selections needed so that a given percent of the network is infected, are both asymptotically normal, (2) for large networks, starting with a nonzero proportion of infected nodes, a pull round infects slightly more nodes on average, (3) the number of rounds until a given proportion lambda of the network is infected converges to a constant for almost all lambda is an element of (0, 1). Numerical examples for theoretical results are provided. (C) 2014 Elsevier ay. All rights reserved.

关键词： Peer to peer communication Pull push epidemic algorithm Diffusion and fluid limits Asymptotic analysis Complete graphs

来源：评论

学校读者我要写书评

暂无评论

Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2012年第1期5卷 74-91页

作者： Felber, Pascal Kermarrec, Anne-Marie Leonini, Lorenzo Riviere, Etienne Voulgaris, Spyros Univ Neuchatel Inst Informat CH-2009 Neuchatel Switzerland INRIA Rennes Bretagne Atlantique F-35042 Rennes France Vrije Univ Amsterdam Dept Comp Sci Amsterdam Netherlands

Gossip-based protocols provide a simple, scalable, and robust way to disseminate messages in large-scale systems. In such protocols, messages are spread in an epidemic manner. Gossiping may take place between nodes using push, pull, or a combination. Push-based systems achieve reasonable latency and high resilience to failures but may impose an unnecessarily large redundancy and overhead on the system. At the other extreme, pull-based protocols impose a lower overhead on the network at the price of increased latencies. A few hybrid approaches have been proposed-typically pushing control messages and pulling data-to avoid the redundancy of high-volume content and single-source streams. Yet, to the best of our knowledge, no other system intermingles push and pull in a multiple-senders scenario, in such a way that data messages of one help in carrying control messages of the other and in adaptively adjusting its rate of operation, further reducing overall cost and improving both on delays and robustness. In this paper, we propose an efficient generic push-pull dissemination protocol, Pulp, which combines the best of both worlds. Pulp exploits the efficiency of push approaches, while limiting redundant messages and therefore imposing a low overhead, as pull protocols do. Pulp leverages the dissemination of multiple messages from diverse sources: by exploiting the push phase of messages to transmit information about other disseminations, Pulp enables an efficient pulling of other messages, which themselves help in turn with the dissemination of pending messages. We deployed Pulp on a cluster and on PlanetLab. Our results demonstrate that Pulp achieves an appealing trade-off between coverage, message redundancy, and propagation delay.

关键词： Peer-to-Peer network Gossip-based dissemination epidemic algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Incentive Routing Protocol with Virtual Projection for Mobile Packet Forwarding Nodes in Wireless Sensor Networks

引用

JOURNAL OF INTERCONNECTION NETWORKS 2024年第SUPP01期24卷

作者： Niranjan, L. Manoj Priyatham, M. CMR Inst Technol Dept ECE Bengaluru Karnataka India APS Coll Engn Dept ECE Bengaluru Karnataka India

The size of the Packet Forwarding Nodes (PFNs) is becoming very small as the technology advances in Wireless Sensor Networks (WSNs). The node has an additional parameter with low energy levels. The PFNs are distributed in a square cross-sectional area with each node acting as a Sensing Point (SP) that can be used for various kinds of applications like temperature, atmospheric humidity, acoustic, and pressure measurements. The packet is divided into several fragments where each fragment is considered as fixed or variable length. Each of these packets is sent over multiple PFNs toward the data center using PFNs. The selection of PFNs in the path is picked based on the trust level. In the network even special PFNs are placed which are responsible to deliver the packets toward the data center without losing the data during the transmission. The selection of special PFNs is done by computing the meeting probability, remaining energy computation, computation of data weight, and security value computation. The proposed Incentive Routing Protocol with Virtual Projection (IRPVP) method is compared with the conventional approaches concerning the parameters like delay, link count, resource energy, healthy PFNs, non-healthy PFNs, health ratio computation, remaining energy, control to data ratio, and balancing factor. The simulation outcomes show that the performance of the proposed IRPVP algorithm is better than the other conventional algorithms.

关键词： Packet forwarding nodes epidemic algorithm incentive compatible routing protocol wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Multisource Rumor Spreading with Network Coding

Multisource Rumor Spreading with Network Coding

引用

IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Bromberg, Yerom-David Dufour, Quentin Frey, Davide Univ Rennes CNRS INRIA IRISA Rennes France

ISBN: (纸本)9781728105154

The last decade has witnessed a rising interest in Gossip protocols in distributed systems. In particular, as soon as there is a need to disseminate events, they become a key functional building block due to their scalability, robustness and fault tolerance under high churn. However, Gossip protocols are known to be bandwidth intensive. A huge amount of algorithms has been studied to limit the number of exchanged messages using different combinations of push/pull approaches. We are revisiting the state of the art by applying Random Linear Network Coding to further increase performance. In particular, the originality of our approach is to combine sparse-vector encoding to send our network-coding coefficients and Lamport timestamps to split messages in generations in order to provide an efficient gossiping. Our results demonstrate that we are able to drastically reduce bandwidth overhead and dissemination delay compared to the state of the art.

关键词： network coding gossip dissemination peer-to-peer network epidemic algorithm rumor spreading

来源：评论

学校读者我要写书评

暂无评论

Utility Driven Elastic Services

Utility Driven Elastic Services

引用

DisCoTech 2011: 6th International Federated Conferences on Distributed Computing Techniques

作者： Chacin, Pablo Navarro, Leando Univ Politecn Cataluna Dept Arquitectura Comp Barcelona Spain

ISBN: (纸本)9783642213878

To address the requirements of scalability it has become a common practice to deploy large scale services over infrastructures of non-dedicated servers, multiplexing instances of multiple services at a fine grained level. This tendency has recently been popularized thanks to the utilization of virtualization technologies. As these infrastructures become more complex, large, heterogeneous ad distributed, a manual allocation of resources becomes unfeasible and some form of self-management is required. However, traditional closed loop control mechanisms seems unsuitable for this platforms. The main contribution of this paper is the proposal of an Elastic Utility Driven Overlay Network (eUDON) for dynamically scaling the number of instances of a service to ensure a target QoS objective in highly dynamic large-scale infrastructures of non-dedicated servers. This overlay combines an application provided utility function to express the service's QoS, with an epidemic protocol for state information dissemination, and simple local decisions on each instance to adapt to changes in the execution conditions. These elements give the overlay robustness, flexibility, scalability and a low overhead. We show, by means of simulation experiments, that the proposed mechanisms can adapt to a diverse range of situations like flash crowds and massive failures, while maintaining the QoS objectives of the service.

关键词： Web Services QoS epidemic algorithm Overlay Self-adaptive

来源：评论

学校读者我要写书评

暂无评论

Sub-linear Universal Spatial Gossip Protocols

Sub-linear Universal Spatial Gossip Protocols

引用

16th International Colloquium on Structural Information and Communication Complexity

作者： Baumann, Herve Fraigniaud, Pierre Univ Paris Diderot Paris France

ISBN: (纸本)9783642114755

Gossip protocols are communication protocols in which, periodically, every node of a network exchanges information with some other node chosen according to some (randomized) strategy. These protocols have recently found various types of applications for the management of distributed systems. Spatial gossip protocols are gossip protocols that use the underlying spatial structure of the network, in particular for achieving the "closest-first" property. This latter property states that the closer a node is to the source of a message the more likely it is to receive this message within a prescribed amount of time. Spatial gossip protocols find many applications, including the propagation of alarms in sensor networks, and the location of resources in P2P networks. We design a sub-linear spatial gossip protocol for arbitrary graphs metric. More specifically, we prove that, for any graph metric with maximum degree Delta, for any source s and any ball centered at s with size b, new information is spread from s to all nodes in the ball within O(root b log b log log b + Delta) log b) rounds, with high probability. Moreover, when applied to general metrics with uniform density, the same protocol achieves a propagation time of O(log(2) b log log b) rounds.

关键词： epidemic algorithm information spreading resource location

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：