2026-09-19T15:05:30Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/45451 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Godfrey, Philip B. Sharma, Abhishek 2013-08-22T16:40:33Z 2013-08-22T16:40:33Z 2013-08 2013-08-22T16:40:33Z 2013-08 The increase in demand and popularity of cloud and big data applications has driven the need for higher throughput data center network design. Recent work to provide topologies with much denser interconnects pose a difficult challenge for routing of traffic within a data center. Even with proposals like MPTCP that improve upon TCP, there is a still a gap between theoretical throughput and empirical throughput. Our goal is to study routing in data centers at both flow and packet-level to determine the cause of inefficiency and study methods of path selection that may help bridge the gap between optimal throughput and packet level throughput. The difference in throughput can be attributed to inefficiency due to path selection and inefficiency due to protocol overhead; we quantify the contribution of each. Focusing on path selection, our experiments show that k-disjoint paths provide much better throughput in most topologies than the previously used k-shortest paths. We also show that one can positively impact network throughput by varying the number of paths according to network density. Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-07-16T17:46:22Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 thesis-ex.tex: 27124 bytes, checksum: 4df03ae7141b8e7d1943296ec4eadf03 (MD5) Sharma_Abhishek.pdf: 276038 bytes, checksum: 1297a6722055cb950d1743b8849b6de3 (MD5) Made available in DSpace on 2013-08-22T16:40:33Z (GMT). No. of bitstreams: 3 Abhishek_Sharma.pdf: 276038 bytes, checksum: 1297a6722055cb950d1743b8849b6de3 (MD5) thesis-ex.tex: 27124 bytes, checksum: 4df03ae7141b8e7d1943296ec4eadf03 (MD5) license.txt: 4065 bytes, checksum: 2b9010fccdf3eb11fbea24b5ef1f5738 (MD5) http://hdl.handle.net/2142/45451 en Copyright 2013 Abhishek Sharma. All rights reserved Data Center Multipath Transmission Control Protocol (MPTCP) Jellyfish Shortest Paths Disjoint Paths Throughput Random Regular Graph (RRG) Random Permutation Matrix Switches Servers Ports Network Density High throughput path selection for unstructured data center networks text Computer Science 1434 Computer Science 0112 University of Illinois at Urbana-Champaign Thesis M.S. MS:CS:BS/MS Program - UIUC 10KS1854MS