본문

Making Video Traffic a Friendlier Internet Neighbor- [electronic resource]
Making Video Traffic a Friendlier Internet Neighbor - [electronic resource]
Inhalt Info
Making Video Traffic a Friendlier Internet Neighbor- [electronic resource]
자료유형  
 학위논문파일 국외
최종처리일시  
20240214101626
ISBN  
9798380486071
DDC  
741
저자명  
Spang, Bruce A.
서명/저자  
Making Video Traffic a Friendlier Internet Neighbor - [electronic resource]
발행사항  
[S.l.]: : Stanford University., 2023
발행사항  
Ann Arbor : : ProQuest Dissertations & Theses,, 2023
형태사항  
1 online resource(136 p.)
주기사항  
Source: Dissertations Abstracts International, Volume: 85-04, Section: A.
주기사항  
Advisor: Johari, Ramesh;Winstein, Keith.
학위논문주기  
Thesis (Ph.D.)--Stanford University, 2023.
사용제한주기  
This item must not be sold to any third party vendors.
초록/해제  
요약Streaming video trac from services like Netflix and YouTube accounts for the vast majority internet trac today-recent estimates put the fraction as high as 60-75% of all bytes sent over the internet. Given video trac is such a large fraction of the internet, this thesis makes video trac friendlier to neighboring applications that share the same networks.The thesis begins with Sammy, a system that smooths out video trac so that the throughput of a video session is close to the minimum the video session needs for good performance. By judiciously picking throughput based on the needs of the video application, Sammy is able to substantially smooth out video trac. In internet-scale experiments, Sammy reduces throughput of video trac by more than half and dramatically reduce congestion, all while slightly improving video quality of experience over today's top production algorithms.The thesis next considers how new algorithms that a↵ect congestion on the internet (like Sammy) are evaluated in networking research today. The gold standard is to run large-scale A/B tests, to understand at how an algorithm actually performs in practice. I show in experiments run at scale that typical A/B tests can lead to biased results, even to the point of switching the direction of results-an algorithm that appears worse in an A/B test might actually improve performance when deployed, and vice versa. I discuss the implications of this and suggest how researchers can deal with this bias.Finally, I revisit the long-standing problem of sizing bu↵ers in routers. Prior work suggested that bu↵ers can be reduced by a factor of square root of the number of flows using the router, o↵ering dramatic bu↵er reductions in networks carrying many flows. I revisit these results, removing assumptions and showing that they hold for modern congestion control algorithms. Importantly, I discuss how our approach of smoothing video trac with Sammy challenges the assumptions of the classic bu↵er sizing problem, potentially allowing for a future with much smaller bu↵ers.Overall, this thesis invites us to reconsider how we deal with network congestion at scale. Rather than focusing on congestion control algorithms that maximize throughput, we should prioritize the ways we actually use the internet-applications like video streaming and web browsing and gaming and so on. If we do so, we can reduce congestion and improve the performance of all applications that share the internet.
일반주제명  
Design.
일반주제명  
Control algorithms.
일반주제명  
Web studies.
기타저자  
Stanford University.
기본자료저록  
Dissertations Abstracts International. 85-04A.
기본자료저록  
Dissertation Abstract International
전자적 위치 및 접속  
로그인 후 원문을 볼 수 있습니다.
New Books MORE
최근 3년간 통계입니다.

Buch Status

  • Reservierung
  • frei buchen
  • Meine Mappe
  • Erste Aufräumarbeiten Anfrage
  • 비도서대출신청
  • 야간 도서대출신청
Sammlungen
Registrierungsnummer callnumber Standort Verkehr Status Verkehr Info
TF08876 전자도서
마이폴더 부재도서신고 비도서대출신청

* Kredite nur für Ihre Daten gebucht werden. Wenn Sie buchen möchten Reservierungen, klicken Sie auf den Button.

해당 도서를 다른 이용자가 함께 대출한 도서

Related Popular Books

로그인 후 이용 가능합니다.