서브메뉴
검색
Throughput and Latency in Reconfigurable Networks
Throughput and Latency in Reconfigurable Networks
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20250211152042
- ISBN
- 9798384049623
- DDC
- 004
- 저자명
- Wilson, Tegan.
- 서명/저자
- Throughput and Latency in Reconfigurable Networks
- 발행사항
- [Sl] : Cornell University, 2024
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2024
- 형태사항
- 145 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 86-03, Section: A.
- 주기사항
- Advisor: Kleinberg, Robert.
- 학위논문주기
- Thesis (Ph.D.)--Cornell University, 2024.
- 초록/해제
- 요약Oblivious routing has a long history in both the theory and practice of networking. In this dissertation, we initialize the formal study of oblivious routing in the context of reconfigurable networks, a new architecture that has recently come to the fore in data center networking, due to its increased energy efficiency and scaling potential. We focus on the tradeoffs between maximizing throughput and minimizing latency in this space.For every constant throughput rate, we characterize the minimum latency (up to a constant factor) achievable by an oblivious reconfigurable network design. The tradeoff curve turns out to be surprisingly subtle: it has an unexpected scalloped shape, reflecting the fact that routing becomes more costly when average path length is not an integer, since equalizing the path lengths is not achievable. We show that in order to guarantee the throughput value, Valiant load balancing is necessary, which lengthens routing paths by a factor of two. However, we also show that a strictly superior latency-throughput tradeoff is achievable when the throughput bound is relaxed to hold with high probability. The same improved tradeoff is also achievable with guaranteed throughput under time-stationary demands, provided the latency bound is relaxed to hold with high probability and that the network is allowed to be semi-oblivious, using an oblivious (randomized) connection schedule but demand-aware routing.
- 일반주제명
- Computer science
- 일반주제명
- Computer engineering
- 일반주제명
- Communication
- 키워드
- Network design
- 기타저자
- Cornell University Computer Science
- 기본자료저록
- Dissertations Abstracts International. 86-03A.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008250123s2024 us c eng d■001000017162689
■00520250211152042
■006m o d
■007cr#unu||||||||
■020 ▼a9798384049623
■035 ▼a(MiAaPQ)AAI31336723
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004
■1001 ▼aWilson, Tegan.▼0(orcid)0000-0003-2579-1147
■24510▼aThroughput and Latency in Reconfigurable Networks
■260 ▼a[Sl]▼bCornell University▼c2024
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2024
■300 ▼a145 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 86-03, Section: A.
■500 ▼aAdvisor: Kleinberg, Robert.
■5021 ▼aThesis (Ph.D.)--Cornell University, 2024.
■520 ▼aOblivious routing has a long history in both the theory and practice of networking. In this dissertation, we initialize the formal study of oblivious routing in the context of reconfigurable networks, a new architecture that has recently come to the fore in data center networking, due to its increased energy efficiency and scaling potential. We focus on the tradeoffs between maximizing throughput and minimizing latency in this space.For every constant throughput rate, we characterize the minimum latency (up to a constant factor) achievable by an oblivious reconfigurable network design. The tradeoff curve turns out to be surprisingly subtle: it has an unexpected scalloped shape, reflecting the fact that routing becomes more costly when average path length is not an integer, since equalizing the path lengths is not achievable. We show that in order to guarantee the throughput value, Valiant load balancing is necessary, which lengthens routing paths by a factor of two. However, we also show that a strictly superior latency-throughput tradeoff is achievable when the throughput bound is relaxed to hold with high probability. The same improved tradeoff is also achievable with guaranteed throughput under time-stationary demands, provided the latency bound is relaxed to hold with high probability and that the network is allowed to be semi-oblivious, using an oblivious (randomized) connection schedule but demand-aware routing.
■590 ▼aSchool code: 0058.
■650 4▼aComputer science
■650 4▼aComputer engineering
■650 4▼aCommunication
■653 ▼aOblivious routing
■653 ▼aEnergy efficiency
■653 ▼aReconfigurable network
■653 ▼aNetwork design
■690 ▼a0984
■690 ▼a0464
■690 ▼a0459
■71020▼aCornell University▼bComputer Science.
■7730 ▼tDissertations Abstracts International▼g86-03A.
■790 ▼a0058
■791 ▼aPh.D.
■792 ▼a2024
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17162689▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
