DCell-IP: DCell emboldened with IP address hierarchy for efficient routing

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The increasing complexity and sophistication of data center applications demands new features in the data center designs. With the deployment of large range of applications, there is a demand for low latency and high throughput from the underlying network infrastructure. This resulted in many Data Center Network (DCN) designs. There are class of designs for DCN called server-centric-networks, where routing is done by server rather than intermediate switches. BCube and DCell are two such designs. These designs use source routing for communication. The symmetry and hierarchy in their design enable source to compute the entire path to the destination. The current implementation of DCell uses addresses other than IP address for addressing the servers and switches. In this paper, we provide a new implementation for DCell called DCell-IP using IP address hierarchy. Since IP addresses are also symmetric and hierarchical, we eliminate the need for using new scheme for addressing servers and intermediate switches. This also eliminates the need for translating design specific addresses to IP addresses during the routing. © 2013 Springer.

Cite

CITATION STYLE

APA

Ashok Kumar, A. R., Rao, S. V., Goswami, D., & Sahukari, G. (2013). DCell-IP: DCell emboldened with IP address hierarchy for efficient routing. In Advances in Intelligent Systems and Computing (Vol. 174 AISC, pp. 739–746). Springer Verlag. https://doi.org/10.1007/978-81-322-0740-5_88

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free