Filters








17,418 Hits in 5.4 sec

Fault-Tolerant Aggregation by Flow Updating [chapter]

Paulo Jesus, Carlos Baquero, Paulo Sérgio Almeida
2009 Lecture Notes in Computer Science  
In this paper, we introduce a novel averaging based aggregation technique: Flow Updating.  ...  Nonetheless, existing approaches are found lacking in terms of fault tolerance. In this paper, we introduce a novel fault-tolerant averaging based data aggregation algorithm.  ...  Flow Updating fault tolerance -n = 1000, and d ≈ 3 (log n).  ... 
doi:10.1007/978-3-642-02164-0_6 fatcat:h3yiqguh3zdlfodskzwt3yym5m

A Survey of Distributed Data Aggregation Algorithms

Paulo Jesus, Carlos Baquero, Paulo Sergio Almeida
2015 IEEE Communications Surveys and Tutorials  
In this work, we propose a novel fault-tolerant averaging based data aggregation algorithm: Flow Updating.  ...  The algorithm is based on manipulating flows (in the graph theoretical sense), that are updated using idempotent messages, providing it with unique robustness capabilities.  ...  Enforcing the skew symmetry of flows along edges through idempotent messages is what confers Flow Updating its unique fault tolerance characteristics, that distinguish it from previous approaches.  ... 
doi:10.1109/comst.2014.2354398 fatcat:f4tcxtoxmvg7javonkluh5xida

Robust distributed orthogonalization based on randomized aggregation

Wilfried N. Gansterer, Gerhard Niederbrucker, Hana Straková, Stefan Schulze Grotthoff
2011 Proceedings of the second workshop on Scalable algorithms for large-scale systems - ScalA '11  
A new fault tolerant distributed orthogonalization method (rdmGS), which can produce accurate results even in the presence of node failures, is built on top of distributed data aggregation algorithms.  ...  For this purpose, a new aggregation algorithm for summing or averaging distributed values, the push-flow algorithm, is developed, which achieves superior resilience properties with respect to node failures  ...  Acknowledgments The research was funded by the Austrian Science Fund (FWF) in project S10608.  ... 
doi:10.1145/2133173.2133177 dblp:conf/sc/GanstererNSG11 fatcat:vkykkjh7czeh7mmqye62hcvzmi

Robust Gossip-Based Aggregation: A Practical Point of View [chapter]

Gerhard Niederbrucker, Wilfried N. Gansterer
2013 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX)  
of fault tolerance in practice.  ...  In this paper, we evaluate performance and limitations in practical computations of those gossip-based aggregation algorithms with the most promising theoretical fault tolerance properties.  ...  Acknowledgements The research was funded by the Austrian Science Fund (FWF) under project number S10608.  ... 
doi:10.1137/1.9781611972931.12 dblp:conf/alenex/NiederbruckerG13 fatcat:pgti36cptjggvcmfbpunflhl5y

Fault-Tolerant Aggregation for Dynamic Networks

Paulo Jesus, Carlos Baquero, Paulo Sergio Almeida
2010 2010 29th IEEE Symposium on Reliable Distributed Systems  
This paper extends our own technique, Flow Updating, which is immune to message loss, to operate in dynamic networks, improving its fault tolerance characteristics.  ...  Experimental results show that the novel version of Flow Updating vastly outperforms previous averaging algorithms; it self adapts to churn without requiring any periodic restart, supporting node crashes  ...  FLOW UPDATING FOR DYNAMIC NETWORKS Flow Updating [15] is a recent averaging based aggregation approach, which works for any network topology and tolerates faults.  ... 
doi:10.1109/srds.2010.13 dblp:conf/srds/JesusBA10 fatcat:x3blsbzdpje5fj2ta2xgrgsqfq

Improving Fault Tolerance and Accuracy of a Distributed Reduction Algorithm

