Application of network calculus to general topologies using turn-prohibition

Starobinski, David; Karpovsky, Mark G.; Zakrevski, L.

doi:10.1109/tnet.2003.813040

Cited by 90 publications

(69 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section we describe the basis of UP/Down routing and turn prohibition algorithms, which is seminal for the definition of HURP, using the model described in [3]. Consider a network modelled as a directed graph composed of nodes and links.…”

Section: Up/down and Turn Prohibitionmentioning

confidence: 99%

“…Node 4 is visited twice, but no link is traversed twice. Turn Prohibition [3] algorithm is centralized and has computational complexity O(N 2 d), that limits scalability. Turn Prohibition can provide a loop-free topology by eliminating less than 1/3 of the turns.…”

Section: Up/down and Turn Prohibitionmentioning

confidence: 99%

“…Turn Prohibition can provide a loop-free topology by eliminating less than 1/3 of the turns. and it shows an average improvement of performance around 10-20 % [3] compared to its predecessor Up/Down routing paradigm [2]. Some proposals have been made to evolve the turn prohibition model.…”

Section: Up/down and Turn Prohibitionmentioning

confidence: 99%

“…A new concept of Ethernet switch is needed that combines the features of standard bridge and routers avoiding the limitation of the spanning tree protocol. Turn Prohibition (and Up/Down routing) is a candidate to replace spanning tree in switched networks [3] [6].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Hierarchical Up/Down routing architecture for ethernet backbones and campus networks

Ibáñez¹,

García-Martínez

Carral

et al. 2008

IEEE INFOCOM 2008 - IEEE Conference on Computer Communications Workshops

View full text Add to dashboard Cite

Abstract-We describe a new layer two distributed and scalable routing architecture. It uses an automatic hierarchical node identifier assignment mechanism associated to the rapid spanning tree protocol. Enhanced Up/Down mechanisms are used to prohibit some turns at nodes to break cycles, instead of blocking links like the spannning tree protocol does. The protocol performance is similar or better than other Turn Prohibition algorithms recently proposed with lower complexity O (Nd) and better scalability. Simulations show that the fraction of prohibited turns over random networks is less than 0.2. The effect of root bridge election on the performance of the protocol is limited both in the random and regular networks studied.The use of hierarchical, tree-descriptive addresses simplifies the routing. and avoids the need of all nodes having a global knowleddge of the network topology. Routing frames through the hierarchical tree at very high speed is possible by progressive decoding of frame destination address, without routing tables or port address learning. Coexistence with standard bridges is achieved using combined devices: bridges that forward the frames having global destination MAC addresses as standard bridges and frames with local MAC frames with the proposed protocol.

show abstract

Section: Up/down and Turn Prohibitionmentioning

confidence: 99%

Section: Up/down and Turn Prohibitionmentioning

confidence: 99%

Section: Up/down and Turn Prohibitionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Hierarchical Up/Down routing architecture for ethernet backbones and campus networks

Ibáñez¹,

García-Martínez

Carral

et al. 2008

IEEE INFOCOM 2008 - IEEE Conference on Computer Communications Workshops

View full text Add to dashboard Cite

show abstract

“…Compared to link prohibition strategies, turn prohibition provides increased link utilization. It has been proven for some algorithms that the restriction of less than a fraction of 0.33 of total turns guarantees loop-free topologies without blocked network links [2]. Note that the spanning tree protocol prohibits typically in the range of 0.7-0.9 of turns.…”

Section: Introductionmentioning

confidence: 99%

HURP/HURBA: Zero-configuration hierarchical Up/Down routing and bridging architecture for Ethernet backbones and campus networks

et al. 2010

View full text Add to dashboard Cite

a b s t r a c tEthernet switched networks do not scale appropriately due to limitations inherent to the spanning tree protocol. Ethernet architectures based on routing over a virtual topology in which turns are prohibited offer improved performance over spanning tree, although in some cases suffer from excessive computational complexity. Up/Down routing is a turn prohibition algorithm with low computational complexity. In this paper we propose HURBA, a new layer-two architecture that improves Up/Down routing performance due to an optimization based on the use of hierarchical addressing, while preserving the computational complexity of Up/Down. The resulting architecture requires zero-configuration, uses the same frame format as Ethernet, allows upgrades by software update, and is compatible with 802.1D bridges by means of encapsulation. HURP protocol builds automatically a core with the interconnected HURP routing bridges and the standard bridges get connected to the edges in standard spanning trees. Simulations show that the performance of HURP, evaluated over various combinations of network topology and size, is close to the one of shortest path, is consistently better than that of Up/Down, and is equal or better than Turn Prohibition, with the advantage of having a lower complexity.

show abstract

Multipath routing algorithm for application‐specific wormhole NoCs

ZhuanSun

Chen

2017

Concurrency and Computation

View full text Add to dashboard Cite

Adaptive routing designing for network-on-chip architecture is complicated to guarantee deadlock-free. In this paper, we present methodology to design efficient multi-path routing algorithms for specific application wormhole network-on-chip system to guarantee deadlock-free. The methodology presents an analytical model for overall average delay of wormhole network-on-chip by queueing theory and uses a linear programming-based methodology to minimize overall average delay. The methodology guarantees deadlock freedom by efficient branch-and-bound algorithm. Compared to other adaptive deadlock-free algorithms, results obtained through simulation show that the algorithms can potentially achieve better throughput and latency. KEYWORDS multi-path, network-on-chip, routing algorithms 1 opens new directions in the customization of the routing algorithms for the application. 14 Those literature 12,15,16 have proposed several deadlock-free routing algorithms without considering the information of the specific application traffic. They designed those routing algorithms under any type of traffic to guarantee the deadlock freedom of NoC system and improve good average performance. 17 Thus, they naturally assume that each nodes of the NoC system may communicate to each other node and all the source ejecting nodes have same ejecting traffic rate.However, we may get accurate information of the specific application traffic for the area of NoC system. 17 Furthermore, traditional routing algorithm for mesh topology is achieved at a high loss of adaptive. 2,12 A limitation of those routing algorithms is that they cannot ensure deadlock freedom for an irregular mesh topology in which cores could occupy more than one tile. 2

show abstract

Application of network calculus to general topologies using turn-prohibition

Cited by 90 publications

References 28 publications

Hierarchical Up/Down routing architecture for ethernet backbones and campus networks

Hierarchical Up/Down routing architecture for ethernet backbones and campus networks

HURP/HURBA: Zero-configuration hierarchical Up/Down routing and bridging architecture for Ethernet backbones and campus networks

Multipath routing algorithm for application‐specific wormhole NoCs

Contact Info

Product

Resources

About