Path-Moose: A Scalable All-Path Bridging Protocol

Guillermo IBÁÑEZ; Iván MARSÁ-MAESTRE; Miguel A. LOPEZ-CARMONA; Ignacio PÉREZ-IBÁÑEZ; Jun TANAKA; Jon CROWCROFT

doi:10.1587/transcom.E96.B.756

Path-Moose: A Scalable All-Path Bridging Protocol

Guillermo IBÁÑEZ, Iván MARSÁ-MAESTRE, Miguel A. LOPEZ-CARMONA, Ignacio PÉREZ-IBÁÑEZ, Jun TANAKA, Jon CROWCROFT

Full Text Views

0

Share
Cite this

Summary :

This paper describes Path-Moose, a scalable tree-based shortest path bridging protocol. Both ARP-Path and Path-Moose protocols belong to a new category of bridges that we name All-path, because all paths of the network are explored simultaneously with a broadcast frame distributed over all network links to find a path or set a multicast tree. Path-Moose employs the ARP-based low latency routing mechanism of the ARP-Path protocol on a bridge basis instead of a per-single-host basis. This increases scalability by reducing forwarding table entries at core bridges by a factor of fifteen times for big data center networks and achieves a faster reconfiguration by an approximate factor of ten. Reconfiguration time is significantly shorter than ARP-Path (zero in many cases) because, due to the sharing of network paths by the hosts connected to same edge bridges, when a host needs the path it has already been recovered by another user of the path. Evaluation through simulations shows protocol correctness and confirms the theoretical evaluation results.

Publication: IEICE TRANSACTIONS on Communications Vol.E96-B No.3 pp.756-763

Publication Date: 2013/03/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E96.B.756

Type of Manuscript: PAPER

Category: Network System

Cite this

Copy

Guillermo IBÁÑEZ, Iván MARSÁ-MAESTRE, Miguel A. LOPEZ-CARMONA, Ignacio PÉREZ-IBÁÑEZ, Jun TANAKA, Jon CROWCROFT, "Path-Moose: A Scalable All-Path Bridging Protocol" in IEICE TRANSACTIONS on Communications, vol. E96-B, no. 3, pp. 756-763, March 2013, doi: 10.1587/transcom.E96.B.756.
Abstract: This paper describes Path-Moose, a scalable tree-based shortest path bridging protocol. Both ARP-Path and Path-Moose protocols belong to a new category of bridges that we name All-path, because all paths of the network are explored simultaneously with a broadcast frame distributed over all network links to find a path or set a multicast tree. Path-Moose employs the ARP-based low latency routing mechanism of the ARP-Path protocol on a bridge basis instead of a per-single-host basis. This increases scalability by reducing forwarding table entries at core bridges by a factor of fifteen times for big data center networks and achieves a faster reconfiguration by an approximate factor of ten. Reconfiguration time is significantly shorter than ARP-Path (zero in many cases) because, due to the sharing of network paths by the hosts connected to same edge bridges, when a host needs the path it has already been recovered by another user of the path. Evaluation through simulations shows protocol correctness and confirms the theoretical evaluation results.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E96.B.756/_p

Copy

@ARTICLE{e96-b_3_756,
author={Guillermo IBÁÑEZ, Iván MARSÁ-MAESTRE, Miguel A. LOPEZ-CARMONA, Ignacio PÉREZ-IBÁÑEZ, Jun TANAKA, Jon CROWCROFT, },
journal={IEICE TRANSACTIONS on Communications},
title={Path-Moose: A Scalable All-Path Bridging Protocol},
year={2013},
volume={E96-B},
number={3},
pages={756-763},
abstract={This paper describes Path-Moose, a scalable tree-based shortest path bridging protocol. Both ARP-Path and Path-Moose protocols belong to a new category of bridges that we name All-path, because all paths of the network are explored simultaneously with a broadcast frame distributed over all network links to find a path or set a multicast tree. Path-Moose employs the ARP-based low latency routing mechanism of the ARP-Path protocol on a bridge basis instead of a per-single-host basis. This increases scalability by reducing forwarding table entries at core bridges by a factor of fifteen times for big data center networks and achieves a faster reconfiguration by an approximate factor of ten. Reconfiguration time is significantly shorter than ARP-Path (zero in many cases) because, due to the sharing of network paths by the hosts connected to same edge bridges, when a host needs the path it has already been recovered by another user of the path. Evaluation through simulations shows protocol correctness and confirms the theoretical evaluation results.},
keywords={},
doi={10.1587/transcom.E96.B.756},
ISSN={1745-1345},
month={March},}

Copy

TY - JOUR
TI - Path-Moose: A Scalable All-Path Bridging Protocol
T2 - IEICE TRANSACTIONS on Communications
SP - 756
EP - 763
AU - Guillermo IBÁÑEZ
AU - Iván MARSÁ-MAESTRE
AU - Miguel A. LOPEZ-CARMONA
AU - Ignacio PÉREZ-IBÁÑEZ
AU - Jun TANAKA
AU - Jon CROWCROFT
PY - 2013
DO - 10.1587/transcom.E96.B.756
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E96-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2013
AB - This paper describes Path-Moose, a scalable tree-based shortest path bridging protocol. Both ARP-Path and Path-Moose protocols belong to a new category of bridges that we name All-path, because all paths of the network are explored simultaneously with a broadcast frame distributed over all network links to find a path or set a multicast tree. Path-Moose employs the ARP-based low latency routing mechanism of the ARP-Path protocol on a bridge basis instead of a per-single-host basis. This increases scalability by reducing forwarding table entries at core bridges by a factor of fifteen times for big data center networks and achieves a faster reconfiguration by an approximate factor of ten. Reconfiguration time is significantly shorter than ARP-Path (zero in many cases) because, due to the sharing of network paths by the hosts connected to same edge bridges, when a host needs the path it has already been recovered by another user of the path. Evaluation through simulations shows protocol correctness and confirms the theoretical evaluation results.
ER -