RT info:eu-repo/semantics/article T1 ARP-Path: ARP-based, Shortest Path Bridges A1 Ibáñez Fernández, Guillermo Agustín A1 Carral Pelayo, Juan Antonio A1 Arco Rodríguez, José Manuel A1 Rivera Pinto, Diego A1 Montalvo Taravillo, Aarón K1 Ethernet K1 Routing bridges K1 Spanning Tree K1 Automatización K1 Automation K1 Ciencias tecnológicas K1 Technology AB This letter is a summary proposal for an evolution ofthe Ethernet transparent bridge paradigm that provides simple,shortest path bridging in campus networks. ARP-Path EthernetSwitches set up an on-demand path between two hosts justreusing and flooding the standard ARP request frame through alllinks and confirming the path reaching to the destination hostwith the ARP reply frame. ARP-Path uses the standard Ethernetframe format, is fully transparent to hosts and does not requirespanning tree or link state protocol. Simulation results showsuperior performance to spanning tree and similar to shortestpath routing, with lower complexity. Our implementationsconfirm backward compatibility, robustness and performance. YR 2011 FD 2011-05-05T10:45:57Z LK http://hdl.handle.net/10017/8175 UL http://hdl.handle.net/10017/8175 LA eng NO Comunidad de Madrid DS MINDS@UW RD 29-mar-2024