Guillermo Ibáñez

Learn More
Ethernet 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(More)
—Tree-based Routing (TRE) revisits Tree-based Routing Architecture for Irregular Networks (TRAIN)—a forwarding scheme based on a spanning tree that was extended to use some shortcut links. We propose its adaptation to Ethernet, using a new type of hierarchical Ethernet addresses and a procedure to assign them to bridges. We show that compared to RSTP, TRE(More)
The availability and affordable cost of Gigabit and 10 Gigabit Ethernet switches has impacted the deployment of Metropolitan Area Networks (MANs) and campus networks. This paper presents a new protocol, Alternative Multiple Spanning Tree Protocol (AMSTP), that uses multiple source based spanning trees for backbones using Ethernet switches. It provides(More)
The demo is focused on the implementation of ARP-Path (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges. ARP-Path Bridges rely on the race between broadcast ARP Request packets, to discover the minimum latency path to the destination host. Several implementations (in Omnet++, Linux, OpenFlow, NetFPGA) have shown that ARP-Path(More)
Ethernet bridging in campus networks offers advantages like zero configuration, no need of IP addresses administration in subnets, high performance and low costs. But Ethernet bridging does not scale. Current proposals under standardization, like Shortest Path Bridges and Routing Bridges use a link-state routing protocol to compute shortest paths. As a(More)
over all links, to discover the minimum latency path to the destination host, complemented in the opposite direction by the ARP Reply packet directed to the source host. Implementations show that the protocol is loop free, does not block links, is fully transparent to hosts and neither needs a spanning tree protocol to prevent loops nor a link state(More)