Title :
A throughput fairness injection protocol for mesh and torus networks
Author_Institution :
Sch. of Comput. Sci., Univ. of Adelaide, Adelaide, SA, Australia
Abstract :
Direct networks suffer significant network unfairness under non-uniform heavy loads; nodes near high traffic areas are hardly able to inject new packets while nodes at low traffic areas may inject packets at high rates. The reported average throughput does not reflect the large differences in node throughput amongst the network. Age-based arbitration has been proposed to achieve latency fairness and in doing so it will indirectly improve throughput fairness as well. However, as throughput fairness is only an issue at heavy loads, we would like a less intrusive method that can be applied to a range of network designs without limiting their routing or arbitration policies. This paper presents a simple injection fairness protocol that guarantees all nodes can inject at a similar rate at high loads regardless of their location. Tests with a variety of non-uniform loads will prove the success of the protocol for a range of network sizes.
Keywords :
routing protocols; telecommunication computing; telecommunication traffic; wireless mesh networks; arbitration policy; latency fairness; mesh network; routing policy; throughput fairness injection protocol; torus network; Australia; Computer science; Delay; Protocols; Routing; System recovery; Telecommunication traffic; Testing; Throughput; Time measurement;
Conference_Titel :
High Performance Computing (HiPC), 2009 International Conference on
Conference_Location :
Kochi
Print_ISBN :
978-1-4244-4922-4
Electronic_ISBN :
978-1-4244-4921-7
DOI :
10.1109/HIPC.2009.5433198