Gerhard Niederbrucker, Hana Strakova, Wilfried N. Gansterer
2012 2012 SC Companion: High Performance Computing, Networking Storage and Analysis  
We show that the new push-cancel-flow algorithm exhibits superior accuracy, performance and fault tolerance over all other existing distributed reduction methods.  ...  Moreover, state-of-the-art fault tolerant distributed reduction algorithms may experience accuracy problems even in failure free systems.  ...  ACKNOWLEDGMENT The research was funded by the Austrian Science Fund (FWF) under project number S10608.  ... 
doi:10.1109/sc.companion.2012.89 dblp:conf/sc/NiederbruckerSG12 fatcat:exp66cq4v5hwvhxacs6fd3tkxe

Flow updating: Fault-tolerant aggregation for dynamic networks

Paulo Jesus, Carlos Baquero, Paulo Sérgio Almeida
2015 Journal of Parallel and Distributed Computing  
This paper describes and evaluates a fault tolerant distributed aggregation technique, Flow Updating, which overcomes the problems in previous averaging approaches and is able to operate on faulty dynamic  ...  Realistic concerns have been taken into account in evaluating Flow Updating, like the use of unreliable failure detectors and asynchrony, targeting its application to realistic environments. characteristics  ...  Flow Updating Flow Updating [9, 10] is a recent averaging based aggregation approach, which works for any network topology and tolerates faults.  ... 
doi:10.1016/j.jpdc.2015.02.003 fatcat:wswqbci3zzgpbmzg2laqiegtv4

Aggregation protocols in light of reliable communication

Ziad Kassam, Ali Shoker, Paulo Sergio Almeida, Carlos Baquero
2017 2017 IEEE 16th International Symposium on Network Computing and Applications (NCA)  
We show that resolving communication failures at the communication layer, through a simple reliable communication layer, reduces the overhead of using alternative fault tolerance techniques at upper layers  ...  Aggregation protocols allow for distributed lightweight computations deployed on ad-hoc networks in a peer-to-peer fashion.  ...  ., 3) , it is recommended to avoid using FU unless the perturbation in the values is tolerable by the application; the alternative is to use other Flow-Updating variants like [6] , [15] only if high  ... 
doi:10.1109/nca.2017.8171346 dblp:conf/nca/KassamSAB17 fatcat:lo6uma57gnhzpcsqbhiexzbxdm

Scalable and fault tolerant orthogonalization based on randomized distributed data aggregation

Wilfried N. Gansterer, Gerhard Niederbrucker, Hana Straková, Stefan Schulze Grotthoff
2013 Journal of Computational Science  
A new fault tolerant distributed orthogonalization method rdmGS, which can produce accurate results even in the presence of node failures, is built on top of distributed data aggregation algorithms.  ...  For this purpose, a new aggregation algorithm for summing or averaging distributed values, the push-flow algorithm, is developed, which achieves superior resilience properties with respect to failures  ...  Acknowledgement Financial support was provided by the Austrian Science Fund (FWF): S10608 (NFN SISE).  ... 
doi:10.1016/j.jocs.2013.01.006 pmid:24748902 pmcid:PMC3990450 fatcat:ougt47runrearmmiwdzerq22qm

Architecture of a Cloud-based Fault-Tolerant Control Platform for improving the QoS of Social Multimedia Applications on SD-WAN

Kashinath Basu, Aws Hamdullah, Frank Ball
2020 2020 13th International Conference on Communications (COMM)  
The architecture includes a real time cloud-based centralized storage of the flow states north of the controllers and a virtualized connection management unit at the south.  ...  This will prevent the switches from forwarding any new traffic, as well as flow entries from existing traffic will also time out after a period bringing the network to a standstill.  ...  RELATED WORK The SD-WAN controller manages the flow entries of the forwarding switches by sending the required commands that either create new or update existing flow entries within the flow tables in  ... 
doi:10.1109/comm48946.2020.9142038 fatcat:3anazyikbnge3fp7oirwaalq7e

PortLand

