Gossiping for Autonomic Estimation of Network-Based Parameters in Dynamic Environments

Future networks are becoming larger in scale, more dynamic and heterogeneous. In such environments, adaptation of algorithms in the current networking conditions is necessary in order to increase the efficiency and performance of the deployed mechanisms. Knowledge of network based parameters may facilitate the decision making processes in a dynamic environment. Self-awareness will help the network to diagnose faults and realize the current status and, thus, proceed to self-optimization actions. In this paper, a neighbour to neighbour gossiping mechanism is proposed for autonomic estimation of network based parameters. The described mechanism is evaluated in terms of message exchanges and convergence time until accurate parameters' estimation.

[1]  Jean-Philippe Martin-Flatin,et al.  Self-Managed Networks, Systems, and Services , 2006, Lecture Notes in Computer Science.

[2]  Harilaos Koumaras,et al.  QoE and *-awareness in the Future Internet , 2009, Future Internet Assembly.

[3]  John Strassner,et al.  Proceedings of the 4th IEEE International Workshop on Modelling Autonomic Communications Environments , 2009 .

[4]  Gregoris Mentzas,et al.  NEURON: Enabling Autonomicity in Wireless Sensor Networks , 2010, Sensors.

[5]  Robbert van Renesse,et al.  Gossip-based distribution estimation in peer-to-peer networks , 2008, IPTPS.

[6]  Marie-Pierre Gleizes,et al.  Engineering Self-organising Systems , 2011, Self-organising Software.

[7]  Márk Jelasity,et al.  Gossip-based aggregation in large dynamic networks , 2005, TOCS.

[8]  David Hausheer,et al.  Towards the Future Internet - A European Research Perspective , 2009, Future Internet Assembly.

[9]  Anne-Marie Kermarrec,et al.  Ordered Slicing of Very Large-Scale Overlay Networks , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[10]  Devavrat Shah.  Network gossip algorithms , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[11]  Weidong Liu,et al.  A loosely synchronized gossip-based algorithm for aggregate information computation , 2008, 2008 33rd IEEE Conference on Local Computer Networks (LCN).

[12]  Márk Jelasity,et al.  T-Man: Gossip-Based Overlay Topology Management , 2005, Engineering Self-Organising Systems.

[13]  Gregoris Mentzas,et al.  Integrating Overlay Protocols for Providing Autonomic Services in Mobile Ad-Hoc Networks , 2010, IEICE Trans. Commun..

[14]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.

[15]  Dominique Gaïti,et al.  Decentralized Aggregation Protocols in Peer-to-Peer Networks: A Survey , 2009, MACE.

[16]  Takumi Miyoshi,et al.  A novel gossip-based sensing coverage algorithm for dense wireless sensor networks , 2009, Comput. Networks.

[17]  Konrad Iwanicki,et al.  Gossip-Based Clock Synchronization for Large Decentralized Systems , 2006, SelfMan.

[18]  Pascal Felber,et al.  Network-Friendly Gossiping , 2009, SSS.

[19]  Quanyuan Wu,et al.  A Bandwidth Efficient Overlay for Information Exchange in Pervasive Computing Environment , 2008, 2008 International Conference on Computer Science and Software Engineering.

[20]  Robbert van Renesse,et al.  A Gossip-Style Failure Detection Service , 2009 .