A Simple, Zero-configuration, Low Latency, Bridging Protocol
Authors
Ibáñez Fernández, Guillermo AgustínPublisher
The 35th IEEE Conference on Local Computer Networks (LCN)
Date
2010-10-11Funders
Comunidad de Madrid
Junta de Comunidades de Castilla-La Mancha
Bibliographic citation
http://www.ieeelcn.org/lcn35demos/lcn-demo2010_ibanez.pdf
Keywords
Ethernet
Routing bridges
Shortest Path Bridges
Spanning Tree
Project
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/grantAgreement/JCCM/PROGRAMA ESTATAL DE FOMENTO DE LA INVESTIGACION CIENTIFICA Y TECNICA DE EXCELENCIA/PII1I09-0204-4319/ES/EXTENSIONES, VARIANTES Y MEJORAS DE ARQUITECTURA DE RED ESCALABLE DE CAPA DOS AUTOCONFIGURABLE MEDIANTE CONMUTADORES-ENRUTADORES ETHERNET/EMARECE
Document type
info:eu-repo/semantics/conferenceObject
Version
info:eu-repo/semantics/acceptedVersion
Access rights
info:eu-repo/semantics/openAccess
Abstract
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.
Files in this item
Files | Size | Format |
|
---|---|---|---|
10-A Simple, Zero-Configuration, ... | 587.1Kb |
![]() |
Files | Size | Format |
|
---|---|---|---|
10-A Simple, Zero-Configuration, ... | 587.1Kb |
![]() |
Collections
- AUTOMATIC - Artículos [79]
- AUTOMTSE - Artículos [38]