Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 8
Encontrada(s) 1 página(s)

e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

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

  • Ibáñez Fernández, Guillermo Agustín|||0000-0001-6963-5977
  • García Martínez, Alberto
  • Carral Pelayo, Juan Antonio|||0000-0002-5545-9463
  • Gonzalez, Pedro A.
  • Azcorra, Arturo
  • Arco Rodríguez, José Manuel|||0000-0001-7752-3561
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 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., Ministerio de Educación y Ciencia, Comunidad de Madrid, Junta de Comunidades de Castilla-La Mancha
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Contribución de congreso (ConferenceOutput)

A Simple, Zero-configuration, Low Latency, Bridging Protocol

  • Ibáñez Fernández, Guillermo Agustín|||0000-0001-6963-5977
  • Naous, Jad
  • Rojas Sánchez, Elisa|||0000-0002-6385-2628
  • Rivera Pinto, Diego|||0000-0002-7076-9048
  • Carral Pelayo, Juan Antonio|||0000-0002-5545-9463
  • Arco Rodríguez, José Manuel|||0000-0001-7752-3561
This paper describes a demo for a new type of bridges, ARP-Path bridges. These ARP-based Ethernet Switches rely on the race between ARP Request packets flooded over all links, to discover the minimum latency path to the destination host. The protocol uses all links, is loop free, uses the standard Ethernet frame format, is fully transparent to hosts and neither needs a spanning tree protocol to prevent loops nor a links state protocol to obtain minimum latency paths. Implementations in Linux and Openflow on NetFPGA show inherent robustness and fast reconfiguration. Simulation results show throughput and delay performance superior to the Spanning Tree Protocol and similar to shortest path routing, with lower complexity., Comunidad de Madrid, Junta de Comunidades de Castilla-La Mancha
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Contribución de congreso (ConferenceOutput)

ARP-Path Bridges: Implementación de Shortest Path Bridges Ethernet basados en ARP sobre Linux y Openflow/NetFPGA

  • Ibáñez Fernández, Guillermo Agustín|||0000-0001-6963-5977
  • Naous, Jad
  • Rojas Sánchez, Elisa|||0000-0002-6385-2628
  • Rivera Pinto, Diego|||0000-0002-7076-9048
  • Carral Pelayo, Juan Antonio|||0000-0002-5545-9463
  • Velasco Pérez, Juan Ramón|||0000-0003-0239-1116
