Please use this identifier to cite or link to this item:
Type: Conference paper
Title: Throughput fairness in k-ary n-cube networks
Author: Izu, M.
Citation: Proceedings of ACSC 2006, 2006 / Estivill-Castro, V., Dobbie, G. (ed./s), vol.48, pp.137-145
Publisher: Australian Computer Society
Publisher Place: Australia
Issue Date: 2006
ISBN: 1920682309
ISSN: 1445-1336
Conference Name: ACSC (16 Jan 2006 : Hobart, Australia)
Abstract: The performance of an interconnection network is measured by two metrics: average latency and peak network throughput. Network throughput is the total number of packets delivered per unit of time.Most synthetic network loads consist of sources injecting at the same given rate, using traffic patterns such as random, permutations or hot spot, which reflect the distribution of packet destinations in many parallel applications. The network is assumed to be fair: all source nodes are able to inject at the same rate. This work will show such assumption is unfounded for most router proposals. All router designs exhibited significant network unfairness under non-uniform loads. Some routers are also unfair under random traffic patterns. At loads above saturation, if the channel utilization is uneven, the injection matrix will become uneven: packet at low used areas will be accepted at a higher rate that those at the busy areas.As synthetic traffic does not reflect the coupled nature of the traffic generated by parallel applications, the impact of this unfairness on application performance could not be measured. New synthetic loads need to be developed to better evaluate network response beyond saturation.
Description: Copyright © 2006, Australian Computer Society, Inc.
RMID: 0020062699
Description (link):
Appears in Collections:Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.