Advertisement

Automation and Remote Control

, Volume 63, Issue 1, pp 49–57 | Cite as

Performance Quality of Re-Routing Networks: Influence of Equipment Failure

  • K. A. Zaretskii
  • V. I. Meikshan
  • N. A. Melentsova
Article
  • 23 Downloads

Abstract

An algorithm is designed for computing “throughput” service quality characteristics of circuit-switched re-routing networks with regard for the influence of undetected failures in commutation devices if crankbacking is used for switching. Experimental results are presented.

Keywords

Mechanical Engineer System Theory Service Quality Quality Characteristic Performance Quality 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

REFERENCES

  1. 1.
    Ivanov, A.B. and Sokolov, I.V., From Isolated Measurements, Analysis, Testing to Thorough Network Control, Elektrosvyaz', 1999, no. 12, pp. 35–40.Google Scholar
  2. 2.
    Ivanov, A.B. and Sokolov, I.V., From Thorough Network Control to Service Quality Control, Elektrosvyaz', 2001, no. 2, pp. 37–41.Google Scholar
  3. 3.
    Vegener, R.R., Zaretskii, K.A., Smetanin, L.D., et al., Reliability and Technical Service of Automatic Telephone Exchange Stations with Programmed Control, in Spravochnoe posobie (A Handbook), Dedoborshch, V.G. and Sutorikhin, N.B., Eds., Moscow: Radio i Svyaz', 1989.Google Scholar
  4. 4.
    Meikshan, V.I., A Method of Computing Service Quality for Circuit-switched Networks with Faulty Connection Lines: Modeling of Information Networks, Trudy VTs SO RAN, Ser.Informatika., 1994, vol. 1, pp. 43–56.Google Scholar
  5. 5.
    Meikshan, V.I. and Fidel'man, I.G., Circuit-switched Communication Networks with Retrial Calls and Faulty Connection Lines: Their Design, Elektrosvyaz', 1994, no. 12, pp. 12–14.Google Scholar
  6. 6.
    Meikshan, V.I. Performance Analysis for Circuit-switched Networks with Alternate Routing and Faulty Components, Econ.Quality Control, 1998, vol. 13, no. 1, pp. 5–15.Google Scholar
  7. 7.
    Lazarev, V.G. and Lazarev, Yu.V., Dinamicheskoe upravlenie potokami informatsii v setyakh svyazi (Dynamic Control for Information Flows in Communication Networks), Moscow: Radio i Svyaz', 1983.Google Scholar
  8. 8.
    Chemouil, P., Filipiak, J., and Gauthier, P., Performance Issues in the Design of Dynamically Controlled Circuit-switched Networks, IEEE Commun.Magaz., 1990, pp. 90–95.Google Scholar
  9. 9.
    Clark, M.P., Networks and Telecommunication: Design and Operation, New York: Wiley, 1997.Google Scholar
  10. 10.
    Hurley, B.R., Seidl, C.J.R., and Sewell, W.F., A Survey of Dynamic Routing Methods for Circuit switched Traffic, IEEE Commun.Magaz., 1987, vol. 25, no. 9, pp. 13–21.Google Scholar
  11. 11.
    Davydov, G.B., Roginskii, V.N., and Tolchan, A.Ya., Seti elektrosvyazi (Telecommunication Networks), Moscow: Svyaz', 1977.Google Scholar
  12. 12.
    Meikshan, V.I., Estimation of the Service Quality of Excess Load Flows by a Group of Faulty Connection Devices, Elektrosvyaz', 1991, no. 7, pp. 18–20.Google Scholar
  13. 13.
    Zaretskii, K.A. and Meikshan, V.I., Moments of Served and Excess Loads for a Completely Accessible Bundle Containing Faulty Lines, in Analiz i modelirovanie signalov i sistem svyazi (Analysis and Modeling of Signals and Communication Systems), St. Petersburg, 1994, pp. 55–62.Google Scholar
  14. 14.
    Meikshan, V.I. and Mikhailova, Ts.Ts., Peak-Factors of Served and Excess Loads for a Bundle with Faulty Lines under Non-Gaussian Arrivals, in Obrabotka signalov v sistemakh svyazi (Processing of Signals in Communication Systems), St. Petersburg, 1995, vol. 160, pp. 141–148.Google Scholar
  15. 15.
    Kaul', S.B., An Iterational Method of Analysis for Swithched-Circuit Networks. in Sistemnoe modelirovanie-12: Sb.nauch.tr.VTs SO AN SSSR, Novosibirski, 1987, pp. 3–12.Google Scholar
  16. 16.
    Reingold, E.M., Nievergelt, J., and Deo, M., Combinatorial Algorithms: Theory and Practice, Englewood Cliffs: Prentice-Hall, 1977. Translated under the title Kombinatornye algoritmy, Moscow: Mir, 1980.Google Scholar
  17. 17.
    Harary, F., Graph Theory, London: Addison-Wesley, 1969. Translated under the title Teoriya grafov, Moscow: Mir, 1973.Google Scholar

Copyright information

© MAIK “Nauka/Interperiodica” 2002

Authors and Affiliations

  • K. A. Zaretskii
    • 1
  • V. I. Meikshan
    • 1
  • N. A. Melentsova
    • 1
  1. 1.Siberian State University of Telecommunication and InformaticsNovosibirskRussia

Personalised recommendations