This paper proposed a Distributed Address Resolution Protocol (DARP) for large layer 2 networks used in a data center. As data centers continue to grow in size, there is an increased amount of overhead required to resolve network addresses using the traditional Address Resolution Protocol (ARP). The DARP attempts to reduce this overhead for large data centers with thousands of nodes and allow for the resolution of network address with minimal strain on the underlying network infrastructure. By using Distributed Hash Tables (DHTs) as the core data structure technology to maintain address records, we attempt to create a decentralized and reliable service that trades the sporadic overhead associated with current approaches with a consistent and predictable overhead. To determine the viability of the protocol, a series of simulations were developed and run via the OPNET Modeler software package. The simulation results demonstrate that DARP outperforms ARP by reducing the number of messages. Data centersaddress resolution protocoldistributed hash tables.

Additional Metadata
Keywords address resolution protocol, Data centers, distributed hash tables
Persistent URL dx.doi.org/10.1109/CloudCom.2012.6427588
Conference 2012 4th IEEE International Conference on Cloud Computing Technology and Science, CloudCom 2012
Citation
Gillespie, R. (Robert), Kamil, A. (Abdullah), Lung, C.H, Majumdar, S, & Ashwood-Smith, P. (Peter). (2012). Address Resolution in large layer 2 networks for data centers. Presented at the 2012 4th IEEE International Conference on Cloud Computing Technology and Science, CloudCom 2012. doi:10.1109/CloudCom.2012.6427588