Linked Decompositions of Networks and Polya Urns with Choice

Channel:
Microsoft Research
Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=uUbMMyORrw8


Duration: 1:03:08
52 views
0

We propose a novel graph decomposition that enables a scalable form of internet routing with roughly sqrt(n) memory and logarithmic delay. Subnetworks are required to be small and with small diameter, no three of them to overlap, but any two of them to do so. Our main result is that several popular models of internet-like



Other Videos By Microsoft Research


2016-09-06Rate Control Protocol (RCP): Congestion Control to Make Flows Complete Quickly
2016-09-06Engineering Performance Using Control Theory: A One Day How-To: Introduction & Theory Part 1
2016-09-06Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation
2016-09-06Interaction Design for One-Handed Use of Mobile Devices
2016-09-06Einstein: His Life and Universe
2016-09-06Virtual Reality Therapy: Using immersive virtual reality games to help reduce suffering
2016-09-06A Crowd of One: The Future of Individual Identity           
2016-09-06Ubiquitous Reflective Technologies
2016-09-06Customizing the Computational Capabilities of Processors
2016-09-06Virgil: Objects on the Head of a Pin
2016-09-06Linked Decompositions of Networks and Polya Urns with Choice
2016-09-06The Light Portal: 3D Reconstruction and Visualization over Space and Time
2016-09-06Distributed Speculative Execution: A Programming Model for Reliability and Increased Performance
2016-09-06Director of MITΓÇÖs Auto-ID Laboratory and a professor of Information Engineering
2016-09-06Path invariants
2016-09-06Records, sums, cases, and exceptions: Row-polymorphism at work [1/9]
2016-09-06Internet 3.0: Ten Problems with Current Internet Architecture and Solutions for the Next Generation
2016-09-06The Bilateral Grid and a Topological Approach to Image Segmentation
2016-09-06Software Development Practices and Knowledge Sharing: A Comparison of XP & Waterfall Team Behaviors
2016-09-06How likely is BuffonΓÇÖs needle to meet a Cantor square?
2016-09-06Dense triangle-free digraphs


Tags:
microsoft research