{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/98367"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/98367","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Algorithms for interactive, distributed and networked systems","abstract":"In recent years, massive growth in internet usage has spurred the emergence of complex large-scale networking systems to serve growing user bases, bandwidth and computation requirements. For example, data center facilities -- workhorses of today's internet -- have evolved to house upward of several hundreds of thousands of servers; content distribution networks with high capacity and wide coverage have emerged as a de facto content dissemination modality, and peer-to-peer applications with hundreds of thousands of users are increasingly becoming popular. At these scales, it becomes critical to operate at high efficiencies as the price of idling resources can be significant. In particular, the interaction between agents (servers, peers etc.) is a defining factor of efficiency in these systems -- applications are often communication intensive, whereas agents share links of only limited bandwidth. This necessitates the use of principled algorithms, as efficient communication to a large extent depends on the interaction protocols. We study data center networks and peer-to-peer networks as canonical examples of modern-day large-scale networking systems. Server-to-server interaction is an integral part of the data center's operation. The latency of these interactions is often a significant bottleneck toward overall job completion times. We study complementary approaches toward reducing this latency: (i) design of computation algorithms that minimize interaction and (ii) optimal scheduling algorithms to maximally utilize the network fabric. We also consider peer-to-peer networks as an emerging mode of content distribution and sharing. Unlike data centers, these networks are flexible in their network structure and also scale well, but require decentralized algorithms for control. Of central importance here is the design of a network topology that enables efficient peer interactions for optimal application performance. We propose novel topology designs for two popular applications: (i) multimedia streaming and (ii) anonymity in Bitcoin's peer-to-peer network.","abstract_html":"In recent years, massive growth in internet usage has spurred the emergence of complex large-scale networking systems to serve growing user bases, bandwidth and computation requirements. For example, data center facilities -- workhorses of today's internet -- have evolved to house upward of several hundreds of thousands of servers; content distribution networks with high capacity and wide coverage have emerged as a de facto content dissemination modality, and peer-to-peer applications with hundreds of thousands of users are increasingly becoming popular. At these scales, it becomes critical to operate at high efficiencies as the price of idling resources can be significant. In particular, the interaction between agents (servers, peers etc.) is a defining factor of efficiency in these systems -- applications are often communication intensive, whereas agents share links of only limited bandwidth. This necessitates the use of principled algorithms, as efficient communication to a large extent depends on the interaction protocols. We study data center networks and peer-to-peer networks as canonical examples of modern-day large-scale networking systems. Server-to-server interaction is an integral part of the data center's operation. The latency of these interactions is often a significant bottleneck toward overall job completion times. We study complementary approaches toward reducing this latency: (i) design of computation algorithms that minimize interaction and (ii) optimal scheduling algorithms to maximally utilize the network fabric. We also consider peer-to-peer networks as an emerging mode of content distribution and sharing. Unlike data centers, these networks are flexible in their network structure and also scale well, but require decentralized algorithms for control. Of central importance here is the design of a network topology that enables efficient peer interactions for optimal application performance. We propose novel topology designs for two popular applications: (i) multimedia streaming and (ii) anonymity in Bitcoin's peer-to-peer network.","abstract_has_math":false,"creators":["Bojja Venkatakrishnan, Shaileshh"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Viswanath, Pramod","Hajek, Bruce","Srikant, R.","Alizadeh, Mohammad"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017-09-29T17:56:42Z","date_published":"2017-09-29T17:56:42Z","updated_at":"2026-07-22T22:24:35Z","subjects":["Network algorithms","Interactive communication","Communication complexity","Protocol compression","Scheduling","Circuit switch","Data center networks","Submodularity","Peer-to-peer","Streaming","Topology","Bitcoin","Anonymity","Distributed algorithms","Cryptocurrency"],"languages":["en"],"rights":["Copyright 2017 Shaileshh Bojja Venkatakrishnan"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/98367","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Viswanath, Pramod","Hajek, Bruce","Srikant, R.","Alizadeh, Mohammad"]},{"key":"dc:creator","label":"Author","values":["Bojja Venkatakrishnan, Shaileshh"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2017-09-29T17:56:42Z","2017-07-12","2017-08"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Network algorithms","Interactive communication","Communication complexity","Protocol compression","Scheduling","Circuit switch","Data center networks","Submodularity","Peer-to-peer","Streaming","Topology","Bitcoin","Anonymity","Distributed algorithms","Cryptocurrency"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2017 Shaileshh Bojja Venkatakrishnan"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/98367"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In recent years, massive growth in internet usage has spurred the emergence of complex large-scale networking systems to serve growing user bases, bandwidth and computation requirements. For example, data center facilities -- workhorses of today's internet -- have evolved to house upward of several hundreds of thousands of servers; content distribution networks with high capacity and wide coverage have emerged as a de facto content dissemination modality, and peer-to-peer applications with hundreds of thousands of users are increasingly becoming popular. At these scales, it becomes critical to operate at high efficiencies as the price of idling resources can be significant. In particular, the interaction between agents (servers, peers etc.) is a defining factor of efficiency in these systems -- applications are often communication intensive, whereas agents share links of only limited bandwidth. This necessitates the use of principled algorithms, as efficient communication to a large extent depends on the interaction protocols. We study data center networks and peer-to-peer networks as canonical examples of modern-day large-scale networking systems. Server-to-server interaction is an integral part of the data center's operation. The latency of these interactions is often a significant bottleneck toward overall job completion times. We study complementary approaches toward reducing this latency: (i) design of computation algorithms that minimize interaction and (ii) optimal scheduling algorithms to maximally utilize the network fabric. We also consider peer-to-peer networks as an emerging mode of content distribution and sharing. Unlike data centers, these networks are flexible in their network structure and also scale well, but require decentralized algorithms for control. Of central importance here is the design of a network topology that enables efficient peer interactions for optimal application performance. We propose novel topology designs for two popular applications: (i) multimedia streaming and (ii) anonymity in Bitcoin's peer-to-peer network.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2017-09-29 without embargo terms","The student, Shaileshh Bojja Venkatakrishnan, accepted the attached license on 2017-07-11 at 09:35.","The student, Shaileshh Bojja Venkatakrishnan, submitted this Dissertation for approval on 2017-07-11 at 10:00.","This Dissertation was approved for publication on 2017-07-12 at 12:27.","DSpace SAF Submission Ingestion Package generated from Vireo submission #11391 on 2017-09-29 at 11:29:41","Made available in DSpace on 2017-09-29T17:56:42Z (GMT). No. of bitstreams: 4 BOJJAVENKATAKRISHNAN-DISSERTATION-2017.pdf: 2363939 bytes, checksum: f274f1b2e21dd554dd08266b076abbeb (MD5) Manuscript.zip: 9038976 bytes, checksum: 5dd6b650183e7ba15283a2a2065084f8 (MD5) LICENSE.txt: 4228 bytes, checksum: d54c4ffc46e0d7df7886d0c65814816b (MD5) PROQUEST_LICENSE.txt: 4574 bytes, checksum: 5cfb93e7a64406230fc45279777a2a75 (MD5) Previous issue date: 2017-07-12"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Algorithms for interactive, distributed and networked systems"]}]}],"canonical_facts":{"dc:contributor":["Viswanath, Pramod","Hajek, Bruce","Srikant, R.","Alizadeh, Mohammad"],"dc:creator":["Bojja Venkatakrishnan, Shaileshh"],"dc:date":["2017-09-29T17:56:42Z","2017-07-12","2017-08"],"dc:description":["In recent years, massive growth in internet usage has spurred the emergence of complex large-scale networking systems to serve growing user bases, bandwidth and computation requirements. For example, data center facilities -- workhorses of today's internet -- have evolved to house upward of several hundreds of thousands of servers; content distribution networks with high capacity and wide coverage have emerged as a de facto content dissemination modality, and peer-to-peer applications with hundreds of thousands of users are increasingly becoming popular. At these scales, it becomes critical to operate at high efficiencies as the price of idling resources can be significant. In particular, the interaction between agents (servers, peers etc.) is a defining factor of efficiency in these systems -- applications are often communication intensive, whereas agents share links of only limited bandwidth. This necessitates the use of principled algorithms, as efficient communication to a large extent depends on the interaction protocols. We study data center networks and peer-to-peer networks as canonical examples of modern-day large-scale networking systems. Server-to-server interaction is an integral part of the data center's operation. The latency of these interactions is often a significant bottleneck toward overall job completion times. We study complementary approaches toward reducing this latency: (i) design of computation algorithms that minimize interaction and (ii) optimal scheduling algorithms to maximally utilize the network fabric. We also consider peer-to-peer networks as an emerging mode of content distribution and sharing. Unlike data centers, these networks are flexible in their network structure and also scale well, but require decentralized algorithms for control. Of central importance here is the design of a network topology that enables efficient peer interactions for optimal application performance. We propose novel topology designs for two popular applications: (i) multimedia streaming and (ii) anonymity in Bitcoin's peer-to-peer network.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2017-09-29 without embargo terms","The student, Shaileshh Bojja Venkatakrishnan, accepted the attached license on 2017-07-11 at 09:35.","The student, Shaileshh Bojja Venkatakrishnan, submitted this Dissertation for approval on 2017-07-11 at 10:00.","This Dissertation was approved for publication on 2017-07-12 at 12:27.","DSpace SAF Submission Ingestion Package generated from Vireo submission #11391 on 2017-09-29 at 11:29:41","Made available in DSpace on 2017-09-29T17:56:42Z (GMT). No. of bitstreams: 4 BOJJAVENKATAKRISHNAN-DISSERTATION-2017.pdf: 2363939 bytes, checksum: f274f1b2e21dd554dd08266b076abbeb (MD5) Manuscript.zip: 9038976 bytes, checksum: 5dd6b650183e7ba15283a2a2065084f8 (MD5) LICENSE.txt: 4228 bytes, checksum: d54c4ffc46e0d7df7886d0c65814816b (MD5) PROQUEST_LICENSE.txt: 4574 bytes, checksum: 5cfb93e7a64406230fc45279777a2a75 (MD5) Previous issue date: 2017-07-12"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/98367"],"dc:language":["en"],"dc:rights":["Copyright 2017 Shaileshh Bojja Venkatakrishnan"],"dc:subject":["Network algorithms","Interactive communication","Communication complexity","Protocol compression","Scheduling","Circuit switch","Data center networks","Submodularity","Peer-to-peer","Streaming","Topology","Bitcoin","Anonymity","Distributed algorithms","Cryptocurrency"],"dc:title":["Algorithms for interactive, distributed and networked systems"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:35Z"}