Multispanning Tree Zone-Ordered Label-Based Routing Algorithms for Irregular Networks

Moraveji, Reza; Moinzadeh, Parya; Sarbazi-Azad, Hamid; Zomaya, Albert Y.

doi:10.1109/tpds.2010.137

Cited by 7 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Turn models were proposed for high-performance routing in irregular networks [10], [13], [18], [27]. These methods usually set the minimum number of prohibited turns.…”

mentioning

confidence: 99%

“…These methods usually set the minimum number of prohibited turns. A zoneordered label-based routing scheme was proposed for irregular networks with multiple spanning trees (MSTs) in [18]. Any packet is delivered along the ordered zones in [18].…”

mentioning

confidence: 99%

“…A zoneordered label-based routing scheme was proposed for irregular networks with multiple spanning trees (MSTs) in [18]. Any packet is delivered along the ordered zones in [18]. There may be difficulty in finding the best zones and zone order, especially when the number of STs is larger.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Deadlock-Free Fully Adaptive Routing in Irregular Networks without Virtual Channels

Xiang

2013

2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications

View full text Add to dashboard Cite

Abstract-This paper proposes a new flow control scheme in VCT-switched irregular networks. Based on the new scheme, a novel deadlock-free fully adaptive routing algorithm is introduced. The algorithm does not need any virtual channel. It requires that each input port of a switch holds at least two 1-packet-sized buffers. The flow control scheme is proposed based on a baseline routing scheme, where the downstream nodes check the number of safe buffers at the upstream nodes. The proposed fully adaptive routing algorithm is on the basis of different baseline routing schemes: up*/down*, and multiple spanning tree based routing schemes. Extensive simulation results validate the effectiveness of the proposed method as compared to well-known existing approaches.

show abstract

“…Turn models were proposed for high-performance routing in irregular networks [10], [13], [18], [27]. These methods usually set the minimum number of prohibited turns.…”

mentioning

confidence: 99%

mentioning

confidence: 99%