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

Ibáñez, Guillermo; García-Martínez, Alberto; Carral, Juan A.; González, Pedro A.

doi:10.1109/infocom.2008.4544622

Cited by 3 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Importantly, each node in a nano-scale irregular network has very limited storage space (a few bits) and computational power (a 1-bit ALU). As a result, we cannot afford a routing table [Sancho 2004] (especially when it is possible to have billions of nodes in our network) or complex computation [Ibanez et al 2008] for full dynamic routing at each node as in general irregular networks. We thus determine the shortest tail-to-head paths during the configuration process and trade increased configuration time for reduced storage space and computational power during execution.…”

Section: New Routing Algorithmmentioning

confidence: 99%

“…The original up*/down* routing algorithm and several improved versions [Schroeder et al 1991;De Pallegrini et al 2004;Sancho 2004;Ibanez et al 2008] are widely used in irregular networks with abundant resources. The basic idea of up*/down* routing is to inhibit certain turns to break cycles in a network, thus obtaining deadlock-free routing.…”

Section: Our Algorithm Versus Up*/down* Routingmentioning

confidence: 99%

“…As a result, no full routing tables are needed and the time to look up the routing tables is saved. As a contrast, although there are improved versions of up*/down* routing trying to get rid of routing tables, more computation is actually needed during execution to encode the routing information included in the destination address [Ibanez et al 2008].…”

Section: Our Algorithm Versus Up*/down* Routingmentioning

confidence: 99%

See 2 more Smart Citations

Routing in self-organizing nano-scale irregular networks

Liu

Dwyer

Lebeck

2008

J. Emerg. Technol. Comput. Syst.

View full text Add to dashboard Cite

The integration of novel nanotechnologies onto silicon platforms is likely to increase fabrication defects compared with traditional CMOS technologies. Furthermore, the number of nodes connected with these networks makes acquiring a global defect map impractical. As a result, on-chip networks will provide defect tolerance by self-organizing into irregular topologies. In this scenario, simple static routing algorithms based on regular physical topologies, such as meshes, will be inadequate. Additionally, previous routing approaches for irregular networks assume abundant resources and do not apply to this domain of resource-constrained self-organizing nano-scale networks. Consequently, routing algorithms that work in irregular networks with limited resources are needed.In this article, we explore routing for self-organizing nano-scale irregular networks in the context of a Self-Organizing SIMD Architecture (SOSA). Our approach trades configuration time and a small amount of storage for reduced communication latency. We augment an Euler path-based routing technique for trees to generate static shortest paths between certain pairs of nodes while remaining deadlock free. Simulations of several applications executing on SOSA show our proposed routing algorithm can reduce execution time by 8% to 30%.

show abstract

Section: New Routing Algorithmmentioning

confidence: 99%

Section: Our Algorithm Versus Up*/down* Routingmentioning

confidence: 99%

Section: Our Algorithm Versus Up*/down* Routingmentioning

confidence: 99%

See 1 more Smart Citation

Routing in self-organizing nano-scale irregular networks

Liu

Dwyer

Lebeck

2008

J. Emerg. Technol. Comput. Syst.

View full text Add to dashboard Cite

show abstract

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

et al. 2010

Self Cite

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

Multi-Priority Frame Forwarding in Tree-Based Routing Ethernet

Zhang¹,

Liang²,

Wang³

2012

JNW

View full text Add to dashboard Cite

Local area network (LAN) technology is extensively employed in backbones and campus networks due to its excellent price/performance ratio and its installation convenience. However, with the increasing demand for multimedia and real-time applications, LAN requires additional operations to support Quality-of-Service (QoS). In this paper, we propose a novel bridge protocol that can forward frames with different priorities using different paths based on Hierarchical Local MAC (HLMAC) address. It can reduce storage requirement significantly and avoid broadcast storm to save bandwidth. The HLMAC can simplify the routing and avoid the need of all nodes having global knowledge of the network topology. Frame can be forwarded at very high speed by decoding the HLMAC gradually, without routing table lookuping or port address learning. Through simulation, it is shown that this protocol can improve the throughput and path length, and ensure the forwarding path of higher priority frame is superior to a lower priority frame

show abstract

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

Cited by 3 publications

References 7 publications

Routing in self-organizing nano-scale irregular networks

Routing in self-organizing nano-scale irregular networks

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

Multi-Priority Frame Forwarding in Tree-Based Routing Ethernet

Contact Info

Product

Resources

About