PPT-Dragonfly Topology and Routing

Outline Background Motivation Topology description Routing Minimal Routing Valiant Routing UGALG Adaptive Routing Indirect Adaptive Routing Credit Round Trip Reservation Piggyback Progressive. L. A. B. L. E. Ankit Singla, P. Brighten Godfrey. Kevin Fall, Sylvia Ratnasamy, Gianluca Iannaccone. R. U. O. I. T. N. G. FLAT NAMES. ON. Scalable Routing. Number of Nodes = . n. Not Very Scalable!. Natalie . EnrightJerger. Topology Overview. Definition: determines arrangement of channels and nodes in network. Analogous to road map. Often first step in network design. Routing and flow control build on properties of topology. Purpose. Current anonymity systems tend to sacrifice at least on of the following, low latency, high bandwidth, or resistance to traffic analysis. MANETs particularly weak to TA. Depending on the network TA can be particularly damaging as well. Costin Raiciu. Advanced Topics in Distributed Systems. Datacenter apps have . dense . traffic patterns. Map-reduce jobs – shuffle phase. Mappers. finish. Reducers must contact every . mapper. and download data. Misbah. Mubarak. , Christopher D. Carothers. Rensselaer Polytechnic Institute. Robert Ross, Philip . Carns. Argonne National Laboratory. Outline. Dragonfly Network Topology. Validation of the dragonfly model . Overview. Express Cubes. Flattened Butterfly. Fat Trees. DragonFly. Express Cubes. The Problem. Node delay dominates wire delay. Pin densities are not as high as wiring densities. In a . k-. ary. n-. Framework . documents. Joel Halpern. IETF 84 . – Routing Area Open Meeting. 1. Drafts included. draft-atlas-irs-problem-statement-00. draft-ward-irs-framework-00. draft-atlas-irs-policy-framework-00. May 24,2011. Hyungmin. Cho. Andrew . Danowitz. Mario . Flajslik. Amimul. . Ihsan. How to Train your Dragonfly. Outline. Topology. Routing. Flow Control. Hot Spot Management. Status. Topology. Dragonfly. A Network Stack for Rack-scale Computers. Paolo Costa, Hitesh . Ballani. , . Kaveh. . Razavi. , Ian . Kash. Microsoft Research Cambridge. EECS 582 – W16. 1. Authors. MSR Cambridge . Systems and . Networking. Princeton University. MW 11:00am-12:20pm. Wide-Area Traffic Management. COS 597E: Software Defined Networking. Traffic Management. Assigning resources to traffic. Optimize some objective . Min congestion, max utility, min delay, …. Ph.D. Dissertation Defense. Hao. Wang. Y. Richard Yang. Joan Feigenbaum. Jennifer Rexford (Princeton). Avi Silberschatz. Advisor:. Committee:. Efficient and Robust . Internet Traffic Engineering. Y. Richard Yang. Presented by. ：. Long . Bao. Netwrok. Topology. Topology. A. B. Topology. A1. B. A2. A3. Topology. A. B. Perfect?. Topology. Bandwidth. Latency. Cost. Scalability. Outlet. Dragonfly Topology Description. Overview. Goal is to get used to . Dragonfly. 2D (text-based graphics) game engine. Work through tutorial making a game. Saucer Shoot. Objectives. Learn how to develop a game using an engine. Provide foundational knowledge for . Krzysztof Grzegorz Szarkowicz. PLM, . kszarkowicz@juniper. .net. 2. This is a Introductory Material Based on Current Open Standards (Drafts). None of those Things Constitute Commitments to Product Specifications, Offerings or Release Dates by Juniper at this Point in Time.