Switching Networks with Bandwidth Reservation and Point-to-Group Selection

• Autorzy: Stasiak M. , Głąbowski M.

Warianty tytułu

PL

Pola komutacyjne z rezerwacją przepływności i selekcją punkt-grupa

• Języki publikacji: EN

Abstrakty

EN

This paper a new approximate model of a switching network with reservation to which a mixture of different multi-rate traffic streams is offered. Four reservation algorithms for multiservice switching networks are proposed and compared. These algorithms lead to changes of blocking probabilities for different traffic streams in the switching networks. In particular cases, reservation algorithms can be used for blocking probability equalization of a certain number or for all traffic streams offered. The method of point-to-group blocking probability calculation in the multi-service switching networks with reservation algorithms is also presented in the paper. The proposed method is based on the effective availability concept. Special attention is paid to the procedures for determination of the effective availability in the multi-service switching network with reservation. The results of analytical calculations of the probabilities of blocking are compared with the results of digital simulation of therestage switching networks with reservation, and therefore, the validity of the assumption used in the model is proved.

PL

W artykule zaproponowano algorytmy rezerwacji dla pól komutacyjnych integracją z integracją usług. Opracowane algorytmy umożliwiają uprzywilejowanie pewnych klas ruchu w dostępie do zasobów sieci. W szczególnym przypadku, mogą one prowadzić do wyrównania prawdopodobieństwa blokady zgłoszeń wybranych lub wszystkich klas ruchu integracją węzłach sieci integracją usług. W artykule zaproponowano także nową przybliżoną metodę obliczeń prawdopodobieństwa blokady punkt-grupą w wielosekcyjnych polach komutacyjnych z rezerwacją przepływności, którym oferowany jest ruch zintegrowany. Szczególną uwagę zwrócono na metodę określania efektywnej dostępności, która bezpośrednio wpływa na dokładność rezultatów końcowych. Rezultaty obliczeń numerycznych porównano z danymi symulacji pól komutacyjnych obsługujących ruch zintegrowany.

• Wydawca: Instytut Informatyki Teoretycznej i Stosowanej Polskiej Akademii Nauk
• Czasopismo: Archiwum Informatyki Teoretycznej i Stosowanej
• Rocznik: 2003
• Tom: T. 15, z. 4
• Strony: 297--321
• Opis fizyczny: Bibliogr. 37 poz., wykr.

Twórcy

autor

Stasiak M.

autor

Głąbowski M.

• Institute of Electronics and Telecommunications, Poznań University of Technology, ul. Piotrowo 3A, 60965 Poznań, Poland,

Bibliografia

