Skip to main content
SpringerLink
Log in

Redundant Distribution of Requests Through the Network by Transferring Them Over Multiple Paths

  • Conference paper
  • First Online:
Distributed Computer and Communication Networks (DCCN 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 601))

Abstract

The research focuses on opportunities of multipath routing for providing reliability and fault-tolerance of distributed computing systems, given that requests are distributed dynamically through the network. There are proposed models for non-redundant and redundant search for available servers, which are ready to serve incoming requests. Server unavailability occurs due to faults, temporary shutdown, or overload with requests arriving from the network. An unavailable server rejects incoming requests, which thereafter underlie the flow of repeated requests, or those sent to other servers time and again, until they are finally accepted. Transferring requests repeatedly and, in case of redundant search, polling several servers simultaneously cause the increase in the network load. It is found that searching for an available server over multiple paths at once results in the decreased requests’ time in the system, provided that server availability and the intensity of request flow are not high.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

References

  1. Gunnar, A., Johansson, M.: Robust load balancing under traffic uncertainty tractable models and efficient algorithms. Telecommun. Syst. 48, 93–107 (2011)

    Article  Google Scholar 

  2. Banner, R., Orda, A.: Multipath Routing Algorithms for Congestion Minimization. CCIT Report No. 429, Dept. Electr. Eng., Technion, Haifa, Israel (2004). http://www.ee.technion.ac.il/people/ron/Congestion.pdf

  3. Hopps, C.: Analysis of an Equal-Cost Multipath Algorithm. IETF, RFC 2992 (2000). http://www.ietf.org/rfc/rfc2992

  4. McDysan, D.: QoS and Traffic Management in IP and ATM Networks. McGraw-Hill, New York (2000)

    Google Scholar 

  5. Andreev, S., Saffer, Z., Turlikov, A.: Delay analysis of wireless broadband networks with non real-time traffic. In: Sacchi, C., Bellalta, B., Vinel, A., Schlegel, C., Granelli, F., Zhang, Y. (eds.) MACOM 2011. LNCS, vol. 6886, pp. 206–217. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Bogatyrev, V.A.: Exchange of duplicated computing complexes in fault tolerant systems. Autom. Control Comput. Sci. 46(5), 268–276 (2011)

    Article  Google Scholar 

  7. Bogatyrev, V.A., Bogatyrev, S.V., Golubev, I.Y.: Optimization and the process of task distribution between computer system clusters. Autom. Control Comput. Sci. 3, 103–111 (2012)

    Article  Google Scholar 

  8. Bogatyrev, V.A.: Fault tolerance of clusters configurations with direct connection of storage devices. Autom. Control Comput. Sci. 45(6), 330–337 (2011)

    Article  Google Scholar 

  9. Bogatyrev, V.A.: An interval signal method of dynamic interrupt handling with load balancing. Autom. Control Comput. Sci. 34(6), 51–57 (2000)

    Google Scholar 

  10. Bogatyrev, V.A.: Protocols for dynamic distribution of requests through a bus with variable logic ring for reception authority transfer. Autom. Control Comput. Sci. 33(1), 57–63 (1999)

    Google Scholar 

  11. Bogatyrev, V.A., Bogatyrev, A.V.: Functional Reliability of a Real-Time Redundant Computational Process in Cluster Architecture Systems. Autom. Control Comput. Sci. 49(1), 46–56 (2015)

    Article  Google Scholar 

  12. Kleinrock, L.: Queueing Systems, vol. 1: Theory. Wiley Interscience, New York (1975)

    Google Scholar 

  13. Kleinrock, L.: Queueing Systems, vol. 2: Computer Applications. Wiley Interscience, New York (1976)

    Google Scholar 

  14. Vishnevsky, V.M.: Teoreticheskie osnovy proektirovaniya komputernykh setey (Theoretical Fundamentals for Design of Computer Networks). Tekhnosfera, Moscow (2003) (in Russian)

    Google Scholar 

  15. Aliev, T.I.: Osnovy modelirovaniya diskretnykh system (Fundamentals of simulation of discrete systems). SPbSU ITMO Publ., St. Petersburg (2009) (in Russian)

    Google Scholar 

Download references

Acknowledgments

The study is a part of two research projects: “Methods and models for providing the integrated security and stable functioning of computer systems” (State Registration Number is 610481) and “Methods for designing the key systems of information infrastructure” (State Registration Number is 615869) of ITMO University, St. Petersburg, Russia.

Author information

Authors and Affiliations

  1. ITMO University, Kronverksky Pr. 49, 197101, St. Petersburg, Russia

    V. A. Bogatyrev & S. A. Parshutina

Authors
  1. V. A. Bogatyrev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. A. Parshutina
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. A. Bogatyrev .

Editor information

Editors and Affiliations

  1. V.A. Trapeznikov Institute of Control Sc, Russian Academy of Sciences V.A. Trapeznikov Institute of Control Sc, Moscow, Russia

    Vladimir Vishnevsky

  2. V.A. Trapeznikov Inst. of Control Scienc, Russian Academy of Sciences V.A. Trapeznikov Inst. of Control Scienc, Moscow, Russia

    Dmitry Kozyrev

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Bogatyrev, V.A., Parshutina, S.A. (2016). Redundant Distribution of Requests Through the Network by Transferring Them Over Multiple Paths. In: Vishnevsky, V., Kozyrev, D. (eds) Distributed Computer and Communication Networks. DCCN 2015. Communications in Computer and Information Science, vol 601. Springer, Cham. https://doi.org/10.1007/978-3-319-30843-2_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30843-2_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30842-5

  • Online ISBN: 978-3-319-30843-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation