{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:08:22Z","timestamp":1699834102888},"reference-count":4,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":10176,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1978,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study a class of five\u2010stage connecting networks which are generalizations of the AMDF networks recently proposed. The terminals of a network in this class are partitioned into various zones while two terminals of the same zone have a larger number of distinct paths connecting them than two terminals of different zones. Furthermore, to facilitate the analysis of blocking probabilities, we require that the linear graphs (union of all connecting paths) for all intrazone pairs of terminals be isomorphic and fixed, and the linear graphs for all interzone pairs be isomorphic.<\/jats:p><jats:p>We show that balanced incomplete block designs can be used to construct large classes of such networks. For a fixed number of distinct paths, we also determine the symmetric linear graph which has the smallest blocking probability, and show that the network which yields this linear graph (for interzone pairs) can always be constructed if a certain balanced incomplete block design exists.<\/jats:p>","DOI":"10.1002\/net.3230080403","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T09:22:22Z","timestamp":1178875342000},"page":"287-296","source":"Crossref","is-referenced-by-count":1,"title":["Link designs and probability analyses for a class of connecting networks"],"prefix":"10.1002","volume":"8","author":[{"given":"F. K.","family":"Hwang","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"Bergeron R. F. \u201cExpanded Full Access Fully Flexible Networks for AMDF \u201d unpublished memo Bell Laboratories 1974."},{"key":"e_1_2_1_3_2","unstructured":"Hagelbarger D. W. \u201cThe Application of Balanced Symmetric Incomplete Block Designs to Switching Networks \u201dConference Record of IEEE International Conference on Communications Montreal Canada 1971 pp.40\u20105\u201340\u20103."},{"key":"e_1_2_1_4_2","volume-title":"Combinatorial Theory","author":"Hall M.","year":"1967"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1955.tb03799.x"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230080403","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230080403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T08:37:41Z","timestamp":1699778261000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230080403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,12]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1978,12]]}},"alternative-id":["10.1002\/net.3230080403"],"URL":"https:\/\/doi.org\/10.1002\/net.3230080403","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,12]]}}}