BLOCKING PROBABILITIES IN LARGE CIRCUIT-SWITCHED NETWORKS

[1] AKINPELU JM, 1983, 10TH INT TEL C

[2] APPLEBY M, 1983, BRIT TELECOM J WIN, P4

[3] INSENSITIVITY OF BLOCKING PROBABILITIES IN A CIRCUIT-SWITCHING NETWORK [J]. JOURNAL OF APPLIED PROBABILITY, 1984, 21 (04) : 850 - 859

[4] QUEUING-NETWORKS - A SURVEY OF THEIR RANDOM-PROCESSES [J]. SIAM REVIEW, 1985, 27 (03) : 335 - 403

[5] Everitt D. E., 1983, British Telecom Technology Journal, V1, P37

[6] Feller W., 1968, INTRO PROBABILITY TH, V1st

[7] END-TO-END BLOCKING FOR CIRCUIT-SWITCHED NETWORKS - POLYNOMIAL ALGORITHMS FOR SOME SPECIAL CASES [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (12) : 1269 - 1273

[8] DYNAMIC ROUTING AND CALL REPACKING IN CIRCUIT-SWITCHED NETWORKS [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (12) : 1290 - 1294

[9] Gnedenko B.V., 1968, THEORY PROBABILITY

[10] Gondran M., 1984, GRAPHS ALGORITHMS

[1] AKINPELU JM, 1983, 10TH INT TEL C

[2] APPLEBY M, 1983, BRIT TELECOM J WIN, P4

[3] INSENSITIVITY OF BLOCKING PROBABILITIES IN A CIRCUIT-SWITCHING NETWORK [J]. JOURNAL OF APPLIED PROBABILITY, 1984, 21 (04) : 850 - 859

[4] QUEUING-NETWORKS - A SURVEY OF THEIR RANDOM-PROCESSES [J]. SIAM REVIEW, 1985, 27 (03) : 335 - 403

[5] Everitt D. E., 1983, British Telecom Technology Journal, V1, P37

[6] Feller W., 1968, INTRO PROBABILITY TH, V1st

[7] END-TO-END BLOCKING FOR CIRCUIT-SWITCHED NETWORKS - POLYNOMIAL ALGORITHMS FOR SOME SPECIAL CASES [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (12) : 1269 - 1273

[8] DYNAMIC ROUTING AND CALL REPACKING IN CIRCUIT-SWITCHED NETWORKS [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (12) : 1290 - 1294

[9] Gnedenko B.V., 1968, THEORY PROBABILITY

[10] Gondran M., 1984, GRAPHS ALGORITHMS