Radhika Niranjan Mysore, Andreas Pamboris, Nathan Farrington, Nelson Huang, Pardis Miri, Sivasankar Radhakrishnan, Vikram Subramanya, Amin Vahdat
2009 Proceedings of the ACM SIGCOMM 2009 conference on Data communication - SIGCOMM '09  
This paper considers the requirements for a scalable, easily manageable, fault-tolerant, and efficient data center network fabric.  ...  We leverage this observation in the design and implementation of PortLand, a scalable, fault tolerant layer 2 routing and forwarding protocol for data center environments.  ...  Two aggregation switches detect the failure in step 2 and notify the fabric manager, which in turn updates its fault matrix in step 3.  ... 
doi:10.1145/1592568.1592575 dblp:conf/sigcomm/MysorePFHMRSV09 fatcat:joc3qarcwrdkpjefhfjbwgs4tu

Proactive Fault Tolerant Routing Protocol for Mobile WSN

2019 VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE  
Recent research works have resulted in the design of many innovative protocols for MWSN, however there are many unresolved issues like fault tolerance, connectivity, reducing the energy consumption, enhancing  ...  A fault tolerant network is thus created. V. FLOW CHART The flow chart is depicted in Fig 3 . VI. RESULTS AND DISCUSSIONS The protocol was implemented and simulated using MATLAB R2013a.  ...  Providing a fault tolerant communication for Mobile Wireless Sensor Network is a daunting work. In this paper it is achieved by updating a proactive routing table and isolating the faulty nodes.  ... 
doi:10.35940/ijitee.l3656.119119 fatcat:5aogl7krhfhrhmzvu2i74mrwae

RedPlane

Daehyeok Kim, Jacob Nelson, Dan R. K. Ports, Vyas Sekar, Srinivasan Seshan
2021 Proceedings of the 2021 ACM SIGCOMM 2021 Conference  
In this paper, we design and implement RedPlane, a fault-tolerant state store for stateful in-switch applications.  ...  However, a key missing piece remains: fault tolerance. This is especially critical as the network is no longer stateless and pure endpoint recovery does not suffice.  ...  This work was supported in part by the CONIX Research Center, one of six centers in JUMP, a Semiconductor Research Corporation (SRC) program sponsored by DARPA, and by NSF award 1700521.  ... 
doi:10.1145/3452296.3472905 fatcat:ckke2hzzf5d5tjmetni73hmxja

Efficient Fault-Tolerant Routing in IoT Wireless Sensor Networks Based on Bipartite-Flow Graph Modeling

Jenn-Wei Lin, Pethuru Raj Chelliah, Meng-Chieh Hsu, Jia-Xin Hou
2019 IEEE Access  
INDEX TERMS Internet of Things (IoT), wireless sensor networks (WSN), cluster based routing, fault tolerance, flow graph algorithm.  ...  Then, the flow graph modeling is used to achieve fault tolerance with the minimum total energy consumption among all failurefree CHs.  ...  By comparing E r i and E o j , D r i and E o j are updated. The fault-tolerant transmission tuples are collected in CH ft .  ... 
doi:10.1109/access.2019.2894002 fatcat:eazzdoutdjgpvg4ookhfgfiu7m

AN OPTIMAL DATA AGGREGATION SCHEME FOR WIRELESS SENSOR NETWORK USING QOS PARAMETERS WITH EFFICIENT FAILURE DETECTION AND LOSS RECOVERY TECHNIQUE

Adam Raja Basha, Calpakkam Yaashuwanth
2019 Neural Network World  
In order to save energy in WSN the concept of aggregator node is introduced, where the aggregator node would act as a mid-point between the source and destination node during the data transmission.  ...  The data aggregation process creates major problems like excess energy expenditure, and delay.  ...  [30] have presented a technique called MDFU: Mass Distribution with Flow-Updating protocol using the Flow Updating concept to classic Mass Distribution in WSN.  ... 
doi:10.14311/nnw.2019.29.019 fatcat:z73q5lbf3jdzjbtcxdypxfjvu4
« Previous Showing results 1 — 15 out of 17,418 results