서브메뉴
검색
Towards Scalable and Optimal Oblivious Reconfigurable Networks
Towards Scalable and Optimal Oblivious Reconfigurable Networks
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20250211152711
- ISBN
- 9798384053040
- DDC
- 004
- 저자명
- Amir, Daniel.
- 서명/저자
- Towards Scalable and Optimal Oblivious Reconfigurable Networks
- 발행사항
- [Sl] : Cornell University, 2024
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2024
- 형태사항
- 141 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 86-03, Section: B.
- 주기사항
- Advisor: Weatherspoon, Hakim.
- 학위논문주기
- Thesis (Ph.D.)--Cornell University, 2024.
- 초록/해제
- 요약Datacenter network demands show explosive growth, doubling nearly every year. Unfortunately, datacenter networks are built primarily using packet switches, which do not scale as quickly as these demands and are expected to scale even slower in the future. Nanosecond-scale optical circuit switches represent a potential alternative: unlike packet switches, they are not limited by semiconductor scaling trends, and unlike previous optical circuit switches, they are fast enough to support all datacenter traffic types, including short flows. To be used to their full potential, however, these switches will require novel network designs.This dissertation examines how to build datacenter-scale networks using exclusively nanosecond-scale optical circuit switches. We identify the Oblivious Reconfigurable Network (ORN) design paradigm, which is designed to use the capabilities of these switches. We develop Shale, the first ORN to achieve a tunable tradeoff between latency scalability and throughput. We also show how to compose multiple tunings to support multiple traffic classes, a common feature of datacenter network traffic. To enable Shale, we develop a novel congestion control algorithm tailored to Shale's unique environment, which we extend to address node and link failures. Finally, we implement a Field-Programmable Gate Array (FPGA)-based hardware prototype for a Shale end-host. Our designs show that Shale can achieve orders of magnitude better latency and hardware resource requirements than previous ORN designs. Additionally, we investigate the fundamental performance limits of ORNs, and prove that ORNs must grapple with an inherent tradeoff between latency and throughput. The tradeoffs achieved by Shale match this fundamental tradeoff up to a constant factor, meaning that every tuning of Shale is Pareto optimal among ORNs. Together, Shale and our exploration of the fundamental limits of ORNs represent important steps towards scalable and optimal ORNs.
- 일반주제명
- Computer science
- 일반주제명
- Computer engineering
- 일반주제명
- Information technology
- 기타저자
- Cornell University Computer Science
- 기본자료저록
- Dissertations Abstracts International. 86-03B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008250123s2024 us c eng d■001000017163464
■00520250211152711
■006m o d
■007cr#unu||||||||
■020 ▼a9798384053040
■035 ▼a(MiAaPQ)AAI31488702
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004
■1001 ▼aAmir, Daniel.▼0(orcid)0000-0002-6294-9604
■24510▼aTowards Scalable and Optimal Oblivious Reconfigurable Networks
■260 ▼a[Sl]▼bCornell University▼c2024
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2024
■300 ▼a141 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 86-03, Section: B.
■500 ▼aAdvisor: Weatherspoon, Hakim.
■5021 ▼aThesis (Ph.D.)--Cornell University, 2024.
■520 ▼aDatacenter network demands show explosive growth, doubling nearly every year. Unfortunately, datacenter networks are built primarily using packet switches, which do not scale as quickly as these demands and are expected to scale even slower in the future. Nanosecond-scale optical circuit switches represent a potential alternative: unlike packet switches, they are not limited by semiconductor scaling trends, and unlike previous optical circuit switches, they are fast enough to support all datacenter traffic types, including short flows. To be used to their full potential, however, these switches will require novel network designs.This dissertation examines how to build datacenter-scale networks using exclusively nanosecond-scale optical circuit switches. We identify the Oblivious Reconfigurable Network (ORN) design paradigm, which is designed to use the capabilities of these switches. We develop Shale, the first ORN to achieve a tunable tradeoff between latency scalability and throughput. We also show how to compose multiple tunings to support multiple traffic classes, a common feature of datacenter network traffic. To enable Shale, we develop a novel congestion control algorithm tailored to Shale's unique environment, which we extend to address node and link failures. Finally, we implement a Field-Programmable Gate Array (FPGA)-based hardware prototype for a Shale end-host. Our designs show that Shale can achieve orders of magnitude better latency and hardware resource requirements than previous ORN designs. Additionally, we investigate the fundamental performance limits of ORNs, and prove that ORNs must grapple with an inherent tradeoff between latency and throughput. The tradeoffs achieved by Shale match this fundamental tradeoff up to a constant factor, meaning that every tuning of Shale is Pareto optimal among ORNs. Together, Shale and our exploration of the fundamental limits of ORNs represent important steps towards scalable and optimal ORNs.
■590 ▼aSchool code: 0058.
■650 4▼aComputer science
■650 4▼aComputer engineering
■650 4▼aInformation technology
■653 ▼aDatacenter networks
■653 ▼aNanosecond switching
■653 ▼aOptical circuit switching
■653 ▼aOblivious Reconfigurable Network
■653 ▼aField-Programmable Gate Array
■690 ▼a0984
■690 ▼a0489
■690 ▼a0464
■71020▼aCornell University▼bComputer Science.
■7730 ▼tDissertations Abstracts International▼g86-03B.
■790 ▼a0058
■791 ▼aPh.D.
■792 ▼a2024
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17163464▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
