Complex Behavior in Networks with Distributed Routing

  • Andrzej Rucinski
  • Peter Drexel
  • Barbara Dziurla
Part of the Frontiers of Computing Systems Research book series (FCSR, volume 2)


The area of distributed systems is the focus of much current interest. However, there exists an apparent discrepancy between the character of these systems and their commonly used formal models as reported, for instance, in [1]. The notion of a global system state in distributed systems is difficult to formulate because of its complexity, non-linearity and unpredictability. Representative challenges include: the need for an integrated theory of correctness, timeliness and reliability at each level of abstraction in large-scale, distributed, dynamic computation; the development of techniques for extracting many states; the construction of heuristic and localized scheduling procedures to overcome the NP-hardness of adaptive scheduling algorithms; and the skillful incorporation of the time metrics to a study of interplays between steps in the reconfiguration — processing cycle. There are also “classic” problems concerning communication, cooperation, and consistency. Above all, there is a desperate need for a descriptive method of complexity.


Cellular Automaton Complex Behavior Mesh Network Reductionist Model Energy Field 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Challenges to control: A collective view, IEEE Trans. on Automatic Control, vol. AC-32(4), pp.275–285 (1987).Google Scholar
  2. [2]
    D.P. Bertsekas and J.N. Tsitsiklis, Parallel and distributed computation. Numerical methods, Prentice Hall, Englewood Cliffs, New Jersey (1989).zbMATHGoogle Scholar
  3. [3]
    Yu-Chi Ho, Performance evaluation of perturbation analysis of discrete event dynamic systems, IEEE Trans. on Automatic Control, vol. AC-32(7), pp. 563–572 (1987).Google Scholar
  4. [4]
    A.E. Convay and N.D. Georganas, Queuing networks — exact computational algorithms: a unified theory based on decomposition and aggregation, The MIT Press, Cambridge, Massachusetts (1989).Google Scholar
  5. [5]
    F.F. Soulie, Y. Robert, and M. Tchuente, Automata networks in computer science. Theory and applications, Princeton University Press, Princeton, New Jersey (1987).Google Scholar
  6. [6]
    A. Paz, Introduction to probabilistic automata, Academic Press, New York (1971).zbMATHGoogle Scholar
  7. [7]
    T.M. Liggett, Interacting particle systems, Springer Verlag, New York and Berlin (1985).zbMATHCrossRefGoogle Scholar
  8. [8]
    S.A. Levin, Spatial patterning and the structure of ecological communities, in Some mathematical questions in biology, The American Mathematical Society, Providence, RI, pp. 3–35 (1976).Google Scholar
  9. [9]
    S.E. Johnson and A.H. Levis, eds., Science of command and control: coping with uncertainty, AFCEA International Press, Washington, DC (1988).Google Scholar
  10. [10]
    T.L. Casavant and J.G. Kuhl, A formal model of distributed decision making and its application to distributed load balancing, Proc. of the 6th Int. Conf. on Distr. Comp. Systems, pp. 232–239 (1986).Google Scholar
  11. [11]
    H. Haken, Synergetics. An introduction. Nonequilibrium phase transitions and selforganization in physics, chemistry, and biology, Springer Verlag, Heidelberg and New York (1983).Google Scholar
  12. [12]
    R.L. Devaney, An introduction to chaotic dynamical systems, R.L. Devaney, ed., Addison-Wesley, Reading, Massachusetts (1989).Google Scholar
  13. [13]
    D. Stauffer, Introduction to percolation theory, Taylor & Francis, London and Philadelphia (1985).zbMATHCrossRefGoogle Scholar
  14. [14]
    H.E. Stanley and N. Ostrowsky, eds., Random fluctuation and pattern growth: experiments and models, Kluwer, Dordrecht (1989).Google Scholar
  15. [15]
    A. Kandel, Fuzzy mathematical techniques with applications, Addison-Wesley, Reading, Massachusetts (1986).zbMATHGoogle Scholar
  16. [16]
    T. Tatsumi, ed., Turbulence and chaotic phenomena in fluids, North Holland, Amsterdam (1984).zbMATHGoogle Scholar
  17. [17]
    J.A. Glazier and A. Libchaber, Quasi-periodicity and dynamical systems: an experimentalist’s view, IEEE Trans. Circuits and Systems, vol.35(7), pp. 790–809 (1988).MathSciNetCrossRefGoogle Scholar
  18. [18]
    H. Haken, ed., Computational systemsnatural and artificial, Springer Verlag, Heidelberg and New York (1987).Google Scholar
  19. [19]
    J.L. McCauley, An introduction to non-linear dynamics and chaos theory, Physica Scripta, vol. T120 (1988).Google Scholar
  20. [20]
    L.O. Chua, ed., Proceedings of the IEEE. Special issue on chaotic systems, vol. 75(8) (1987).Google Scholar
  21. [21]
    R.W. Newcomb and N. El-Leithy, Chaos generation using binary hysteresis, Circuits, Systems and Signal Processing, vol.5(3), pp. 321–341 (1986).MathSciNetzbMATHCrossRefGoogle Scholar
  22. [22]
    L.O. Chua and T. Lin, Chaos in digital filters, IEEE Trans. Circuits and Systems, vol.35(6), pp. 648–658 (1988).MathSciNetCrossRefGoogle Scholar
  23. [23]
    C. Vidal, Dynamic instabilities observed in the Bielousov- Zhabotin-skij system, in Chaos and order in nature, H. Haken (ed.), Springer Verlag, Heidelberg and New York, pp.69–82 (1981).CrossRefGoogle Scholar
  24. [24]
    J.L. McCauley, Chaotic dynamical systems as automata, Z. Naturforsch., vol. 42 a, pp. 547–555 (1986).MathSciNetGoogle Scholar
  25. [25]
    D. Martland, Dynamic behavior of Boolean networks, in Neural computing architectures, I. Aleksander (ed.), The MIT Press, Cambridge, Massachusetts, pp. 217–235 (1989).Google Scholar
  26. [26]
    R. Shaw, Modelling chaotic systems, in Chaos and order in nature, H. Haken (ed.), Springer Verlag, Heidelberg and New York, pp. 218–231 (1981).CrossRefGoogle Scholar
  27. [27]
    B.A. Huberman, The ecology of computation, in Studies in Computer Science and Artificial Intelligence, D.G Bobrow et al, eds., North Holland, Amsterdam and New York (1988).Google Scholar
  28. [28]
    J.O. Kephart, T. Hogg, and B.A. Huberman, Dynamics of computa tional ecosystems, Physical Review A, vol. 40(1), pp. 404–421 (1989).MathSciNetCrossRefGoogle Scholar
  29. [29]
    C.P. Bachas and B.A. Huberman, Complexity and the relaxation of hierarchical structures, Physical Review Letters, vol. 57(16), pp. 1965–1969 (1986).MathSciNetCrossRefGoogle Scholar
  30. [30]
    C.P. Bachas and B.A. Huberman, Complexity and ultradiffusion, J. Phys, A: Math. Gen., vol.20, pp. 4995–5014 (1987).MathSciNetCrossRefGoogle Scholar
  31. [31]
    H.A. Ceccatto and B.A. Huberman, The complexity of hierarchical systems, Physica Scripta, vol. 37(1), pp. 145–150 (1988).MathSciNetzbMATHCrossRefGoogle Scholar
  32. [32]
    B.A. Huberman and T. Hogg, Complexity and adaptation, Physica D, vol. 22D(l-3), pp. 376–384 (1986).MathSciNetGoogle Scholar
  33. [33]
    W.P. Keirstad and B.A. Huberman, Dynamical singularities in ultradiffusion, Physical Review A, vol. 36(ll),pp. 5392–5340 (1987).CrossRefGoogle Scholar
  34. [34]
    B.A. Huberman and T. Hogg, Phase transitions in artificial intelligence systems, Artificial Intelligence, vol. 33(2), pp. 155–171 (1987).CrossRefGoogle Scholar
  35. [35]
    G. Deutscher, Application of percolation, in Chance and Matter, J. Souletie, J. Vannimenus, and R. Stora, eds., North Holland, Amsterdam, pp. 1–70 (1987).Google Scholar
  36. [36]
    S.H. Unger, A computer oriented towards spatial problems, Proc. Inst. Radio Eng., vol. 46, pp. 1744–50 (1958).Google Scholar
  37. [37]
    H. Falk, Reaching for the gigaflop, IEEE Spectrum, vol. 13(10), pp. 65–70 (1976).MathSciNetGoogle Scholar
  38. [38]
    K.E. Batcher, Design of a massively parallel processor, IEEE Trans. Comput., vol. C-29, pp. 836–840 (1980).CrossRefGoogle Scholar
  39. [39]
    T. Toffoli and N. Margolus, Cellular automata machines. A new environment for modeling, The MIT Press, Cambridge, Massachusetts (1987).Google Scholar
  40. [40]
    S.Y. Kung, VLSI array processors, Prentice Hall, Englewood Cliffs, New Jersey (1988).Google Scholar
  41. [41]
    S.K. Tewksbury and L.A. Hornak, Future physical environments and concurrent computation, in Concurrent Computations: Algorithms, architecture, and technology, S.K. Tewksbury, B.W. Dickinson, and S.C. Schwartz (eds.), Plenum Press, New York and London, pp. 65–86 (1988).Google Scholar
  42. [42]
    S.K. Tewksbury and L.A. Hornak, Communication network issues and high-density interconnects in large-scale distributed computing systems, IEEE Journal on Selected Areas in Communications, vol. 6(3), pp. 587–609 (1988).CrossRefGoogle Scholar
  43. [43]
    B.A. Coan, A compiler that increases the fault tolerance of asynchronous protocols, IEEE Trans. Comp., vol. 37(12), pp. 1541–1553 (1988).MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Plenum Press, New York 1991

Authors and Affiliations

  • Andrzej Rucinski
    • 1
  • Peter Drexel
    • 1
  • Barbara Dziurla
    • 1
  1. 1.Intelligent Structures Group, Dept. of Electrical and Computer Eng.University of New HampshireDurhamUSA

Personalised recommendations