{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T13:00:39Z","timestamp":1761397239902,"version":"build-2065373602"},"reference-count":23,"publisher":"Elsevier BV","issue":"18","license":[{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2001,7,22]],"date-time":"2001-07-22T00:00:00Z","timestamp":995760000000},"content-version":"vor","delay-in-days":721,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[1999,8]]},"DOI":"10.1016\/s1389-1286(98)00024-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:57:10Z","timestamp":1027637830000},"page":"1891-1910","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum delivery time and hot spots in ServerNetTM topologies"],"prefix":"10.1016","volume":"31","author":[{"given":"D.R","family":"Avresky","sequence":"first","affiliation":[]},{"given":"V","family":"Shurbanov","sequence":"additional","affiliation":[]},{"given":"R","family":"Wilkinson","sequence":"additional","affiliation":[]},{"given":"R","family":"Horst","sequence":"additional","affiliation":[]},{"given":"W","family":"Watson","sequence":"additional","affiliation":[]},{"given":"L","family":"Young","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(98)00024-3_BIB1","doi-asserted-by":"crossref","unstructured":"V.S. Adve, M.K. Vernon, Performance analysis of mesh interconnection networks with deterministic routing, IEEE Trans. Parallel and Distributed Systems 5 (3) (March 1994) 225\u2013246.","DOI":"10.1109\/71.277793"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB2","unstructured":"G. Almasi, A. Gottlieb, Highly Parallel Computing, Benjamin\/Cummings Publishing Co., 1994."},{"key":"10.1016\/S1389-1286(98)00024-3_BIB3","doi-asserted-by":"crossref","unstructured":"W.E. Baker, R.W. Horst, D.P. Sonnier, W.J. Watson, A flexible ServerNet-based fault-tolerant architecture, in: Proc. of the 25th Int. Symp. Fault-Tolerant Computing, Pasadena, CA, June 1995, pp. 2\u201311.","DOI":"10.1109\/FTCS.1995.466982"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB4","doi-asserted-by":"crossref","unstructured":"R.V. Boppana, S. Chalasani, A comparison of adaptive wormhole routing algorithms, Computer Architecture News 21 (2) (May 1993) 351\u2013360.","DOI":"10.1145\/173682.165177"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB5","doi-asserted-by":"crossref","unstructured":"J.T. Brassil, R.L. Cruz, Bounds on maximum delay in networks with deflection routing, IEEE Trans. Parallel and Distributed Systems 6 (7) (July 1995) 724\u2013731.","DOI":"10.1109\/71.395401"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB6","doi-asserted-by":"crossref","unstructured":"A. Chai, S. Ghosh, Modeling and distributed simulation of a broadband-isdn network, Computer 26 (9) (September 1993) 37\u201351.","DOI":"10.1109\/2.231279"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB7","unstructured":"B. Chen, H. Li, W. Zhao, Meeting delay requirements in computing networks with wormhole routing, 16th International Conference on Distributed Computing Systems, 1996."},{"key":"10.1016\/S1389-1286(98)00024-3_BIB8","doi-asserted-by":"crossref","unstructured":"C.M. Cunningham, D.R. Avresky, Fault-tolerant adaptive routing for two-dimensional meshes, in: Proc. First IEEE Symp. on High Performance Architecture, Raleigh, NC, January 1995, pp. 122\u2013131.","DOI":"10.1109\/HPCA.1995.386549"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB9","doi-asserted-by":"crossref","unstructured":"W.J. Dally, C.L. Seitz, Deadlock-free message routing in multiprocessor interconnection networks, IEEE Trans. Computers 36 (May 1987) 547\u2013553.","DOI":"10.1109\/TC.1987.1676939"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB10","unstructured":"R.V. Hogg, E.A. Tanis, Probability and Statistical Inference, Macmillan Publishing Co., Inc., 1988."},{"key":"10.1016\/S1389-1286(98)00024-3_BIB11","doi-asserted-by":"crossref","unstructured":"R.W. Horst, Tnet: A reliable system area network, IEEE Micro (February 1995) 37\u201345.","DOI":"10.1109\/40.342016"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB12","doi-asserted-by":"crossref","unstructured":"R.W. Horst, ServerNet deadlock avoidance and fractahedral topologies, in: Proc. IEEE Int. Par. Proc. Symp., Honolulu, HI, April 1996, pp. 274\u2013280.","DOI":"10.1109\/IPPS.1996.508069"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB13","doi-asserted-by":"crossref","unstructured":"R.W. Horst, D.R. Avresky, R. Wilkinson, D. Jewett, W. Watson, L. Young, C. Cunningham, Performance modeling of ServerNetTM topologies, in: Proc. IEEE Int. Par. Proc. Symp., Honolulu, HW, April 1996, pp. 518\u2013523.","DOI":"10.1109\/IPPS.1996.508105"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB14","unstructured":"R. Jain, The Art of Computer Systems Performance Analysis, Wiley, New York, 1991."},{"key":"10.1016\/S1389-1286(98)00024-3_BIB15","doi-asserted-by":"crossref","unstructured":"C. Leiserson, Fat-trees: Universal networks for hardware-efficient supercomputing, IEEE Trans. Computers 34 (October 1985) 892\u2013901.","DOI":"10.1109\/TC.1985.6312192"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB16","doi-asserted-by":"crossref","unstructured":"C.L. Liu, J.W. Layland, Scheduling algorithms for multiprogramming in a hard real-time environment, J. ACM 30 (1) (January 1973) 46\u201361.","DOI":"10.1145\/321738.321743"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB17","doi-asserted-by":"crossref","unstructured":"L.M. Ni, P.K. McKinley, A survey of wormhole routing techniques in direct networks, Computer 26 (2) (February 1993) 62\u201376.","DOI":"10.1109\/2.191995"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB18","unstructured":"L. Ott, An Introduction to Statistical Methods and Data Analysis, PWS-KENT Publishing Co., 1988."},{"key":"10.1016\/S1389-1286(98)00024-3_BIB19","doi-asserted-by":"crossref","unstructured":"G.F. Pfister, V.A. Norton, `hot spot' contention and combining in multistage interconnection networks, IEEE Trans. Computers C-34 (October 1985) 933\u2013938.","DOI":"10.1109\/TC.1985.6312198"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB20","doi-asserted-by":"crossref","unstructured":"G.D. Pifarre, L. Gravano, S.A. Felperin, L.C. Sanz, Fully adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks: Algorithms and simulation, IEEE Trans. Parallel and Distributed Systems 5 (3) (March 1994) 247\u2013263.","DOI":"10.1109\/71.277792"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB21","doi-asserted-by":"crossref","unstructured":"D. Reed, R. Fujimoto, Multicomputer Networks: Message-Based Parallel Processing, MIT Press, Cambridge, MA, 1987.","DOI":"10.7551\/mitpress\/4792.001.0001"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB22","doi-asserted-by":"crossref","unstructured":"S.L. Scott, G.S. Sohi, Using feedback to control tree saturation in multistage interconnection networks, in: Proc. 16th Ann. Int. Symp. Computer Architecture, May 1989, pp. 167\u2013176.","DOI":"10.1145\/74925.74945"},{"key":"10.1016\/S1389-1286(98)00024-3_BIB23","doi-asserted-by":"crossref","unstructured":"M.C. Wang, H.J. Siegel, M.A. Nichols, S. Abraham, Using a multipath network for reducing the effects of hot spots, IEEE Trans. Parallel and Distributed Systems 6 (3) (July 1995) 252\u2013268.","DOI":"10.1109\/71.372775"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128698000243?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128698000243?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:57:04Z","timestamp":1761397024000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128698000243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":23,"journal-issue":{"issue":"18","published-print":{"date-parts":[[1999,8]]}},"alternative-id":["S1389128698000243"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(98)00024-3","relation":{},"ISSN":["1389-1286"],"issn-type":[{"type":"print","value":"1389-1286"}],"subject":[],"published":{"date-parts":[[1999,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Maximum delivery time and hot spots in ServerNetTM topologies","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1389-1286(98)00024-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}