• [1] J.W. Roberts, Ed., Performance Evaluation and Design of Multiservice Networks, Final Report COST 224, Commission of the European Communities, Brussels, Holland, 1992.
• [2] J.W. Roberts, V. Mocci, and I. Virtamo, Eds., Broadband Network Teletraffic, Final Report of Action COST 242, Commission of the European Communities, Springer Verlag, Berlin, Germany. 1996.
• [3] H. Akimuru and K. Kawashima, Teletraffic. Theory and Application, Springer Verlag, 1993.
• [4] K. Lindberger, "Blocking for multislot heterogeneous traffic streams offered to a trunk group with reservation,” in Proceeding of the 5th ITC Seminar, Lake Como, 1987.
• [5] K. Kawashima, Trunk reservation models in telecommunication systems, vol. Teletraffic Analysis and Computer Performance Evaluation of Studies in Telecommunication, North Holland, Amsterdam, Holland, 1986.
• [6] J.W. Roberts, “Teletraffic models for the Telcom 1 integrated services network,” in Proceedings of 10th International Tcletraffic Congress, Montreal. Canada, 1983, p. 1.1.2.
• [7] P. TranGia and F. Hubner, “An analysis of trunk reservation and grade of service balancing mechanisms in multiservice broadband networks,” in Proceedings of International Teletraffic Congress Seminar, La Martynique, 1993, vol. Modeling and Performance Evaluation of ATM Technology.
• [8] M. Stasiak, M. Głabowski. and P. Zwierzykowski, “Equalisation of blocking probability in systems with limited availability,” in Proceedings of 5th IFIP Workshop on Performance Modeling and Evaluation of ATM Networks. Ilkly, UK, July 1997, pp. 54/1-54/10.
• [9] M. Stasiak, M. Głabowski, and P. Zwierzykowski, “Equalisation of blocking probability in switching systems with limited availability,” in Performance Analysis of ATM Networks, D. Kouvatsos, Ed., pp. 358-376. Kluwer Academic Publishers, Boston, 2000.
• [10] J. Conradt and A. Buchheister, “Considerations on loss probability of multislot connections,” in Proceedings of 11th International Teletraffic Congress, Kyoto, Japan, 1985, pp. 4.4B-2.1.
• [11] M.E. Beshai and D.R. Manfield, “Multichannel services performance of switching networks,” in Proceedings of 12th International Teletraffic Congress, Torino, Italy, 1988, p. 5.1A.7, North Hollan- dElsevier Science Publishers.
• [12] A. Ziram. A.L. Beylot, and M. Becker. “Computing call blocking in a 3 stage ATM with sequential routing,” in 7th International Conference on Computer Communications and Networks, IC3N’98, Lafayette, Louisiana, USA, Oct. 1998.
• [13] A. Ziram, A.L. Beylot, and M. Becker, “Using an aggregation method for the multiple ressource sharing problem in a multiservice environment,” in 6th International Conference on Telecommunication Systems: Modelling and Analysis, Nashville, USA, Mar. 1998, pp. 176-182.
• [14|G. Danilewicz and W. Kabacnski, “Widesense nonblocking multicast ATM switching networks,” Journal of Performance Evaluation, vol. 41, no. 2-3, pp. 165-177. 2000.
• [15] Y. Yang and M. Masson, “Nonblocking broadcast switching network,” IEEE Transactions on Communications, vol. 40, no. 9, pp. 1005-1015, 1991.
• [16] Communications, vol. 42, no. 2/3/4, pp. 1352-1358, 1994.
• [17] R. Melen and J.S.Turner, “Nonblocking multirate networks,” SIAM J. Comput., vol. 18. no. 2, pp. 301-313. 1989.
• [18] M. Głabowski and M. Stasiak, “Pointtopoint blocking probability in switching networks with reservation," Annales des Télécommunications, vol. 57, no. 7-8, pp. 798-831, 2002.
• [19] M. Stasiak and M. Glqbowski, “PPBMR method of blocking probability calculation in switching networks with reservation," in Proceedings of IEEE Global Telecommunications Conference, Rio de Janeiro, Brazil, Dec. 1999, vol. la, pp. 32-36.
• [20] M. Stasiak and M. Glabowski, “Point-to-point blocking probability in switching networks with res-ervation,” in Proceedings of 16th International Teletraffic Congress, Edinburgh, UK, June 1999, vol. 3A. pp. 519-528, Elsevier Science.
• [21] N. Binida and W. Wend, “Die Effektive Erreichbarkeit fur Abnehmerbundei hinter Zwischenleitungsanungen,” NTZ, vol. 11, no. 12, pp. 579-585, 1959.
• [22] A.D. Kharkevich, “An approximate method for calculating the number of junctions in a crossbar system exchange,” Elektrosvyaz,, no. 2, pp. 55-63,1959.
• [23] A. Lotze, “Bericht über Verkehrtheoretische Untersuchungen CIRB,” Tech. Rep., Inst, fur NachrichtenVermittlung und Datenverarbeitung der Technischen Hochschule, Univ. of Stuttgart, 1963.
• [24] A. Lotze, A. Roder, and G. Thierer, “Pointtopoint loss in case of multiple marking attempts,” in Proceedings of 8th International Teletraffic Congress, Melbourne, Australia, 1976, vol. supplement to paper 547/144.
• [25] D. Bazlen, G. Kampe, and A. Lotze, “On the influence of hunting mode and link wiring on the loss of link systems,” in Proceedings of 7th International Teletraffic Congress, Stockholm, Sweden. 1973. pp. 232/1-12.
• [26] K. Rothmaier and R. Scheller, "Design of economic PCM arrays with a prescribed grade of service,” IEEE Transactions on Communications, vol. 29, no. 7, pp. 925-935, 1981.
• [27] K. Rothmaier and R. Scheller, “On the traffic capacity of PCM switching arrays as function of internal traffic and path allocation modes,” in Proceedings of 10th International Teletraffic Congress, Montreal, Canada, 1983, p. 5.1.8.
• [28] E.B. Ershova and V.A. Ershov, “Digital systems for information distribution,” Radio and Communi-cations, Moscow, pp. 89-148, 1983, in Russian.
• [29] M. Stasiak, “Blocage interne point a point dans les reseaux de connexion,” Annales des Télécommu-nications. vol. 43, no. 9-10, pp. 561-575, 1988.
• [30] O.A. Pedersen. "An effective availability theory with application,” IEEE Transactions on Communications. vol. 23, no. 8, pp. 798-803, 1975.
• [31] O.A. Pedersen, “Link system effective availabilities for pointtopoint selection,” in Proceedings of 9th International Teletraffic Congress, Torremolinos, Spain, 1979.
• [32] M. Stasiak,“Combinatorial considerations for switching systems carrying multichannel traffic streams,” Annales des Télécommunications, vol. 51, no. 11-12, pp. 611-625, 1996.
• [33] M. Stasiak, "Blocking probability in a limitedavailability group carrying mixture of different multichannel traffic streams,” Annales des Télécommunications, vol. 48, no. 12, pp. 71-76, 1993.
• [34] M. Stasiak and M. Głabowski, “A simple approximation of the link model with reservation by a onedimensional Markov chain,” Journal of Performance Evaluation, vol. 41, no. 2-3, pp. 195-208, July 2000.
• [35] J.W. Roberts, “A service system with heterogeneous user requirements — application to multiservice telecommunications systems,” in Proceedings of Performance of Data Communications Systems and their Applications, G. Pujolle, Ed., Amsterdam, Holland, 1981, pp. 423-431, North Holland.
• [36] J.S. Kaufman, "Blocking in a shared resource environment,” IEEE Transactions on Communications, vol. 29, no. 10. pp. 1474—1481. 1981.
• [37] C. Lee. “Analysis of switching networks,” Bell Systems Technical Jornal, vol. 34, no. 6, 1955.