DocumentCode
1550205
Title
ARP-Path: ARP-Based, Shortest Path Bridges
Author
Ibanez, G. ; Carral, J.A. ; Arco, J.M. ; Rivera, D. ; Montalvo, A.
Author_Institution
Dept. de Autom., Univ. of Alcala, Alcala de Henares, Spain
Volume
15
Issue
7
fYear
2011
fDate
7/1/2011 12:00:00 AM
Firstpage
770
Lastpage
772
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
local area networks; routing protocols; telecommunication switching; ARP-path; Ethernet switches; Ethernet transparent bridge; shortest path bridges; Bridges; Complexity theory; Delay; Ethernet networks; Routing; Routing protocols; Ethernet; routing bridges; spanning tree;
fLanguage
English
Journal_Title
Communications Letters, IEEE
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2011.060111.102264
Filename
5871399
Link To Document