{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:18:07Z","timestamp":1648761487358},"reference-count":17,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2018,3]]},"abstract":"<jats:p> The repackable Log<jats:sub>2<\/jats:sub>(N, 0, p) network, wherein repacking activities are required during departures but not upon arrivals, was proposed by Lin and Lea in a study on multi-Log<jats:sub>2<\/jats:sub>N networks. Due to their complexity, Log<jats:sub>2<\/jats:sub>(N, m, p) networks are considerably more difficult to analyze compared with Log<jats:sub>2<\/jats:sub>(N, 0, p) networks. In this paper, we successfully extend the repackable Log<jats:sub>2<\/jats:sub>(N, 0, p) networks to Log<jats:sub>2<\/jats:sub>(N, m, p) networks. In addition, the proposed routing algorithm is shown to be an optimal algorithm according to the total number of planes required. Furthermore, an analysis tool is proposed for studying repackable Log<jats:sub>2<\/jats:sub>(N, m, p) networks and is applied to show that each wide-sense nonblocking Log<jats:sub>2<\/jats:sub>(8, 0, p) network requires the same total number of planes as a strictly nonblocking network under any possible routing strategy. <\/jats:p>","DOI":"10.1142\/s0219265918500032","type":"journal-article","created":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T03:28:55Z","timestamp":1522898935000},"page":"1850003","source":"Crossref","is-referenced-by-count":0,"title":["Repackable Log<sub>2<\/sub>(<i>N, m, p<\/i>) Networks and Wide-Sense Nonblocking Log<sub>2<\/sub>(8, 0, <i>p<\/i>) Networks"],"prefix":"10.1142","volume":"18","author":[{"given":"BEY-CHI","family":"LIN","sequence":"first","affiliation":[{"name":"Dept Applied Math, NUTN Tainan, Taiwan 70005, R.O.C"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2018,4,4]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.61445"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.103045"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1109\/26.664299"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1109\/26.823564"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1109\/26.87179"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.860073"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.818093"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.048"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.08.026"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1109\/26.1460"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1987.1096722"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2013.2240653"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094428"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1109\/26.231967"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2003.1235591"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1016\/j.aeue.2007.03.022"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1109\/26.52664"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265918500032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T16:24:37Z","timestamp":1565195077000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265918500032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":17,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2018,4,4]]},"published-print":{"date-parts":[[2018,3]]}},"alternative-id":["10.1142\/S0219265918500032"],"URL":"https:\/\/doi.org\/10.1142\/s0219265918500032","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}