research-article

Global misrouting policies in two-level hierarchical networks

Authors:

G. RodríguezAuthors Info & Claims

IMA-OCMC '13: Proceedings of the 2013 Interconnection Network Architecture: On-Chip, Multi-Chip

Pages 13 - 16

https://doi.org/10.1145/2482759.2482763

Published: 23 January 2013 Publication History

Get Access

Abstract

Dragonfly networks are composed of interconnected groups of routers. Adaptive routing allows packets to be forwarded minimally or non-minimally adapting to the traffic conditions in the network. While minimal routing sends traffic directly between groups, non-minimal routing employs an intermediate group to balance network load.

A random selection of this intermediate group (denoted as RRG) typically implies an extra local hop in the source group, what increases average path length and can reduce performance. In this paper we identify different policies for the selection of such intermediate group and explore their performance. Interestingly, simulation results show that an eager policy (denoted as CRG) that selects the intermediate group only between those directly connected to the ongoing router causes starvation in some network nodes. On the contrary, the best performance is obtained by a "mixed mode" policy (denoted as MM) that adds a local hop when the packet has moved away from the source router.

References

[1]

B. Arimilli, R. Arimilli, V. Chung, S. Clark, W. Denzel, B. Drerup, T. Hoefler, J. Joyner, J. Lewis, J. Li, et al. The PERCS high-performance interconnect. In 2010 18th IEEE Symposium on High Performance Interconnects, pages 75--82. IEEE, 2010.

Digital Library

Google Scholar

[2]

M. García, E. Vallejo, R. Beivide, M. Odriozola, C. Camarero, M. Valero, G. Rodríguez, J. Labarta, and C. Minkenberg. On-the-fly adaptive routing in high-radix hierarchical networks. In The 41st International Conference on Parallel Processing (ICPP), 09 2012.

Digital Library

Google Scholar

[3]

K. Gunther. Prevention of deadlocks in packet-switched data transport systems. Communications, IEEE Transactions on, 29(4):512--524, apr 1981.

Crossref

Google Scholar

[4]

N. Jiang, J. Kim, and W. J. Dally. Indirect adaptive routing on large scale interconnection networks. In ISCA '09: 36th International Symposium on Computer Architecture, pages 220--231, 2009.

Digital Library

Google Scholar

[5]

J. Kim, W. Dally, S. Scott, and D. Abts. Technology-driven, highly-scalable dragonfly topology. In Proceedings of the 35th Annual International Symposium on Computer Architecture, pages 77--88. IEEE Computer Society, 2008.

Digital Library

Google Scholar

[6]

J. Kim, W. Dally, S. Scott, and D. Abts. Cost-efficient dragonfly topology for large-scale systems. Micro, IEEE, 29(1):33--40, 2009.

Digital Library

Google Scholar

[7]

L. Valiant. A scheme for fast parallel communication. SIAM journal on computing, 11:350, 1982.

Google Scholar

Cited By

View all

Benito MFuentes PVallejo EBeivide R(2019)ACORJournal of Parallel and Distributed Computing10.1016/j.jpdc.2019.04.022131:C(173-188)Online publication date: 1-Sep-2019
https://dl.acm.org/doi/10.1016/j.jpdc.2019.04.022
Fuentes PVallejo ECamarero CBeivide RValero M(2016)Network unfairness in dragonfly topologiesThe Journal of Supercomputing10.1007/s11227-016-1758-z72:12(4468-4496)Online publication date: 25-May-2016
https://doi.org/10.1007/s11227-016-1758-z
Fuentes PVallejo EGarcía MBeivide RRodríguez GMinkenberg CValero M(2015)Contention-Based Nonminimal Adaptive Routing in High-Radix NetworksProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2015.78(103-112)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPS.2015.78
Show More Cited By

Index Terms

Global misrouting policies in two-level hierarchical networks
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
      1. Interconnection architectures

Recommendations

Two-Level Community-Based Routing in Delay Tolerant Networks

