Improving the gossiping effectiveness with distributed strategic learning (Invited paper)

Gossiping is a widely known and successful approach to reliable communications, tolerating packet losses and link crashes. It has been extensively used in several middleware kinds, such as event notification services and application domains, like infrastructures for air traffic management, power grid control, health information exchange, just to cite some of them. Despite achieving a high loss-tolerance and scalability degrees, gossiping is affected by degraded performances and heavy traffic loads on the network. For this reason, it may be not optimal in applications where reliability must be provided jointly with timeliness and/or in congestion-prone networks. The crucial aspect for improving a gossiping scheme is deciding which nodes should receive a gossiping message, and our driving idea is to adopt a distributed strategic learning logic to determine such nodes in an efficient manner. This is able to resolve gossipings weakness points and to achieve better performance and reduced traffic loads.This paper describes how to introduced strategic learning in a gossip scheme so as to determine the best set of nodes that can be used to send gossip messages and to optimize their utility. Such a solution has been experimentally assessed through a set of simulations demonstrating the effectiveness of the proposal.

[1]  Ali Ghodsi,et al.  Eventual consistency today: limitations, extensions, and beyond , 2013, CACM.

[2]  Richard S. Sutton,et al.  Learning to predict by the methods of temporal differences , 1988, Machine Learning.

[3]  Haishu Lu,et al.  On the Existence of Pure Strategy Nash Equilibrium for Non-cooperative Games in L-convex Spaces , 2007, 2009 International Conference on Intelligent Human-Machine Systems and Cybernetics.

[4]  Chen-Nee Chuah,et al.  Characterization of Failures in an Operational IP Backbone Network , 2008, IEEE/ACM Transactions on Networking.

[5]  Öznur Özkasap,et al.  Flat and hierarchical epidemics in P2P systems: Energy cost models and analysis , 2014, Future Gener. Comput. Syst..

[6]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[7]  Sagar Naik,et al.  SGBR: A Routing Protocol for Delay Tolerant Networks Using Social Grouping , 2013, IEEE Transactions on Parallel and Distributed Systems.

[8]  E. Gilbert.  Capacity of a burst-noise channel , 1960 .

[9]  Shu Lin,et al.  Automatic-repeat-request error-control schemes , 1984, IEEE Communications Magazine.

[10]  James S. Thorp,et al.  Adaptive Gravitational Gossip: A Gossip-Based Communication Protocol with User-Selectable Rates , 2009, IEEE Transactions on Parallel and Distributed Systems.

[11]  Anne-Marie Kermarrec,et al.  Epidemic information dissemination in distributed systems , 2004, Computer.

[12]  Daxin Tian,et al.  An adaptive vehicular epidemic routing method based on attractor selection model , 2016, Ad Hoc Networks.

[13]  Giuseppe De Pietro,et al.  An event-based notification approach for the delivery of patient medical information , 2014, Inf. Syst..

[14]  Ben Y. Zhao,et al.  Determining model accuracy of network traces , 2006, J. Comput. Syst. Sci..

[15]  Fabio Panzieri,et al.  Server consolidation in Clouds through gossiping , 2011, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[16]  Rachid Guerraoui,et al.  Unconscious Eventual Consistency with Gossips , 2006, SSS.

[17]  Roberto Beraldi,et al.  Achieving Reliable and Timely Event Dissemination over WAN , 2012, ICDCN.

[18]  Roberto Beraldi,et al.  Reliable and Timely Event Notification for Publish/Subscribe Services Over the Internet , 2014, IEEE/ACM Transactions on Networking.

[19]  Robbert van Renesse.  Power-Aware Epidemics , 2002, SRDS.

[20]  Chi-Sheng Shih,et al.  Service Recovery for Large Scale Distributed Publish and Subscription Services for Cyber-Physical Systems and Disaster Management , 2014, 2014 IEEE International Conference on Cyber-Physical Systems, Networks, and Applications.

[21]  Amir H. Payberah,et al.  Vitis: A Gossip-based Hybrid Overlay for Internet-scale Publish/Subscribe Enabling Rendezvous Routing in Unstructured Overlay Networks , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[22]  Mike Burmester,et al.  Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks , 2007, Ad Hoc Networks.

[23]  Valerio Schiavoni,et al.  Lightweight, efficient, robust epidemic dissemination , 2013, J. Parallel Distributed Comput..

[24]  Qiang Ni,et al.  Design and Analysis of Multicast-Based Publisher/Subscriber Models over Wireless Platforms for Smart Grid Communications , 2012, 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications.

[25]  Hamidou Tembine.  Distributed Strategic Learning for Wireless Engineers , 2017 .

[26]  H.-G. Gross,et al.  Testing Challenges of Maritime Safety and Security Systems-of-Systems , 2008, Testing: Academic & Industrial Conference - Practice and Research Techniques (taic part 2008).

[27]  Joel J. P. C. Rodrigues,et al.  Enhanced fuzzy logic‐based spray and wait routing protocol for delay tolerant networks , 2016, Int. J. Commun. Syst..

[28]  Robert Simon,et al.  A Simulation Analysis of Multicasting in Delay Tolerant Networks , 2006, Proceedings of the 2006 Winter Simulation Conference.

[29]  Anne-Marie Kermarrec,et al.  The many faces of publish/subscribe , 2003, CSUR.

[30]  Domenico Cotroneo,et al.  A Reliable Crisis Information System to Share Data after the Event of a Large-Scale Disaster , 2015, 2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing.

[31]  Anne-Marie Kermarrec,et al.  Efficient and adaptive epidemic-style protocols for reliable and scalable multicast , 2006, IEEE Transactions on Parallel and Distributed Systems.

[32]  Laurent Massoulié,et al.  Epidemic live streaming: optimal performance trade-offs , 2008, SIGMETRICS '08.

[33]  Domenico Cotroneo,et al.  On reliability in publish/subscribe services , 2013, Comput. Networks.

[34]  E. O. Elliott.  Estimates of error rates for codes on burst-noise channels , 1963 .

[35]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[36]  Hai Jin,et al.  Probabilistic routing algorithm based on contact duration and message redundancy in delay tolerant network , 2016, Int. J. Commun. Syst..

[37]  Pushpendra Singh,et al.  A pub/sub based architecture to support public healthcare data exchange , 2015, 2015 7th International Conference on Communication Systems and Networks (COMSNETS).

[38]  Joel J. P. C. Rodrigues,et al.  GeoSpray: A geographic routing protocol for vehicular delay-tolerant networks , 2014, Inf. Fusion.

[39]  Georgios Gardikis,et al.  A multi-mission service platform for satellite-based wide area surveillance , 2014, 2014 International Conference on Telecommunications and Multimedia (TEMU).

[40]  Marcello Cinque,et al.  On data dissemination for large-scale complex critical infrastructures , 2012, Comput. Networks.

[41]  Márk Jelasity,et al.  Adaptive Peer Sampling with Newscast , 2009, Euro-Par.

[42]  Ji Li,et al.  Dependency-based Distributed Intrusion Detection , 2007, DETER.

[43]  Miguel Castro,et al.  Scribe: a large-scale and decentralized application-level multicast infrastructure , 2002, IEEE J. Sel. Areas Commun..