Routing and Congestion Problems in General Networks. Presented by Jun Zou CAS 744. Outline. 1. Introduction to Routing and Congestion 2. Network Model and Objective 3. Construction of Tree 4. Simulation Graph on Tree 5. Simulation Tree on Graph 6. Conclusion and Application
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Presented by Jun Zou
A graph G=(V,E): Associated tree TG=(Vt, Et)
For a subset X, the bandwidth of all edges that are adjacent to nodes in X and that do not connect nodes of the same cluster to .
One important property: Additive
where Ctis the congestion on TG, h=h(TG),
-competitive with respect to the congestion.
“A Practical Algorithm for Constructing Oblivious Routing Schemes”, published at fifteenth annual ACM symposium on Parallel algorithms and architectures.