The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “In this paper, we study hierarchical broadcast [respec- tively gossip] networks. ... We prove that, for any of these three models, the minimum outdegree [respectively degree] of a directed hierarchical broadcast network [respectively hierarchical gossip network, hierarchical linear gossip ...
We validate the analytical results by simulations and verify that the hierarchical gossip protocol considerably reduces the load on the network compared to the original, nonhierarchical protocol. ... In the context of group communication protocols, gossip-based schemes have attracted interest as they are scalable, easy to deploy, and resilient to network and process failures. ... ACKNOWLEDGMENTS The authors would like to thank Miguel Castro and Antony Rowstron for their participation in the development of the simulator. ...doi:10.1109/tpds.2003.1189583 fatcat:mczftctmhva7biqhs4evjw7heq
(English summary) Network communications broadcasting and gossiping. Discrete Appl. Math. 83 (1998), no. 1-3, 229-246. ... The computations of both our potential function and our packet- canceling policy are totally local in nature.” 99c:68019 68M10 Michail, Amir (1-WA-CE; Seattle, WA) Optimal broadcast and summation on hierarchical ...
and gossiping. ... In this paper the authors show that many general lower bounds on the broadcasting and gossiping time are optimal. ...
Most previous approaches, such as gossip algorithms, suppose a graphical network, which abstracts away crucial features of the wireless medium, and measure resource consumption only in terms of the total ... We also propose a new scheme, termed hierarchical averaging, which is tailored to the wireless medium, and show that in general this approach is nearly order-optimal with respect to time-bandwidth product ... Gossip is simple, requiring minimal processing and network knowledge, and it is robust to link and node failures. ...doi:10.1109/acssc.2012.6489211 dblp:conf/acssc/NoklebyBCA12 fatcat:mkmohwuqm5g6bi5vwdi5xa7zf4
Summary: “This paper studies the hierarchical broadcast net- works, which are defined as broadcast networks whose every con- nected induced subgraph is also a broadcast network. ... broadcast networks. ...
In this paper we propose a novel probabilistic broadcast protocol that reduces the average end-to-end latency by dynamically adapting to network topology and traffic conditions. ... It does so by using an unique strategy that consists in adjusting the fanout and preferred targets for different gossip rounds as a function of the properties of each node. ... Note that this topology captures and abstracts the hierarchical nature of today's networks. ...doi:10.1109/reldis.2004.1353030 dblp:conf/srds/PereiraRPO04 fatcat:mos27c2skfbe3htmjqw5l2zjxq
In this work, we propose a comparison of classic flooding and the gossip protocol for homogenous networks which enhances stability and throughput quiet significantly. ... The main focus in WSNs is to enhance network localization as much as one could, for efficient and optimal utilization of resources. ... This type is classified under Ad-Hoc network Protocol in Wireless Sensor Network During previous research, many differences have been observed, generally, between flat and hierarchical rout-ing protocols ...doi:10.11591/ijeei.v2i1.101 fatcat:uno7f3vcmbajfob3bgc7nrckq4
Further, we propose a new consensus scheme, termed hierarchical averaging, and show that it is nearly order-optimal with respect to all three metrics. ... Finally, we examine the effects of quantization, showing that hierarchical averaging provides a nearly order-optimal tradeoff between resource consumption and quantization error. ... Much like multi-scale gossip  and the hierarchical cooperation of  , in hierarchical averaging we recursively partition the network into geographically defined clusters. ...doi:10.1109/jstsp.2013.2246765 fatcat:smwzkjyegnh7voglquy5mt5ukm
This paper introduces a new tree structure based broadcast propagation routing model, providing a novel method to organize network nodes and message propagation mechanism. ... The research shows that the tree based routing can accelerate broadcast convergence time and reduce redundant traffic. ... Acknowledgment The authors thank Brahma OS and the team advisors' help on information collection and idea pitching. ...arXiv:1810.12795v1 fatcat:wgg7df6lcfhhfcblwep5myvpuu
Lecture Notes in Computer Science
network topology into account. ... , and by using sophisticated compression methods. ... The network topology is represented by a hierarchy of tags describing basic topologies like switched networks, hubs, rings, chains, meshes, tori and hierarchical compositions thereof. Startup. ...doi:10.1007/3-540-44860-8_28 fatcat:g7tza5apqrhf3exywhrneh7awi
Finally, simulation results show that our algorithm performs better than the naïve multiple gossiping. ... We first propose to partition the network in single-hop clusters also named cliques. Secondly, we run a local permutation routing to broadcast items to their local destinations in each clique. ... Hierarchical Clustering Banerjee and Khuller  proposed a clustering algorithm for multi-hop sensor networks. ...doi:10.4236/wsn.2010.24040 fatcat:r675arhcszgelnlscoml2ulpkq
We introduce an approach to gossip algorithms that exploits three aspects of the wireless medium: superposition, broadcast, and power control. ... We present two averaging algorithms, each based on a hierarchical clustering of the network. ... Fig. 1 . 1 Hierarchical partition of the network. ...doi:10.1109/icassp.2012.6288576 dblp:conf/icassp/NoklebyBCA12 fatcat:v6fnlt35fbflxfkyrsd4ltgnua
A recursive multi-hop area hierarchy has a number of applications in wireless sensor networks, the most common being scalable point-to-point routing, so-called hierarchical routing. ... Through simulations and experiments with an actual embedded protocol implementations, we demonstrate that PL-GOSSIP maintains the hierarchy in a manner that addresses all the peculiarities of sensor networks ... Szymaniak, and G. Urdaneta for providing the computing power necessary to conduct some of the simulations. ...doi:10.1109/tpds.2009.89 fatcat:yflqvc4sojhuvpdp7k6y5rqtze
To address these problems, we revisit some of the networking assumptions and propose an alternative design that employs an overlay combining area and landmark hierarchies. ... We consider multi-resolution storage, a technique for providing scalable adaptive data fidelity, necessary for many applications of large wireless sensor networks (WSNs). ... The usage of asynchronous gossiping differentiates PL-GOSSIP from other related protocols for maintaining hierarchical overlays  ,  ,  ,  . ...doi:10.1109/icc.2009.5199556 dblp:conf/icc/IwanickiS09 fatcat:orqvvlg3nzevpnwcwtlnmnytse
« Previous Showing results 1 — 15 out of 3,220 results