An Efficient Address Resolution Technique for Large Layer 2 Networks
##plugins.themes.academic_pro.article.main##
Abstract
This paper proposed a Distributed Address Resolution Protocol (DARP) for large layer 2 Ethernet networks used in a data center. Ethernet by design broadcasts Address Resolution Protocol (ARP) messages to all nodes in the same network. As data centers continue to grow in size, there is an increased amount of overhead required to resolve network addresses using the traditional ARP. 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) and the existing Chord protocol as the core technologies to maintain address records, we designed 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 by a significant margin ARP by reducing the number of messages.
##plugins.themes.academic_pro.article.details##
How to Cite
Chung-Horng Lung, Robert Gillespie, Abdullah Kamil, Shikharesh Majumdar, & Peter Ashwood-Smith. (2013). An Efficient Address Resolution Technique for Large Layer 2 Networks. International Journal of Next-Generation Computing, 4(2), 128–142. https://doi.org/10.47164/ijngc.v4i2.48
References
- Plummer, D. 1982. An Ethernet Address Resolution Protocol, IETF RFC 826, Nov. 1982.
- Stoica, I. Morris, D. Liben-Nowell, D. Karger, D.R. Kaashoek, M.F. Dabek, F. and Balakrishnan, H. 2003. Chord: a scalable peer-to-peer lookup protocol for internet applications.. IEEEACM Trans on Networking, 11(1), 17-32.
- OPNET. www.opnet.com.
- Gillespie, R., Kamil, A., Lung, C.H., Majumdar, S. and Ashwood-Smith, P. 2005. Address resolution in large layer 2 networks for data centers. In Proceedings of the 4th IEEE International Confrence on Cloud Computing Technology and Science. (CloudCom). 693-698.
- Kaffille, S., and Loesing, K. 2007. Open Chord version 1.04 Users Manual. http://open-chord.sourceforge. net.
- Ripeanu, M. 2001. Peer-to-peer architecture case study: Gnutlella. In Proceedings of International Confrence on Peer-to-Peer Computing. 99-100.
- Steinmetz, R., and Wehrle, K. 2005. Peer-to-Peer Systems and Applications. Springer-Verlag Berlin Heidelberg.
- Rowstron, A., and Druschel, P. 2001. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In Proceedings of International Confrence on Distributed Systems Platforms.329-350.
- Zhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., and Kubiatowicz, J. D. 2004. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas In Communications, 22(1). 41-53.
- Ghodsi, A.. Distributed k-ary System: Algorithms for Distributed Hash Tables,. Doctoral thesis KTH-Royal Institute of Technology.
- Xu, Z., Min, R., and Hu, Y. 2003. Reducing maintenance overhead in DHT based peer-to-peer algorithms. In Proceedings of Third International Conference on P2P Computing. 218-219.
- Gillespie, R., and Kamil, A. 2012. Address Resolution in Large Layer 2 Networks. 4th Year Project Report Dept. of Systems and Computer Engg., Carleton Univ., April 2012.
- UML. Uni ed Modeling Language,. http://www.uml.org/.
- Al-Fares, M., Loukissas, A., and Vahdat, A. 2008. A scalable, commodity data center network architecture. In Proceedings of ACM SIGCOMM Confrence on Data Communication. 63-74.