서브메뉴
검색
Designing Compact Data Structures for Network Measurement and Control- [electronic resource]
Designing Compact Data Structures for Network Measurement and Control- [electronic resource]
상세정보
- 자료유형
- 학위논문파일 국외
- 최종처리일시
- 20240214101919
- ISBN
- 9798380847711
- DDC
- 004
- 저자명
- Chen, Xiaoqi.
- 서명/저자
- Designing Compact Data Structures for Network Measurement and Control - [electronic resource]
- 발행사항
- [S.l.]: : Princeton University., 2023
- 발행사항
- Ann Arbor : : ProQuest Dissertations & Theses,, 2023
- 형태사항
- 1 online resource(210 p.)
- 주기사항
- Source: Dissertations Abstracts International, Volume: 85-05, Section: B.
- 주기사항
- Advisor: Rexford, Jennifer.
- 학위논문주기
- Thesis (Ph.D.)--Princeton University, 2023.
- 사용제한주기
- This item must not be sold to any third party vendors.
- 초록/해제
- 요약This dissertation explores the implementation of network measurement and closed-loop control in the data plane of high-speed programmable switches. After discussing the algorithmic constraints imposed by the switch pipeline architecture, primarily stemming from the requirement of high-speed processing, we share our experience in tailoring algorithms for the data plane. Initially, we focus on efficient measurement algorithms, and present two works for detecting heavy hitters and executing multiple distinct-count queries; both require designing novel approximate data structures to meet the tight memory access constraints. Subsequently, we pivot towards using real-time, closed-loop control in the data plane for performance optimization, and present two works for mitigating microbursts and enforcing fair bandwidth limits; both require approximated computation and exploit the sub-millisecond reaction latency unattainable through conventional control planes. We hope by sharing our experience and techniques, which are widely applicable to various algorithms and other data-plane hardware targets, we can lay the foundation for future innovations in the field of network programming for researchers and practitioners alike.
- 일반주제명
- Computer science.
- 일반주제명
- Computer engineering.
- 일반주제명
- Systems science.
- 키워드
- Queuing
- 키워드
- Sketch
- 기타저자
- Princeton University Computer Science
- 기본자료저록
- Dissertations Abstracts International. 85-05B.
- 기본자료저록
- Dissertation Abstract International
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008240612s2023 us |||||||||||||||c||eng d■001000016935334
■00520240214101919
■006m o d
■007cr#unu||||||||
■020 ▼a9798380847711
■035 ▼a(MiAaPQ)AAI30689768
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004
■1001 ▼aChen, Xiaoqi.
■24510▼aDesigning Compact Data Structures for Network Measurement and Control▼h[electronic resource]
■260 ▼a[S.l.]:▼bPrinceton University. ▼c2023
■260 1▼aAnn Arbor :▼bProQuest Dissertations & Theses, ▼c2023
■300 ▼a1 online resource(210 p.)
■500 ▼aSource: Dissertations Abstracts International, Volume: 85-05, Section: B.
■500 ▼aAdvisor: Rexford, Jennifer.
■5021 ▼aThesis (Ph.D.)--Princeton University, 2023.
■506 ▼aThis item must not be sold to any third party vendors.
■520 ▼aThis dissertation explores the implementation of network measurement and closed-loop control in the data plane of high-speed programmable switches. After discussing the algorithmic constraints imposed by the switch pipeline architecture, primarily stemming from the requirement of high-speed processing, we share our experience in tailoring algorithms for the data plane. Initially, we focus on efficient measurement algorithms, and present two works for detecting heavy hitters and executing multiple distinct-count queries; both require designing novel approximate data structures to meet the tight memory access constraints. Subsequently, we pivot towards using real-time, closed-loop control in the data plane for performance optimization, and present two works for mitigating microbursts and enforcing fair bandwidth limits; both require approximated computation and exploit the sub-millisecond reaction latency unattainable through conventional control planes. We hope by sharing our experience and techniques, which are widely applicable to various algorithms and other data-plane hardware targets, we can lay the foundation for future innovations in the field of network programming for researchers and practitioners alike.
■590 ▼aSchool code: 0181.
■650 4▼aComputer science.
■650 4▼aComputer engineering.
■650 4▼aSystems science.
■653 ▼aNetwork measurement
■653 ▼aProgrammable data plane
■653 ▼aQueuing
■653 ▼aSketch
■653 ▼aSoftware-defined networking
■653 ▼aStreaming algorithm
■690 ▼a0984
■690 ▼a0464
■690 ▼a0790
■71020▼aPrinceton University▼bComputer Science.
■7730 ▼tDissertations Abstracts International▼g85-05B.
■773 ▼tDissertation Abstract International
■790 ▼a0181
■791 ▼aPh.D.
■792 ▼a2023
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T16935334▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
■980 ▼a202402▼f2024
