{"corpus_id":215901418,"paper_sha":"a9b4544e6470dfd338d6cf17d9239cb791a3c88c","doi":"10.1587/transcom.2019ebp3219","arxiv_id":null,"pmid":null,"pmcid":null,"mag_id":3009729660,"dblp_id":"journals/ieicetb/Al-MakhlafiGYL20","acl_id":null,"title":"P-Cube: A New Two-Layer Topology for Data Center Networks Exploiting Dual-Port Servers","year":2020,"publication_date":"2020-09-01","venue":"IEICE transactions on communications","journal":{"name":"IEICE Trans. Commun.","pages":"940-950","volume":"103-B"},"journal_issn":null,"journal_title":null,"publication_types":["JournalArticle"],"pubmed_pub_types":null,"s2_fields_of_study":["Computer Science","Engineering"],"reference_count":28,"citation_count":8,"influential_citation_count":0,"is_open_access":true,"arxiv_categories":null,"arxiv_license":null,"arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":"https://www.jstage.jst.go.jp/article/transcom/E103.B/9/E103.B_2019EBP3219/_pdf","s2_open_access_landing_url":"https://www.semanticscholar.org/paper/a9b4544e6470dfd338d6cf17d9239cb791a3c88c","s2_open_access_license":null,"s2_open_access_status":"BRONZE","pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"SUMMARY Connecting a large number of servers with high bandwidth links is one of the most crucial and challenging tasks that the Data Center Network(DCN)mustfulfill. DCNfacesalot ofdifficultiesliketheeffective exploitation of DC components that, if highlighted, can aid in constructing high performance, scalable, reliable, and cost-effective DCN. In this paper, we investigate the server-centric structure. We observe that current DCs use servers that mostly come with dual ports. Effective exploitation of the ports ofinterestforbuildingthetopologystructurecanhelpinrealizingthepoten-tialitiesofreducingexpensivetopology.Ournewnetworktopology,named“ParallelCubes”(PCube),isaduplicatedefinedstructurethatutilizesthe portsintheserversandmini-switchestoformahighlyeffective,scalable,andefficientnetworkstructure.P-Cubeprovideshighperformanceinnet-worklatencyandthroughputandfaulttolerance.Additionally,P-Cubeishighlyscalabletoencompasshundredsofthousandsofserverswithalow stablediameterandhighbisectionwidth.WedesignaroutingalgorithmforP-CubenetworkthatutilizestheP-Cubestructuretostrikeabalance amongthenumerouslinksinthenetwork.Finally,numericalresultsareprovidedtoshowthatourproposedtopologyisapromisingstructureas itoutperformsothertopologiesanditissuperiortoFat-tree,BCubeandDCellbyapproximately24%,16%,8%respectivelyintermsofnetwork throughputandlatency.Moreover,P-CubeextremelyoutperformsFat-tree,andBCubestructuresintermsoftotalcost,complexityofcablingandpower consumption.","claims":[{"public_id":"cl_c6cb61f3b6f9060c2900d70c2dd2d9b2","status":"active","text":"P-Cube extremely outperforms Fat-tree and BCube structures in terms of total cost, complexity of cabling, and power consumption.","confidence":0.85,"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_c6cb61f3b6f9060c2900d70c2dd2d9b2"},{"public_id":"cl_680d8b3fcfd1a054dd8aa5153c573a5f","status":"active","text":"P-Cube is a duplicated defined structure that utilizes dual ports in servers and mini-switches to form a highly effective, scalable, and efficient network structure.","confidence":0.95,"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_680d8b3fcfd1a054dd8aa5153c573a5f"},{"public_id":"cl_4c25da532ef83114d1b296382676306e","status":"active","text":"P-Cube is highly scalable to encompass hundreds of thousands of servers with a low stable diameter and high bisection width.","confidence":0.9,"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_4c25da532ef83114d1b296382676306e"},{"public_id":"cl_e782a7ab9b3d1d57be5b9838ddeb5e8e","status":"active","text":"P-Cube outperforms Fat-tree, BCube, and DCell by approximately 24%, 16%, and 8% respectively in terms of network throughput and latency.","confidence":0.9,"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_e782a7ab9b3d1d57be5b9838ddeb5e8e"},{"public_id":"cl_eacba5998f1002fe86cfea1b5a7883a6","status":"active","text":"P-Cube provides high performance in network latency and throughput and fault tolerance.","confidence":0.9,"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_eacba5998f1002fe86cfea1b5a7883a6"}],"concepts":[{"public_id":"co_17ff16d95cd721fdd22743af930787f5","status":"active","name":"latency","description":"A performance metric measuring the delay in data transmission across the network.","types":["performance metric"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_17ff16d95cd721fdd22743af930787f5"},{"public_id":"co_1971a7983b982cafe9d9d8363e4bf8b5","status":"active","name":"DCell","description":"A server-centric data center network topology used as a baseline for comparison with P-Cube.","types":["baseline topology"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_1971a7983b982cafe9d9d8363e4bf8b5"},{"public_id":"co_1f2d2c597e1c6ce0c1247dc991f2310d","status":"active","name":"network throughput","description":"A performance metric measuring the amount of data transferred through the network per unit time.","types":["performance metric"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_1f2d2c597e1c6ce0c1247dc991f2310d"},{"public_id":"co_3f9e3476de0af8bcb31e483bd31c4e5c","status":"active","name":"BCube","description":"A server-centric data center network topology used as a baseline for comparison with P-Cube.","types":["baseline topology"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_3f9e3476de0af8bcb31e483bd31c4e5c"},{"public_id":"co_5c99a03ea829034ec07f9fcfccf98833","status":"active","name":"bisection width","description":"A topological property measuring the minimum number of links that must be removed to split the network into two equal halves.","types":["metric"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_5c99a03ea829034ec07f9fcfccf98833"},{"public_id":"co_63da96853a2319ab70cc916d3339a5d2","status":"active","name":"mini-switches","description":"Small switches used together with dual-port servers in the P-Cube topology.","types":["hardware component"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_63da96853a2319ab70cc916d3339a5d2"},{"public_id":"co_6eb5fbf5cd7bc64aa2bf93c0519c2537","status":"active","name":"P-Cube","description":"A new two-layer topology for data center networks that exploits dual-port servers and mini-switches, named Parallel Cubes.","types":["topology","network structure"],"aliases":["Parallel Cubes"],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_6eb5fbf5cd7bc64aa2bf93c0519c2537"},{"public_id":"co_98a4764cd3ff1d27655a30bbb6a29cb4","status":"active","name":"fault tolerance","description":"The ability of the network to continue operating despite failures of components.","types":["property"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_98a4764cd3ff1d27655a30bbb6a29cb4"},{"public_id":"co_ccb4204202eb7a616fb20855a6623f53","status":"active","name":"Fat-tree","description":"A conventional data center network topology used as a baseline for comparison with P-Cube.","types":["baseline topology"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_ccb4204202eb7a616fb20855a6623f53"},{"public_id":"co_ed71e35a337423f6acfe37c788ca034e","status":"active","name":"dual-port servers","description":"Servers that mostly come with two ports, exploited in P-Cube to build the topology structure.","types":["hardware component"],"aliases":[],"contributors":[{"id":2,"public_id":"4715169a40","public_label":"AK (4715169a40)","roles":["extraction"],"url":"https://sah.borca.ai/u/4715169a40"},{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["review"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_ed71e35a337423f6acfe37c788ca034e"}],"external_ids":{"DOI":"10.1587/transcom.2019ebp3219","ArXiv":null,"PubMed":null,"PubMedCentral":null,"MAG":3009729660,"DBLP":"journals/ieicetb/Al-MakhlafiGYL20","ACL":null},"open_access":{"is_open_access":true,"pdf_url":"https://www.jstage.jst.go.jp/article/transcom/E103.B/9/E103.B_2019EBP3219/_pdf","landing_url":"https://www.semanticscholar.org/paper/a9b4544e6470dfd338d6cf17d9239cb791a3c88c","source":"semantic_scholar","pdf_url_source":"semantic_scholar_open_access_pdf","license":null,"status":"BRONZE","reason":null},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":false,"full_text_source":null,"count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":633592,"paper_uid":"eb7f053b-e691-4f1d-8343-8d22398375ca","canonical_identity":{"paper_id":633592,"paper_uid":"eb7f053b-e691-4f1d-8343-8d22398375ca","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/215901418"}