En este artículo se describen los conmutadores ARP-Path (también denominados FastPath y sus implementaciones recientes en Linux y NetFPGA. ARP-Path es una evolución conceptual de los puentes transparentes con aprendizaje que no requiere protocolo auxiliar de encaminamiento (ni de árbol de expansión) en capa dos, a diferencia de las propuestas actualmente en estandarización RBridges y Shortest Path Bridges. Cada host establece, en los conmutadores ARP-Path, un camino mínimo al mismo tiempo que se envía el paquete estándar ARP_Request, pero inundado por todos los enlaces. El camino marcado por el paquete ARP Request que alcanza el destino se confirma aprovechando el paquete ARP_Reply de respuesta del host destino. Se han realizado implementaciones de puentes ARP-Path en Linux y en la plataforma Openflow con tarjetas NetFPGA (actualmente en pruebas), así como simulaciones sobre Omnet. Las prestaciones son similares o ligeramente superiores a las de enrutadores de camino mínimo y muy superiores a STP. Las pruebas con tráfico real y de reconfiguración muestran las robustez y rapidez del protocolo. ARP-Path no modifica la trama de Ethernet y es compatible con puentes estándar en modo núcleo-isla., Comunidad de Madrid, Junta de Comunidades de Castilla-La Mancha
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

TRE+: Extended Tree-Based Routing Ethernet

  • Carral Pelayo, Juan Antonio|||0000-0002-5545-9463
  • Ibáñez Fernández, Guillermo Agustín|||0000-0001-6963-5977
  • García Martínez, Alberto
  • López Carmona, Miguel Ángel|||0000-0001-9228-1863
  • Marsá Maestre, Iván|||0000-0002-5529-2851
Tree-based routing Ethernet (TRE) is a recent Ethernet architecture that enables shortcut links to improve performance compared to spanning tree protocols. However, TRE can only use shortcuts that arrive directly at bridges located in the branch of the destination. TRE+ extends the topology knowledge of a bridge to 2 hops away, thus unveiling new shortcuts to the destination branch. Simulations show a major performance improvement of TRE+ compared to TRE, with results close to shortest paths in some topologies., Junta de Comunidades de Castilla La Mancha
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Contribución de congreso (ConferenceOutput)

Fast Path Ethernet Switching: On-demand Efficient Transparent Bridges for Data Center and Campus Networks

  • Ibáñez Fernández, Guillermo Agustín|||0000-0001-6963-5977
  • Carral Pelayo, Juan Antonio|||0000-0002-5545-9463
  • García Martínez, Alberto
  • Arco Rodríguez, José Manuel|||0000-0001-7752-3561
  • Rivera Pinto, Diego|||0000-0002-7076-9048
  • Azcorra, Arturo
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 simpler alternative, we propose an evolution of the transparent bridges learning mechanism, that provides loop-free, full infrastructure utilization for campus and datacenter networks. Fast Path Ethernet Switches double use the standard ARP Request and Reply packets to set up fast on-demand paths between hosts when needed. This architecture uses standard Ethernet frame format, is fully transparent to hosts and compatible with 802.1D bridges in core-island mode. A proof of concept has been implemented in Linux. Preliminary simulations in metropolitan and campus newtork topologies show clearly superior to spanning tree and even shortest path routers, at a fraction of the complexity., Comunidad de Madrid, Junta de Comunidades de Castilla-La Mancha
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Implementing ARP-Path Low Latency Bridges in NetFPGA

  • Rojas Sánchez, Elisa|||0000-0002-6385-2628
  • Naous, Jad
  • Ibáñez Fernández, Guillermo Agustín|||0000-0001-6963-5977
  • Rivera Pinto, Diego|||0000-0002-7076-9048
  • Carral Pelayo, Juan Antonio|||0000-0002-5545-9463
  • Arco Rodríguez, José Manuel|||0000-0001-7752-3561
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 exhibits loop-freedom, does not block links, is fully transparent to hosts and neither needs a spanning tree protocol to prevent loops nor a link state protocol to obtain low latency paths. This demo compares our hardware implementation on NetFPGA to bridges running STP, showing that ARP-Path finds lower latency paths than STP., Comunidad de Madrid, Junta de Comunidades de Castilla-La Mancha
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Implementation of ARP-Path Low Latency Bridges in Linux and OpenFlow/NetFPGA

  • Ibáñez Fernández, Guillermo Agustín|||0000-0001-6963-5977
  • De Schuymer, Bart
  • Naous, Jad
  • Rivera Pinto, Diego|||0000-0002-7076-9048
  • Rojas Sánchez, Elisa|||0000-0002-6385-2628
  • Carral Pelayo, Juan Antonio|||0000-0002-5545-9463
This paper describes the implementation of ARP- Path (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges, in Linux/Soekris and OpenFlow/NetFPGA platforms. These ARP-based Ethernet Switches rely on the race between the replicas of a standard ARP Request packet flooded 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 protocol to obtain low latency paths. Implementations in Linux and OpenFlow on NetFPGA show inherent robustness and fast reconfiguration. Previous simulations showed a superior performance (throughput and delay) than the Spanning Tree Protocol and similar to shortest path routing, with lower complexity., Ministerio de Ciencia e Innovación, Comunidad de Madrid, Junta de Comunidades de Castilla-La Mancha
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

ARP-Path: ARP-based, Shortest Path Bridges

  • Ibáñez Fernández, Guillermo Agustín|||0000-0001-6963-5977
  • Carral Pelayo, Juan Antonio|||0000-0002-5545-9463
  • Arco Rodríguez, José Manuel|||0000-0001-7752-3561
  • Rivera Pinto, Diego|||0000-0002-7076-9048
  • Montalvo Taravillo, Aarón|||0000-0002-6896-5226
This letter is a summary proposal for an evolution of the Ethernet transparent bridge paradigm that provides simple, shortest path bridging in campus networks. ARP-Path Ethernet Switches set up an on-demand path between two hosts just reusing and flooding the standard ARP request frame through all links and confirming the path reaching to the destination host with the ARP reply frame. ARP-Path uses the standard Ethernet frame format, is fully transparent to hosts and does not require spanning tree or link state protocol. Simulation results show superior performance to spanning tree and similar to shortest path routing, with lower complexity. Our implementations confirm backward compatibility, robustness and performance., Comunidad de Madrid, Junta de Comunidades de Castilla-La Mancha