Evolutionary autonomic design framework for self-organizing Future Internet

| Permalink

Symeon Papavassiliou and Vasileios Karyotis

5 March 2012

Modelling the complex interactions among physical, logical and social networks leads to a self-correcting, self-improving loopback design.

The Future Internet is expected to comprise a plethora of self-organizing autonomic devices1 of varying capabilities and levels of intelligence, collaborating to accomplish actions that cannot be achieved otherwise. As the number and complexity of interactions increases, an inherent tradeoff between the gains and costs of collaboration emerges. In a dynamic and operationally efficient way, systems must strike an appropriate balance between two basic challenges. The first is that given behavioural (e.g. application-oriented) characteristics and requirements, what structure, subject to constraints, optimizes performance? The second is that under the constraints of a given structure, how well can a desired behaviour be executed?

Following this paradigm, we anticipate that the Future Internet-connected world will be not simply a collection of linked asynchronous nodes but a multi-loop feedback network of distributed asynchronous dynamic systems, active databases and knowledge bases. Network science has lately grown into a multi-discipline research area devoted to the identification, modelling and analysis of complex networks and interactions in all manner of natural and artificial settings.2 Historical advances and evolution in contemporary network science have led to the identification and practical employment of a three-level model: physical, logical and social. At the ground level are physical networks, where node associations correspond one-to-one to physical connectivity. At the second level are logical networks, based on virtual associations and connectivity among peers. The third level, denoted social networks, involves more complex interactions and takes into account mainly unpredictable or hidden associations, including application-specific requirements.

Traditional network design flow has not yet achieved the full potential of this three-layer model. For example, although logical networks are built on top of physically interconnected nodes, their connectivity properties may differ significantly, as may be seen in peer-to-peer or wireless ad-hoc networks. In fact, network designers often redesign the physical infrastructure of networks to meet requirements posed at the logical level, especially in wireless systems, where reconfiguration is technically and economically viable. Similarly, logical networks impact social networks, as can be readily observed from studying preferential attachment in the derivation of social networks from logical ones.

Several features of social networks are appropriate when addressing some of the deficiencies of the physical topologies now in use (e.g. wireless multi-hop networks). Of particular interest are the preferential attachment rule, the small-world phenomenon, and scale-free structures,3 which tend to manifest themselves via such indicators as a small average path length, high clustering and connectivity robustness in the presence of random failures. Several efforts, including ours, have suggested mapping these social features onto communication networks.4, 5 It has, for example, been shown that small-world features can optimally address such problems as distributed consensus in wireless multi-hop networks.6 A key part of our research has been to devise a distributed autonomic framework that efficiently achieves these objectives without significantly impacting other critical characteristics of the network infrastructure. An example is shown in Figure 1, which was obtained by an inverse topology control mechanism.5


Model of network evolution. (a) Initial network. (b) Links added. (c) Nodes added. (d) Finally induced network.

Achieving this goal in a dynamic wireless multi-hop network requires that researchers:5, 7 focus on closing the loop between social and physical networking in the design paradigm; exploit ways in which social knowledge and the features of online social networks can improve the characteristics of physical communication networks; demonstrate feasibility by infusing the desired properties of online social structures (small-world effect, power-law-like degree distribution) into existing dynamic infrastructures, such as the core structure of wireless multi-hop networks; use inverse topology control-based techniques to modify communication links in multi-hop networks; analyse interactivity through a continuum-theory-based framework,8 hyperbolic graph theory,9 game theory10 and systems of ordinary differential equations;5 and identify the underlying research challenges that must be addressed for a more holistic treatment and exploitation of the vision of evolutionary design.

Thus, in order to set the norm for future holistic network design approaches, what is required is not simply an extension of the traditional design hierarchy but rather the development of a novel framework. This not only takes into account both directions of the interactions among physical, logical and social network viewpoints, but more importantly it aspires to close the loop along the traditional design and analysis hierarchy, potentially leading to an autonomic evolutionary loop.1 According to this paradigm, the network's progressive advance to more complex features will spur changes in the fundamental operations from which those features emanate, igniting a new evolutionary loop that produces additional advances, as seen in Figure 2.


A proposed autonomic design framework for context-aware and socially driven heterogeneous Internet-connected object networks. As the two loops indicate, evolution proceeds in both directions.

In order for an underlying network architecture to improve its own efficiency evolutionarily, by dynamically modifying its structure and features, it must have increased capabilities, including awareness of its environment, state and type. The whole universe of interactions within the digital and physical worlds must be traversed by following a bidirectional path: bottom-up, for aggregating and processing data collected by physical sensing objects and using it for situation awareness and decisionmaking at higher levels; and top-down, for compiling application demands into performance-improving topology modifications (sensing requests and control actions) over the logical and physical infrastructure, taking into account the properties and features of social networks.




Authors

Symeon Papavassiliou
National Technical University of Athens (NTUA)

Symeon Papavassiliou is an associate professor of electrical and computer engineering at NTUA. His areas of expertise include dynamic complex communication networks. He is a senior member of IEEE, associate editor for IEEE Transactions on Parallel and Distributed Systems and technical editor for IEEE Wireless Communications Magazine.

Vasileios Karyotis
National Technical University of Athens (NTUA)

Vasileios Karyotis is a researcher with the NETMODE lab of the School of Electrical and Computer Engineering at NTUA. His research focus includes complex communication networks and distributed computation. He is a member of IEEE and the Technical Chamber of Greece.


References
  1. Array

  2. T. G. Lewis, Network Science: Theory and Practice, John Wiley and Sons, Hoboken, NJ, 2009.

  3. M. E. J. Newman, The structure and function of complex networks, Soc. Ind. Appl. Math. (SIAM) Rev. 45 (2), pp. , 2003.

  4. A. Helmy, Small worlds in wireless networks, IEEE Commun. Lett. 7 (10), pp. , 2003.

  5. E. Stai, V. Karyotis and S. Papavassiliou, Topology enhancement in wireless multi-hop networks: a top-down approach, IEEE Trans. Para. Dist. Syst., 2011.

  6. P. Hovareshti and J. S. Baras, Consensus problems on small world graphs: a structural study, Proc. Int'l Conf. Complex Syst., 2006.

  7. E. Stai, V. Karyotis and S. Papavassiliou, A socially-driven topology improvement framework with applications in content distribution and trust management, J. Internet Svcs. Appl. (JISA) 2 (2), pp. , 2011.

  8. S. Papavassiliou and J. Zhu, A continuum theory-based approach to modeling of dynamic wireless sensor networks, IEEE Commun. Lett. 9 (4), pp. , 2005.

  9. A. Cvetkovski and M. Crovella, Hyperbolic embedding and routing for dynamic graphs, Proc. 28th IEEE Conf. Comp. Commun. (INFOCOM), pp. 1, 2009.

  10. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler and T. Roughgarden, The price of stability for network design with fair cost allocation, SIAM J. Comp. 38 (4), pp. , 2008.


 
DOI:  10.2417/3201202.004029

Stay Informed