Knowledge Dissemination for Autonomic Network

Autonomic computing is a new paradigm inspired by the biological world. It allows networks to self-organize control decisions. To ensure an efficient self-organization, an autonomic network must define a new distributed and decentralized plane containing all the network knowledge, called "knowledge plane". In this paper, we propose a new knowledge dissemination mechanisms in order to maintain this knowledge plane. The developed approach is composed by three modules to address scalability and interoperability issues: (1) cluster the network nodes and elect a leader for each cluster to contain the knowledge, (2) use an overlay network to disseminate knowledge between leaders for interoperability concerns and, (3)disseminate only useful knowledge to nodes in each cluster to reduce the amount of knowledge to be distributed. To evaluate our approach, we construct a knowledge plan based on QoE measurement. Numerical results obtained for IPTV different traffics level merged on operators network show that our approach improves clearly performances regarding load balancing charges.

[1]  Anujan Varma,et al.  Distributed algorithms for multicast path setup in data networks , 1996, TNET.

[2]  David D. Clark,et al.  A knowledge plane for the internet , 2003, SIGCOMM '03.

[3]  Jeffrey O. Kephart,et al.  Research challenges of autonomic computing , 2005, Proceedings. 27th International Conference on Software Engineering, 2005. ICSE 2005..

[4]  Abdelhamid Mellouk,et al.  QoE Model Driven for Network Services , 2010, WWIC.

[5]  Guy Pujolle,et al.  Piloting the spanning tree protocol in home networks using a multi-agent system , 2008, 2008 1st IFIP Wireless Days.

[7]  Jeffrey O. Kephart,et al.  The Vision of Autonomic Computing , 2003, Computer.

[8]  David E. Culler,et al.  A blueprint for introducing disruptive technology into the Internet , 2003, CCRV.

[9]  Michael Wooldridge,et al.  Intelligence agents: Theory and practice , 1994 .

[10]  Doug Terry,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[11]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[12]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[13]  Rudolf Hornig,et al.  An overview of the OMNeT++ simulation environment , 2008, Simutools 2008.

[14]  Melbourne Barton,et al.  Efficient flooding with passive clustering-an overhead-free selective forward mechanism for ad hoc/sensor networks , 2003 .

[15]  Michael Wooldridge,et al.  Intelligent agents: theory and practice The Knowledge Engineering Review , 1995 .

[16]  Bruce S. Davie,et al.  A programmable overlay router for service provider innovation , 2009, PRESTO '09.

[17]  Peter Han Joo Chong,et al.  3hBAC (3-hop between adjacent clusterheads): a novel non-overlapping clustering algorithm for mobile ad hoc networks , 2003, 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490).

[18]  Jerome H. Saltzer,et al.  End-to-end arguments in system design , 1984, TOCS.

[19]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[20]  Nicholas R. Jennings,et al.  Intelligent agents: theory and practice , 1995, The Knowledge Engineering Review.

[21]  Gérard Le Lann,et al.  Distributed Systems - Towards a Formal Approach , 1977, IFIP Congress.