Ethernet's plug-&-play feature is built on its use of flat (location independent) addresses and use of broadcasts to resolve unknown MAC addresses. While plug-&-play is one of Ethernet's most attractive features, it also affects its scalability. As the number of active MAC addresses in the network grows beyond the capacity of forwarding caches in bridges, the odds of "cache-misses," each triggering a broadcast, grow as well. The resulting increase in broadcast bandwidth consumption affects scalability. To address this problem, we propose a simple address resolution scheme based on an adaptation of distributed hash tables where a single query suffices in the steady state. The new scheme is implemented on advanced bridges maintaining backward compatibility with legacy bridges and eliminating reliance on broadcasts for address discovery. Comparisons with a legacy, broadcast-based scheme are carried out along several metrics that demonstrate the new scheme's robustness and ability to improve scalability.
[1]
Eugene Ch'ng,et al.
Rethinking the service model: Scaling Ethernet to a million nodes
,
2004
.
[2]
Ion Stoica,et al.
ROFL: routing on flat labels
,
2006,
SIGCOMM '06.
[3]
Maher Ali,et al.
Traffic engineering in metro Ethernet
,
2005,
IEEE Network.
[4]
Antony Rowstron,et al.
Virtual ring routing: network routing inspired by DHTs
,
2006,
SIGCOMM 2006.
[5]
K. Pagiamtzis,et al.
Content-addressable memory (CAM) circuits and architectures: a tutorial and survey
,
2006,
IEEE Journal of Solid-State Circuits.
[6]
David R. Karger,et al.
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
,
1997,
STOC '97.
[7]
John Moy,et al.
OSPF Version 2
,
1998,
RFC.
[8]
Gerd Keiser,et al.
Local Area Networks
,
1989
.