PPT-Compiling Network Path Queries

Author : stefany-barnette | Published Date : 2018-03-08

Srinivas Narayana Princeton University Network Management is Complex Computer networks getting bigger Commodity components high failure rates Outages are costly

Presentation Embed Code

Download Presentation

Download Presentation The PPT/PDF document "Compiling Network Path Queries" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Compiling Network Path Queries: Transcript


Srinivas Narayana Princeton University Network Management is Complex Computer networks getting bigger Commodity components high failure rates Outages are costly 300Khour 200 minutesoutage. Software-Defined Networks. Srinivas Narayana. Jennifer Rexford and David Walker. Princeton University. Where’s the packet loss?. A. B. Faulty network device(s) along the way. But where?. 2. 100 . pkts. DeHart. Computer Science & Engineering. Washington University. . www.arl.wustl.edu. GEC-10: . Slick Packets. Demonstration. Slick Packets. Source-Controlled Routing Architecture. Designed by Brighten Godfrey’s group at U. Illinois. for Strings and Sets. William Cohen. SELECT R.a,S.a,S.b,T.b FROM R,S,T . WHERE R.a=S.a and S.b=T.b. WHIRL approach:. Link items as. needed. by Q. WHIRL approach:. Query Q. SELECT R.a,S.a,S.b,T.b FROM R,S,T . The first hint Mr. Slippery had that his own True Name might be known--and, for that matter, known to the Great Enemy--came with the appearance of two black Lincolns humming up the long dirt driveway ... Roger Pollack was in his garden weeding, had been there nearly the whole morning.... Four heavy-set men and a hard-looking female piled out, started purposefully across his well-tended cabbage patch.…. Two Years in Mississippi. George . Kizer. , Alcatel-Lucent. NSMA Annual Conference. May 19 & 20, 2015. Holiday Inn Rosslyn at Key Bridge. Arlington, Virginia . Network Overview. . 142 Sites. 488 . Software-Defined Networks. Srinivas Narayana. Jennifer Rexford and David Walker. Princeton University. Where’s the packet loss?. A. B. Faulty network device(s) along the way. But where?. 2. 100 . pkts. Princeton University. Mina . Tahmasbi. Jen Rexford. David Walker. Srinivas Narayana. Management = Measure + Control. 2. Network Controller. Measure. Control. Software-Defined Networking (SDN). Enabling Easier Measurement Matters. , E. . Dall’Anese. ,. G. . Mateos . and G. B. . Giannakis. Acknowledgments. :. . NSF Grants 1343248, 1423316, 1442686, 1508993, 1509040. . ARO W911NF-15-1-0492. CIS 700/005 . –. Lecture 3. Includes material . from Brighten . Godfrey. Last Time. …. K-. ary. fat tree: three-layer topology (edge, aggregation and core). each pod consists of (k/2). 2. servers & 2 layers of k/2 k-port switches. Srinivas Narayana. May 13, 2016. Advisor: Prof. Jennifer Rexford. Management = Measure Control. 2. Network Controller. Measure. Control. Software-Defined Networking (SDN). Enabling Easier Measurement Matters. PhD thesis defense. Amit . Mondal. Committee. :. Aleksandar Kuzmanovic, . Asst. Professor, Northwestern . Univ. Peter . Dinda. , Assoc. . Professor, Northwestern . Univ. Yan Chen, . Assoc. Professor, Northwestern . Wenjun. Jiang, . Jie. Wu, Fellow, IEEE, Feng Li, Member, IEEE, . Guojun. Wang, Member, IEEE, and . Huanyang. . Zheng. Presenters: . Adeela. Huma, Lijing Wang, . Xuchao. Zhang. Introduction. source s is interested in a single target d . : . Presenter. : . Weicong. (Vivi) Ma . Boon . Thau. . Loo, Tyson . Condie. , Minos . Garofalakis. , David . E. . Gay, Joseph . M. . Hellerstein. , . Petros. . Maniatis. , Raghu . Ramakrishnan. Timothy . Sean Hefty. Problem. Problem. Address Resolution. ARP for address resolution. ARP storm as all nodes try to discover other nodes. Number of outstanding ARP requests = O(n. 2. ). May require pre-loading ARP cache before starting MPI job.

Download Document

Here is the link to download the presentation.
"Compiling Network Path Queries"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.

Related Documents