IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 10    
Website: http://www.ijser.org
scirp IJSER >> Volume 3,Issue 10,October 2012
Shortest Path Routing Algorithm for Ficonn in Load Balanced Data Center Networks
Full Text(PDF, )  PP.120-123  
Author(s)
K Udaya Bhanu, K Chandra Shekar
KEYWORDS
:Ethernet ports, Data center, Networks, Routing
ABSTRACT
This paper explores a Ficonn interconnection structure for load balanced data center servers using bi-ports. The tree-based structures are increasingly difficult to meet the design goals of data centers because of a single-point failure spot for its sub t
References
[1] M.Al-Fares, A.Loukissas, and A. Vahdat, “A ascendable, commodity data center network architecture,” in Proc. ACM SIGCOMM, Aug. 2008, pp. 63–74.

[2] H.Sullivan and T. R.Bashkow, “A large scale, homogeneous, fully distributed parallel machine, I,” in Proc. ISCA, Mar. 1977, pp. 105–117.

[3] J.Snyder, “Microsoft: Datacenter growth defies Moore’s Law,” 2007 [Online]. Available: http://www.pcworld.com/article/id,130921/article. Html

[4] L.Bhuyan and D.Agrawal, “A general class of processor interconnection strategies,” in Proc. ISCA, Apr. 1982, pp. 90–98.

[5] C.Guo, H.Wu, K.Tan, L. Shi, Y. Zhang, and S. Lu, “DCell: A ascendable and faulttolerant network structure for data centers,” in Proc. ACM SIGCOMM, Aug. 2008, pp. 75– 86.

[6] “Dell powerage servers” [Online]. Available: http://www.dell.com/content/products/category.aspx/se rvers

[7] J.Dean and S.Ghemawat, “Map Reduce: Simplified data processing on large clusters,” in Proc. OSDI, 2004, pp.

[8] M.Isard, M.Budiu, and Y. Yu et al., “Dryad: Distributed data-parallel programs from sequential building blocks,” in Proc. ACM EuroSys, 2007, pp. 59–72.

[9] T. Hoff, “Google architecture,” Jul. 2007 [Online]. Available: http://highascendability.com/googlearchitecture

[10] C.Guo, G.Lu, D.Li, H.Wu, X.Zhang, Y. Shi, C.Tian, Y. Zhang, and S. Lu, “BCube: A high performance, servercentric network architecture for modular data centers,” in Proc. ACM SIGCOMM, Aug. 2009, pp. 63–74.

[11] J. Kim, W. Dally, S. Scott, and D. Abts, “Technologydriven, highly ascendable dragonfly topology,” in Proc. ISCA, Jun. 2008, pp. 77–88.

[12] L. Bhuyan and D. Agrawal, “Generalized hypercube and hyperbus structures for a computer network,” IEEE Trans. Comput., vol. C-33, no. 4, pp. 323–333, Apr. 1984.

[13] M. Isard, M. Budiu, and Y. Yu et al., “Dryad: Distributed data-parallel programs from sequential building blocks,” in Proc. ACM EuroSys, 2007, pp. 59–72.

[14] A. Carter, “Do it green: Media interview with Michael Manos,” Dec. 2007 [Online]. Available: http://edge.technet.com/Media/Doing-ITGreen

[15] L. Rabbe, “Powering the Yahoo! network,” Nov. 2006 [Online]. Available: http://yodel.yahoo.com/2006/11/27/powering-theyahoo-network

[16] F. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays. Trees. Hypercubes. San Mateo, CA: Morgan Kaufmann, 1992.

Untitled Page