Article

One-to-One Disjoint Path Covers in DCell

Authors:

Yan WangAuthors Info & Claims

NPC 2013: Proceedings of the 10th IFIP International Conference on Network and Parallel Computing - Volume 8147

Pages 61 - 70

https://doi.org/10.1007/978-3-642-40820-5_6

Published: 19 September 2013 Publication History

Abstract

DCell has been proposed for one of the most important data center networks as a server centric data center network structure. DCell can support millions of servers with outstanding network capacity and provide good fault tolerance by only using commodity switches. In this paper, we prove that there exist r vertex disjoint paths { P _i | 1≤ i ≤ r } between any two distinct vertices u and v of DCell _k k ï ź0 where r = n + k -1 and n is the vertex number of DCell ₀. The result is optimal because of any vertex in DCell _k has r neighbors with r = n + k -1.

References

[1]

Ghemawat, S., Gobioff, H., Leung, S.: The Google file system. ACM SIGOPS Operating Systems Review 375, 29---43 2003

Digital Library

[2]

Dean, J., Ghemawat, S.: MapReduce: Simplified data processing on large clusters. Communications of the ACM 511, 107---113 2008

Digital Library

[3]

Isard, M., Budiu, M., Yu, Y., Birrell, A., Fetterly, D.: Dryad: distributed data-parallel programs from sequential building blocks. ACM SIGOPS Operating Systems Review 413, 59---72 2007

Digital Library

[4]

Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., Lu, S.: Dcell: a scalable and fault-tolerant network structure for data centers. ACM SIGCOMM Computer Communication Review 384, 75---86 2008

Digital Library

[5]

Guo, C., Lu, G., Li, D., Wu, H., Zhang, X., Shi, Y., Tian, C., Zhang, Y., Lu, S.: BCube: a high performance, server-centric network architecture for modular data centers. ACM SIGCOMM Computer Communication Review 394, 63---74 2009

Digital Library

[6]

Li, D., Guo, C., Wu, H., Tan, K., Zhang, Y., Lu, S.: FiConn: Using backup port for server interconnection in data centers. In: IEEE INFOCOM, pp. 2276---2285 2009

[7]

Li, D., Guo, C., Wu, H., Tan, K., Zhang, Y., Lu, S., Wu, J.: Scalable and cost-effective interconnection of data-center servers using dual server ports. IEEE/ACM Transactions on Networking 191, 102---114 2011

Digital Library

[8]

Lin, X., Philip, P., Ni, L.: Deadlock-free multicast wormhole routing in 2-D mesh multicomputers. IEEE Transactions on Parallel and Distributed Systems 58, 793---804 1994

Digital Library

[9]

Wang, N., Yen, C., Chu, C.: Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle model. Journal of Systems Architecture 513, 165---183 2005

Digital Library

[10]

Lin, C., Huang, H., Hsu, L.: On the spanning connectivity of graphs. Discrete Mathematics 3072, 285---289 2007

Digital Library

[11]

Lin, C., Huang, H., Tan, J., Hsu, L.: On spanning connected graphs. Discrete Mathematics 3087, 1330---1333 2008

Digital Library

[12]

West, D.B., et al.: Introduction to graph theory, p. 2. Prentice Hall, Englewood Cliffs 2001

[13]

Park, J., Kim, C., Lim, S.: Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements. IEEE Transactions on Parallel and Distributed Systems 173, 227---240 2006

Digital Library

[14]

Caha, R., Koubek, V.: Spanning multi-paths in hypercubes. Discrete Mathematics 30716, 2053---2066 2007

Digital Library

[15]

Chen, X.: Many-to-many disjoint paths in faulty hypercubes. Information Sciences 17918, 3110---3115 2009

Digital Library

[16]

Chen, X.: Paired many-to-many disjoint path covers of hypercubes with faulty edges. Information Processing Letters 1123, 61---66 2012

Digital Library

[17]

Park, J., Kim, H., Lim, H.: Many-to-many disjoint path covers in the presence of faulty elements. IEEE Transactions on Computers 584, 528---540 2009

