Publication: Path-moose: a scalable all-path bridging protocol
Loading...
Identifiers
Publication date
2013
Defense date
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
The Institute of Electronics, Information and Communication Engineers
Impact
Export
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.
Description
Keywords
Ethernet, Routing bridges, Shortest path bridges, Data centers
Bibliographic citation
IEICE Transactions on Communications E96–B (2013) 3, pp. 756-763