Welcome to the InfoSci Platform
Robust and Efficient Custom Routing for Interconnection Networks with Distributed Shortcuts

Robust and Efficient Custom Routing for Interconnection Networks with Distributed Shortcuts

T. X. Le Nhat, T. Truong Nguyen, Khanh-Van Nguyen
Copyright: © 2014 |Volume: 5 |Issue: 4 |Pages: 24
ISSN: 1947-3532|EISSN: 1947-3540|EISBN13: 9781466653702|DOI: 10.4018/ijdst.2014100104
Cite Article Cite Article

MLA

Le Nhat, T. X., et al. "Robust and Efficient Custom Routing for Interconnection Networks with Distributed Shortcuts." IJDST vol.5, no.4 2014: pp.51-74. http://doi.org/10.4018/ijdst.2014100104

APA

Le Nhat, T. X., Nguyen, T. T., & Nguyen, K. (2014). Robust and Efficient Custom Routing for Interconnection Networks with Distributed Shortcuts. International Journal of Distributed Systems and Technologies (IJDST), 5(4), 51-74. http://doi.org/10.4018/ijdst.2014100104

Chicago

Le Nhat, T. X., T. Truong Nguyen, and Khanh-Van Nguyen. "Robust and Efficient Custom Routing for Interconnection Networks with Distributed Shortcuts," International Journal of Distributed Systems and Technologies (IJDST) 5, no.4: 51-74. http://doi.org/10.4018/ijdst.2014100104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

We aim at creating a robust and efficient custom routing mechanism for Distributed Shortcut Networks (Nguyen et al., 2013), which address new challenging issues posed by recently advanced studies in the areas of massively parallel computing and large-scale data centers. We follow the design principles of Distributed Shortcut Networks (DSN), which construct non-random topologies with the creation of long-range shortcuts inspired by observations in small-world networks. However, we focus on designing a powerful custom routing mechanism which smartly exploits some precious properties of the topology. As a result, our new DSN-a network with a carefully refined routing logic performs significantly better than the basic DSN in term of communication latency while provides strengths in fault-tolerance as well as load-balance. These help the network become robust against link failures or burst of traffic demand while topology-agnostic deadlock-free routing (e.g. the famous up*/down* algorithm) suffers a lot.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.