<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>7651</REFNUM><AUTHORS><AUTHOR>Alzeidi,N.</AUTHOR><AUTHOR>Ould-Khaoua,M.</AUTHOR><AUTHOR>Khonsari,A.</AUTHOR></AUTHORS><YEAR>2004</YEAR><TITLE>A queueing model for wormhole routing with finite buffers</TITLE><PLACE_PUBLISHED>20th Annual UK Performance Engineering Workshop (UKPEW' 2004), University of Bradford, UK, July 2004</PLACE_PUBLISHED><PUBLISHER>N/A</PUBLISHER><PAGES>94-103</PAGES><ISBN>0-95410000-3-4</ISBN><LABEL>Alzeidi:2004:7651</LABEL><ABSTRACT>Analytical models for wormhole routing in hypercube have widely been reported in the literature. Most of these models, however, have assumed negligible input buffer sizes. Hu and Kleinrock in [8] have proposed an analytical model that captures the effect of finite input buffer size for irregular high-speed LANs while Kouvatsos, Assi, and Ould-Khaoua [11] have very recently proposed a model based on results from the maximum entropy method (MEM). In this paper, we develop an alternative analytical model for wormhole routing with finite buffers based on M/G/1 queueing systems. The validity of our new model is demonstrated by comparing analytical results with those obtained from simulation experiments for the hypercube topology</ABSTRACT></RECORD></RECORDS></XML>