Analysis of Buffer Arrangements in Low and High Dimensional Networks

摘要: Virtual channels have been introduced to enhance the performance of wormhole-switched networks. They are formed by arranging buffer space dedicated a given physical channel into multiple parallel buffers that share bandwidth on demand driven time-multiplexed manner. The question be answered is: fixed amount finite what is optimal way arrange it virtual channels. There few studies attempting address this issue, however, these so far resorted simulation experiments and focused deterministic routing algorithms. In paper we use analytical models investigate arrangement available when adaptive used in k-ary ncubes.