Digital Library

[18]

Ma, M.: The spanning connectivity of folded hypercubes. Information Sciences 18017, 3373---3379 2010

Digital Library

[19]

Shih, Y., Kao, S.: One-to-one disjoint path covers on k-ary n-cubes. Theoretical Computer Science 41235, 4513---4530 2011

Digital Library

[20]

Hsu, H., Lin, C., Hung, H., Hsu, L.: The spanning connectivity of the n, k-star graphs. International Journal of Foundations of Computer Science 172, 415---434 2006

[21]

Chen, X.: Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs. Information Processing Letters 1106, 203---205 2010

Digital Library

[22]

Huanga, P., Hsub, L.: The spanning connectivity of line graphs. Applied Mathematics Letters 249, 1614---1617 2011

[23]

Kliegl, M., Lee, J., Li, J., Zhang, X., Guo, C., Rincon, D.: Generalized DCell structure for load-balanced data center networks. In: IEEE INFOCOM Conference on Computer Communications Workshops, pp. 1---5 2010

Cited By

Wang XFan JJia XLin C(2016)An efficient algorithm to construct disjoint path covers of DCell networksTheoretical Computer Science10.1016/j.tcs.2015.09.022609:P1(197-210)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1016/j.tcs.2015.09.022
Wang XFan JLin CJia X(2016)Vertex-disjoint paths in DCell networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2016.05.00196:C(38-44)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1016/j.jpdc.2016.05.001
Wang XFan JZhou JLin C(2016)The restricted h -connectivity of the data center network DCellDiscrete Applied Mathematics10.1016/j.dam.2015.09.002203:C(144-157)Online publication date: 20-Apr-2016
https://dl.acm.org/doi/10.1016/j.dam.2015.09.002

Recommendations

A Node-to-Set Disjoint Path Routing Algorithm in DCell Networks
CBD '14: Proceedings of the 2014 Second International Conference on Advanced Cloud and Big Data

Data center networks become increasingly important with the growth of cloud computing. For any integers k ≥ 0 and n ≥ 2, the k-dimensional DCell, Dk,n, has been proposed for one of the most important data center networks as a server-centric data center ...
An efficient algorithm to construct disjoint path covers of DCell networks

Data center networks have been becoming more and more important with the development of cloud computing. For any two integers k 0 and n 2 , the k-dimensional DCell with n-port switches, D k , n , has been proposed for one of the most important data ...
One-to-one disjoint path covers on k-ary n-cubes

The k-ary n-cube, Q"n^k, is one of the most popular interconnection networks. Let n>=2 and k>=3. It is known that Q"n^k is a nonbipartite (resp. bipartite) graph when k is odd (resp. even). In this paper, we prove that there exist r vertex disjoint ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

NPC 2013: Proceedings of the 10th IFIP International Conference on Network and Parallel Computing - Volume 8147

September 2013

416 pages

ISBN:9783642408199

Editors:
Ching-Hsien Hsu
Dept. of Computer Science and Information Engineering, Chung Hua University, Hsinchu, Taiwan R.O.C.
,
Xiaoming Li
Dept. of Electrical and Computer Engineering, University of Delaware, Newark, USA
,
Xuanhua Shi
School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, P.R. China
,
Ran Zheng
School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, P.R. China

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 19 September 2013

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 29 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wang XFan JJia XLin C(2016)An efficient algorithm to construct disjoint path covers of DCell networksTheoretical Computer Science10.1016/j.tcs.2015.09.022609:P1(197-210)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1016/j.tcs.2015.09.022
Wang XFan JLin CJia X(2016)Vertex-disjoint paths in DCell networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2016.05.00196:C(38-44)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1016/j.jpdc.2016.05.001
Wang XFan JZhou JLin C(2016)The restricted h -connectivity of the data center network DCellDiscrete Applied Mathematics10.1016/j.dam.2015.09.002203:C(144-157)Online publication date: 20-Apr-2016
https://dl.acm.org/doi/10.1016/j.dam.2015.09.002

View Options

View options

Figures

Tables

Media

View Table of Conten