Distributed Systems: Resilience, Desperation

  • Igor SchagaevEmail author
  • Stephen Farrell


Major drawbacks of existing distributed systems, including networking are discussed. To cope with them we introduce a new design concept of performance-, reliability-, energy- smart system, applied for distributed system and networking. Our approach of distributed system handling was called a desperation control, which introduce and explain. It assumes introduction of new routing algorithms for routing and for package handling inside routers. We claim that state of a system as a whole as well as state of a package should be considered and treated in concert varying ways of package handlings. Shown that proposed approach at order of magnitude boosts performance and reliability of network making it suitable for real-time packages and widening applications for really important applications: existing technologies and billions of devices should serve and make people better. Using elements of graph theory, we analyze and compare proposed algorithms with known, explaining our advantages. Weighted costs of each segment of package path, combined with vector heuristic introduced and enriched by graph-logic extension for each routing table makes proposed concept the best so far from all known. Resilience of distributed computer systems as well as networking therefore becomes improved, extending application domain to the really important applications like safety critical, military, banking, health real-time monitoring, transport and similar.


  1. 1.
    Castano V, Schagaev I. Resilient computer system design. Scholar
  2. 2.
    Schagaev I, Kaegi-Trachsel T. Software design for resilient computer systems. Scholar
  3. 3.
    Schagaev I, Kirk B. Active system control. Scholar
  4. 4.
    Schagaev I (1990) Yet another approach to classification of redundancy. In: CIM IMEKO symposium, Helsinki, pp 117–124Google Scholar
  5. 5.
    Schagaev I, Monkman S (2013) Redundancy + Reconfigurability = Recoverability. Electronics 2:212–233. Scholar
  6. 6.
    Schagaev I, Sogomonoyan E (1988) Hardware and software for a fault tolerant computing system. In: Automation and remote control, vol 49, no 2, part 1. Pergamon Press, 10 July 1988Google Scholar
  7. 7.
    Blaeser L, Monkman S, Schagaev I. Vision on reconfigurable systems, Chapter 10, [1]Google Scholar
  8. 8.
    Brockmeyer E, Halstrom HL, Jensen A (1948) The life and works of A. K. Erlang, 2nd edn. Danish Academy of Technical ScienceGoogle Scholar
  9. 9.
    Jackson JR (1957) Networks of waiting lines. Oper Res 5:518–521MathSciNetCrossRefGoogle Scholar
  10. 10.
    Morse PM (1958) Queues, inventories and maintenance. Wiley, New YorkCrossRefGoogle Scholar
  11. 11.
    Kleinrock L (1964) Communication nets: stochastic message flow and design. McGraw-Hill, p 220. ISBN 978-0486611051Google Scholar
  12. 12.
    Leon-Garsia A et al. Communication networks. McGraw Hill. ISBN-0-07-246352Google Scholar
  13. 13.
  14. 14.
    Chartrand G, Lesniak L (2005) Graphs and digraphs, 4th edn. Chapman &Hall/CRC. ISBN 1-58488-390-1Google Scholar
  15. 15.
  16. 16.
  17. 17.
    Dijkstra EW (1968) Cooperating sequential processes. In: Hansen PB (ed) The origin of concurrent programming. Springer, New York, NYGoogle Scholar
  18. 18.
    Azan et al. System software support for router reliability. In: 30th IFAC workshop on real-time programming and 4th international workshop on real-time software (WRTP/RTS’09)Google Scholar
  19. 19.
    Fuller V, Li T, Yu J, Varadhan K (1993) Classless inter-domain routing, IETF RFC 1519Google Scholar
  20. 20.
  21. 21.
    Schagaev I et al. On performance of distributed computer systems. In: WorldComp16, 28 July 2016.

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.IT-ACS LtdStevenageUK

Personalised recommendations