PPT-Adaptive Routing David Ouellet

Poulin 4073219 CEG 4136 Computer Architecture III November 16 th 2010 QuestionsTopics Describe several algorithms used for adaptive routing Describe problems and advantages of these routing . Maltz David B Johnson YihChun Hu Jorjeta Jetcheva Computer Science Department Carnegie Mellon University Pittsburgh PA 15213 httpwwwmonarchcscmuedu Abstract An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary n Izraelevitz David H Albonesi Computer Systems Laboratory Cornell University Ithaca NY 14853 pp234ami23dha7cornelledu Christine A Shoemaker School of Civil and Environmental Engineering Cornell University Ithaca NY 14853 cas12cornelledu ABSTRACT Futu . Network Architecture. Shubhendu. S. . Mukherjee. , Peter . Bannon. , Steven Lang, Aaron Spink, and David Webb. Alpha Development Group, Compaq. HOT Interconnects 9 (2001). Presented by John Ingalls. Shi . Bai. , . Weiyi. Zhang, . Guoliang. . Xue. , . Jian. Tang, and . Chonggang. Wang. University of Minnesota, AT&T Lab, Arizona State University, Syracuse University, NEC Lab. 2012 IEEE INFOCOM. Hierarchy . An Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks. M. . Aslam. . hayat. Overview. Introduction. Radio Model. Existing Protocols. Direct Transmission. Minimum Transmission Energy. Ran Manevich, Israel Cidon, Avinoam Kolodny, . Isask. ’. har. (Zigi) Walter and Shmuel Wimer. Technion. . –. Israel Institute of Technology. Group. Research. QNoC. Global traffic information is essential to make the right decision!. AMANO, Hideharu. Textbook pp.. １６６－１８５. Packet transfer. Body. destination. length. ，. source. ，. etc. ．. Header. Flit. 8bit~64bit. Packet switching. Circuit switching. Flit. ： . for . Big-Data Applications . Running on Data Center Networks. * . Mellanox . Technologies . LTD, . +. Technion - EE Department. Eitan Zahavi. *+. Isaac Keslassy. +. . Avinoam Kolodny. +. ANCS 2012. for Disruption Tolerant Networks. Hideya Ochiai Hiroshi Esaki. The University of Tokyo / NICT. DTNRG, IETF 76 Hiroshima, 2009-11-13. Outline. Introduction. Potential-based entropy adaptive routing. Reading Assignment. Sections . 4.1-4.5. Alternative: relevant papers. . References provided. Overview. Separate the routing decisions from implementation. Choice of path vs. . Performance. E.g., buffering, route computation implementation. IEEE TC. , May 1987. F. . Silla. , and J. . Duato. , “Improving the Efficiency of Adaptive Routing in Networks with Irregular Topology,” . HIPC. 1997. J. . Duato. “A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks,” . Matt Hidinger. Program Manager. B8002. @. MattHidinger. First, let’s talk about Cards. Cards had a humble beginning on social media. Web Pages. Video. Reservations. Weather. Reminders. And then…. Networks. ANCS 2010. . Rohit Sunkam Ramanujam. Bill Lin. Electrical and Computer Engineering. University of California, San Diego. Networks. -on-Chip. Chip-multiprocessors (. CMPs. ) increasingly popular. Routing Distance Vector (DV) Routing Sets up minimum distance routes to all nodes in a network Routing tables created at each node with following fields: The core algorithm is based on ‘ Bellman Ford shortest path algorithm