Network unfairness in dragonfly topologies

Abstract: Dragonfly networks arrange network routers in a two-level hierarchy, providing a competitive cost-performance solution for large systems. Non-minimal adaptive routing (adaptive misrouting) is employed to fully exploit the path diversity and increase the performance under adversarial traffic patterns. Network fairness issues arise in the dragonfly for several combinations of traffic pattern, global misrouting and traffic prioritization policy. Such unfairness prevents a balanced use of the resources across the network nodes and degrades severely the performance of any application running on an affected node. This paper reviews the main causes behind network unfairness in dragonflies, including a new adversarial traffic pattern which can easily occur in actual systems and congests all the global output links of a single router. A solution for the observed unfairness is evaluated using age-based arbitration. Results show that age-based arbitration mitigates fairness issues, especially when using in-transit adaptive routing. However, when using source adaptive routing, the saturation of the new traffic pattern interferes with the mechanisms employed to detect remote congestion, and the problem grows with the network size. This makes source adaptive routing in dragonflies based on remote notifications prone to reduced performance, even when using age-based arbitration.

 Fuente: The Journal of Supercomputing, Vol. 72, Iss. 12, pp 4468?4496 (2016)

Editorial: Kluwer Academic Publishers

 Fecha de publicación: 01/12/2016

Nº de páginas: 29

Tipo de publicación: Artículo de Revista

DOI: 10.1007/s11227-016-1758-z

ISSN: 0920-8542,1573-0484

Proyecto español: TIN2013-46957-C2-2-P : TIN2012-34557

Url de la publicación: https://doi.org/10.1007/s11227-016-1758-z