Full Record

New Search | Similar Records

Title High throughput path selection for unstructured data center networks
Publication Date
Date Accessioned
Degree MS
Discipline/Department 0112
Degree Level thesis
University/Publisher University of Illinois – Urbana-Champaign
Abstract 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.
Subjects/Keywords 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
Contributors Godfrey, Philip B. (advisor)
Language en
Rights Copyright 2013 Abhishek Sharma. All rights reserved
Country of Publication us
Record ID handle:2142/45451
Repository uiuc
Date Indexed 2020-03-09
Grantor University of Illinois at Urbana-Champaign
Issued Date 2013-08-22 16:40:33

Sample Search Hits | Sample Images

…paper are all conducted on the Jellyfish topology. The topology is essentially a random regular graph constructed at the top-of-rack (ToR) switch layer. Each switch consists of p ports, it uses k ports to connect to servers and p - k ports to…

…switch y using only shortest paths, flow is sent through an arbitrary link a - b if path length of x - a + path length of b - y + 1 = shortest path length of x - y The shortest path length can be pre-computed once the random regular graph and traffic…

…source and destination, we pick the maximum possible number of disjoint paths that exist between the pair. 3.3 Traffic matrices The traffic matrices used are random permutation traffic i.e. each source server randomly selects a destination server to…

…to do with traffic patterns and as part of our future work, we would like to experiment on other traffic patterns apart from random permutation traffic. 3.4 Throughput computation In our experiments, we have two methods to compute network…