Please use this identifier to cite or link to this item:
http://edoc.bseu.by:8080/handle/edoc/85061
Title: | On rearrangeable networks with at most one reswitching |
Authors: | Schehrer, R. G. |
Keywords: | rearrangeable networks;networks;сети |
Issue Date: | 2001 |
Publisher: | Белорусский государственный экономический университет |
Language: | Английский |
Type: | Article |
Citation: | Schehrer, R. G. On rearrangeable networks with at most one reswitching / R. G. Schehrer // Информационные сети, системы и технологии = Information Networks, Systems and Technologies : в 3 кн. Кн.1 : Труды международной конференции ICINASTe'2001, Минск, 2-4 октября 2001 г. : на англ. яз. / Ред.: А.Н. Морозевич [и др.]. - Мн. : БГЭУ, 2001. - С. 14-21. |
Abstract: | It is well known that (applying usual notatios according to fig) tree stage connecting networks with m>r are non-blocking, if the method of rearrangement is applied, and that at most r-1 reswitchings are necessary. Pauli [4] stated that the number of reswitchings may be reduced by increasing the number m of middle switches. He showed that for networks with r=n and m=2n-2, the reswitching of one connection is always. In the present paper it is shown that for networks with m=2n-2, one reswitching is always sufficient .The results of this paper Figure 1. (m, n, r) switching network are proved by means of simple considerations and illustrated by examples. |
URI: | http://edoc.bseu.by:8080/handle/edoc/85061 |
ISBN: | 985-426-692-3 |
Appears in Collections: | Информационные сети, системы и технологии = Information Networks, Systems and Technologies |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Schehrer_R.G..pdf | 500.49 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.