Skip to main content
SpringerLink
Log in

Concept d’extensivité pour un réseau de Clos et probabilité de blocage pour un système à trois étages

The concept of extensivity for clos networks and blocking probability for three stage networks

  • Published:
Annales des Télécommunications Aims and scope Submit manuscript

Analyse

Les auteurs introduisent le concept d’extensivité utile pour l’étude de modèles réduits d’autocommutateurs. Le calcul de la probabilité de blocage pour un réseau de clos à 3 étages est effectué pour diverses stratégies d’acheminement. Les résultats sont comparés à ceux obtenus par la formule de Lee dans le cas de la stratégie aléatoire. On en déduit une évaluation des différentes stratégies d’acheminement.

Abstract

The authors introduce the concept of extensivity which is useful in the study of switching networks models of reduced size. They calculate blocking probability for different routing rules and deduce an evaluation of this different routing rules. The results are compared to the Lee formula in the case of random hunting rule.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Bibliographie

  1. Bonomi (E.),Feix (M. R.),Hebuterne (G.). Théorie de l’information. Structure et modélisation d’un réseau de connexions.Ann. Télécommunic., Fr (1980),35, n∘ 12, pp. 39–59.

    MATH  Google Scholar 

  2. Bonomi (E.),Lutton (J. L.),Feix (M. R.). Telephone networks: statistical mechanics and non random connecting procedures. Numerical methods in the studies of critical phenomena. Carry-le-Rouet, Fr., 1er juin 1980,Springer, Berlin (1981).

    Google Scholar 

  3. Bonomi (E.). Modélisation d’un réseau de connexion: approche par la mécanique statistique. Thèse 3e cycle,Univ. Orléans (1980).

  4. Benes (V. E.). Mathematical theory of connecting networks.Academic Press, New-York (1965), pp. 80–260.

    MATH  Google Scholar 

  5. Jaynes (T.). Where do we stand on maximum entropy ? In « The maximum entropy formalism ».MIT press, Cambridge (1979).

    Google Scholar 

  6. Lee (C. Y.). Analysis of switching networks.Bell Syst. tech. J., USA (1955),34, n∘ 6, pp. 1287–1317.

    Google Scholar 

  7. Grinsec. Commutation électronique. Coll. techn. Scient. Télécom.Eyrolles, Paris (1908).

    Google Scholar 

  8. Karnaugh (M.). Loss of point to point traffic in three stage circuit switches.IBM J. Res. Develop. (1974),18, n∘ 3, pp. 204–216.

    Article  MATH  Google Scholar 

  9. Bazlen (D.),Kampe (G.),Lotze (A.). Design parameters and loss calculation of link systems.IEEE Trans. COM, USA (1974),22, n∘ 12, pp. 1908–1932.

    Article  Google Scholar 

  10. Le Gall (P.). Méthode de calcul de l’encombrement dans les systèmes téléphoniques à marquages.Ann. Télécommunic., Fr (1957),12, n∘ 11, pp. 374–386.

    Google Scholar 

  11. Syski (R.). Introduction to congestion theory in telephone Systems.Oliver and Boyd. Edinburgh and London (1960).

    MATH  Google Scholar 

  12. Bassalygo (L. A.),Tsybakov (B. S.). Blocking probability for a rearrangeable switching system.Problemi Peredachi Informatisa (1972),6, n∘ 4, pp. 66–80.

    Google Scholar 

  13. Benes (V. E.). Programming and control problems arising from optimal routing in telephone networks.Bell Syst. tech. J., USA (1966),45, n∘ 9, pp. 1373–1439.

    MATH  MathSciNet  Google Scholar 

  14. Akiyama (M.). Rearrangements in time division system.Electr. and Comm. in Japan (1968), 51-A, n∘ 4.

  15. Inose (H.). The blocking probability and junctor capacity of a three-stage time division switching network.Jour. IECE, Jap. (1961),44, n∘ 6, p. 934.

    Google Scholar 

  16. Lotze (A.), Roder (A.), Thierev (G.). PPL-A reliable method for the calculation of point-to-point loss in link systems. Proc. 8thITC, Melbourne (1976), pp. 547-1-14.

  17. Elldin (A.). A study on congestion in link systems.Ericsson techn., Sweden (1961),17, n∘ 2, pp. 183–259.

    Google Scholar 

  18. Bazlen (D.), Kampe (G.), Lotze (A.). On the influence of hunting mode and link wiring on the loss of link systems. Proc. 7thITC, Stockholm (1973).

  19. Urmoneit (W.). Reduction of the rank of system of linear equations to be solved for calculation of loss probability of link systems. Proc. 9thITC, Torremolinos (1979).

  20. Kubale (M.). Worst-case analysis of some algorithms for rearranging three-stage connection networks. Proc. 9thITC, Torremolinos (1979).

  21. Hwang (F. K.). Three-stage multiconnection networks which are non blocking in the wide sense.Bell. Syst. tech. J., USA (1979),58, n∘ 10, pp. 2183–2187.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CRPE, av. de la Recherche Scientifique, 45045, Orléans

    Ernesto Bonomi & Marc Roy Feix

  2. Actuellement au CNET-PAA, ATR. 92131, Issy-les-Moulineaux

    Jean-Luc Lutton

Authors
  1. Ernesto Bonomi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Luc Lutton
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marc Roy Feix
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bonomi, E., Lutton, JL. & Feix, M.R. Concept d’extensivité pour un réseau de Clos et probabilité de blocage pour un système à trois étages. Ann. Télécommun. 37, 239–256 (1982). https://doi.org/10.1007/BF02995621

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02995621

Mots clés

Key words

Search

Navigation