Skip to main content

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

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6428))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Liberal, F., Fajardo, J., Koumaras, H.: QoE and *-awareness in the Future Internet. Towards the Future Internet - A European Research Perspective. IOS Press Books, Amsterdam (2009), doi:10.3233/978-1-60750-007-0-293 ISBN 978-1-60750-007-0

    Google Scholar 

  2. Serbu, S., Rivière, É., Felber, P.: Network-Friendly Gossiping. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol. 5873, pp. 655–669. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Zafeiropoulos, A., Gouvas, P., Liakopoulos, A., Mentzas, G., Mitrou, N.: NEURON: Enabling Autonomicity in Wireless Sensor Networks. Sensors 10(5), 5233–5262 (2010)

    Article  Google Scholar 

  4. Shah, D.: Network gossip algorithms. In: Proceedings of the 2009 IEEE international Conference on Acoustics Speech and Signal Processing. ICASSP, pp. 3673–3676. IEEE Computer Society, Washington (2009)

    Chapter  Google Scholar 

  5. Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3), 219–252 (2005)

    Article  Google Scholar 

  6. Van Renesse, R., Minsky, Y., Hayden, M.: A Gossip-Style Failure Detection Service. Technical Report. UMI Order Number: TR98-1687., Cornell University (1998)

    Google Scholar 

  7. Jelasity, M., Kermarrec, A.: Ordered Slicing of Very Large-Scale Overlay Networks. In: Proceedings of the Sixth IEEE international Conference on Peer-To-Peer Computing P2P, pp. 117–124. IEEE Computer Society, Washington (2006)

    Chapter  Google Scholar 

  8. Tran-Quang, V., Miyoshi, T.: A novel gossip-based sensing coverage algorithm for dense wireless sensor networks. Comput. Netw. 53(13), 2275–2287 (2009)

    Article  MATH  Google Scholar 

  9. Haas, Z.J., Halpern, J.Y., Li, L.: Gossip-based ad hoc routing. IEEE/ACM Trans. Netw. 14(3), 479–491 (2006)

    Article  Google Scholar 

  10. Haridasan, M., Van Renesse, R.: Gossip-based Distribution Estimation in Peer-to-Peer Networks. In: International Workshop on Peer-to-Peer Systems, IPTPS 2008 (2008)

    Google Scholar 

  11. Jelasity, M., Babaoglu, O.: T-Man: Gossip-Based Overlay Topology Management. In: Brueckner, S.A., Di Marzo Serugendo, G., Hales, D., Zambonelli, F. (eds.) ESOA 2005. LNCS (LNAI), vol. 3910, pp. 1–15. Springer, Heidelberg (2006) ISBN: 978-3-540-33342-5

    Chapter  Google Scholar 

  12. Iwanicki, K., Van Steen, M., Voulgaris, S.: Gossip-based clock synchronization for large decentralized systems. In: Keller, A., Martin-Flatin, J.-P. (eds.) SelfMan 2006. LNCS, vol. 3996, pp. 28–42. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Dongsheng, P., Weidong, L., Chuang, L., Zhen, C., jiaxing, S.: A loosely synchronized gossip-based algorithm for aggregate information computation. In: 33rd IEEE Conference on Local Computer Networks LCN, pp. 451–455 (2008)

    Google Scholar 

  14. Zuo, K., Hu, D.M., Wu, Q.W.: A Bandwidth Efficient Overlay for Information Exchange in Pervasive Computing Environment. International Conference on Computer Science and Software Engineering 3, 524–527 (2008)

    Google Scholar 

  15. Gouvas, P., Zafeiropoulos, A., Liakopoulos, A., Mentzas, G., Mitrou, N.: Integrating Overlay Protocols for Providing Autonomic Services in Mobile Ad-hoc Networks. In: IEICE Communications, Special Issue on: Implementation, Experiments, and Practice for Ad Hoc and Mesh Networks, vol. E93-B(8) (August 2010)

    Google Scholar 

  16. Makhloufi, R., Bonnet, G., Doyen, G., Gaïti, D.: Decentralized Aggregation Protocols in Peer-to-Peer Networks: A Survey. In: Gonzalez, A., Pfeifer, T. (eds.) MACE 2009. LNCS, vol. 5844, pp. 111–116. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gouvas, P., Zafeiropoulos, A., Liakopoulos, A. (2010). Gossiping for Autonomic Estimation of Network-Based Parameters in Dynamic Environments. In: Meersman, R., Dillon, T., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2010 Workshops. OTM 2010. Lecture Notes in Computer Science, vol 6428. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16961-8_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16961-8_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16960-1

  • Online ISBN: 978-3-642-16961-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics