ARP-Path: ARP-based Shortest Path Bridges Articles uri icon

authors

  • IBAÑEZ FERNANDEZ, GUILLERMO AGUSTIN
  • CARRAL, J.A:
  • ARCO, J:M:
  • RIVERA, D.
  • MONTALVO, A.

publication date

  • December 2010

start page

  • 770

end page

  • 773

issue

  • 2

volume

  • 15

international standard serial number (ISSN)

  • 1089-7798

electronic international standard serial number (EISSN)

  • 1558-2558

abstract

  • 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.

keywords

  • bridges; complexity theory; delay; ethernet networks; routing; routing protocols