Delay tolerant networks can not maintain end-to-end connectivity. Thus the routing is one of the critical issues. As we known, the two-level community model including the small community and the big community is proposed for the first time. In the same ...
Routing in hierarchical networks
BGP routing policies in ISP networks

The Internet has quickly evolved into a vast global network owned and operated by thousands of different administrative entities. During this time, it became apparent that vanilla shortest path routing would be insufficient to handle the myriad ...

Comments

Information & Contributors

Information

Published In

IMA-OCMC '13: Proceedings of the 2013 Interconnection Network Architecture: On-Chip, Multi-Chip

January 2013

29 pages

ISBN:9781450317849

DOI:10.1145/2482759

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 January 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Seventh Framework Programme
Consolider Project\Supercomputacion y e-Ciencia
Spanish Ministerio de Educacion
Ministerio de Ciencia e Innovación

Conference

INA-OCMC '13

INA-OCMC '13: On-Chip, Multi-Chip

January 23, 2013

Berlin, Germany

Acceptance Rates

IMA-OCMC '13 Paper Acceptance Rate 7 of 17 submissions, 41%;

Overall Acceptance Rate 12 of 27 submissions, 44%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
104
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Benito MFuentes PVallejo EBeivide R(2019)ACORJournal of Parallel and Distributed Computing10.1016/j.jpdc.2019.04.022131:C(173-188)Online publication date: 1-Sep-2019
https://dl.acm.org/doi/10.1016/j.jpdc.2019.04.022
Fuentes PVallejo ECamarero CBeivide RValero M(2016)Network unfairness in dragonfly topologiesThe Journal of Supercomputing10.1007/s11227-016-1758-z72:12(4468-4496)Online publication date: 25-May-2016
https://doi.org/10.1007/s11227-016-1758-z
Fuentes PVallejo EGarcía MBeivide RRodríguez GMinkenberg CValero M(2015)Contention-Based Nonminimal Adaptive Routing in High-Radix NetworksProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2015.78(103-112)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPS.2015.78
Won JKim GKim JJiang TParker MScott S(2015)Overcoming far-end congestion in large-scale networks2015 IEEE 21st International Symposium on High Performance Computer Architecture (HPCA)10.1109/HPCA.2015.7056051(415-427)Online publication date: Feb-2015
https://doi.org/10.1109/HPCA.2015.7056051
Fuentes PVallejo ECamarero CBeivide RValero M(2015)Throughput Unfairness in Dragonfly Networks under Realistic Traffic PatternsProceedings of the 2015 IEEE International Conference on Cluster Computing10.1109/CLUSTER.2015.136(801-808)Online publication date: 8-Sep-2015
https://dl.acm.org/doi/10.1109/CLUSTER.2015.136
García MVallejo EBeivide RCamarero CValero MRodríguez GMinkenberg C(2015)On-the-fly adaptive routing for dragonfly interconnection networksThe Journal of Supercomputing10.1007/s11227-014-1357-971:3(1116-1142)Online publication date: 1-Mar-2015
https://dl.acm.org/doi/10.1007/s11227-014-1357-9
Camarero CVallejo EBeivide R(2014)Topological Characterization of Hamming and Dragonfly Networks and Its Implications on RoutingACM Transactions on Architecture and Code Optimization10.1145/267703811:4(1-25)Online publication date: 8-Dec-2014
https://dl.acm.org/doi/10.1145/2677038
García MVallejo EBeivide RValero MRodríguez G(2013)OFAR-CMProceedings of the 2013 IEEE 21st Annual Symposium on High-Performance Interconnects10.1109/HOTI.2013.16(55-62)Online publication date: 21-Aug-2013
https://dl.acm.org/doi/10.1109/HOTI.2013.16

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Two-Level Community-Based Routing in Delay Tolerant Networks

Routing in hierarchical networks

BGP routing policies in ISP networks

Comments

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Funding Sources

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Two-Level Community-Based Routing in Delay Tolerant Networks

Routing in hierarchical networks

BGP routing policies in ISP networks

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Funding Sources

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations