PPT-Compiling Path Queries in
Author : danika-pritchard | Published Date : 2017-04-01
SoftwareDefined Networks Srinivas Narayana Jennifer Rexford and David Walker Princeton University Wheres the packet loss A B Faulty network devices along the way
Presentation Embed Code
Download Presentation
Download Presentation The PPT/PDF document "Compiling Path Queries in" 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 Path Queries in: Transcript
SoftwareDefined Networks Srinivas Narayana Jennifer Rexford and David Walker Princeton University Wheres the packet loss A B Faulty network devices along the way But where 2 100 pkts. joint work with Dan . Suciu. (University of Washington). Alexandra Meliou. Hypothetical (What-if. ). Queries. Brokerage company. DB. Key Performance Indicators (KPI). Example from [. Balmin. et al. VLDB’00]:. 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. Johannes . Gehrke. Department . of Computer Science, Cornell University . With . Gabriel Bender, Nitin Gupta, Lucja Kot, Sudip Roy (. Cornell) and . Milos Nikolic, Christoph Koch (EPFL) . Introduction to Entangled Queries . 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.…. 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. Josh Adams. Senior Console Programmer. Epic Games. josh.adams@epicgames.com. Topics. Background. Method of Attack. Bringup. What we kept. Changes we made. Workflow Changes. Where To Go From Here. Topics. 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. Srinivas Narayana. Princeton University. Network Management is Complex. Computer networks getting bigger. Commodity components: high failure rates. Outages are costly!. ~ $300K/hour, 200 minutes/outage. . over. . Incomplete. Databases. Werner . Nutt. j. oint. . work. . with. Marco . Montali. , Sergey . Paramonov. , Simon . Razniewski. , . Ognjen. . Savkovic. , . Alex . Tomasi. , . Fariz. . Darari. Visual Queries Dr. Neil H. Schwartz Visualization: Defined Visualization refer to the 2D and 3D static and animated visual displays that depict conditions, situations, processes, places or events as they appear in maps, diagrams, graphs, pictures, schematics, data-based spatial or linear renditions, and immersive virtual environments 0 1000 1500 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 10% Failed Nodes30% Failed Nodes Fig.6.DNSpathlengthincrease 1000 1500 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 Path Length Increase (%)CDF 10% Failed Nodes Fig.7.Ch Pankaj. . Vanwari. . Under guidance of . Dr. S. . Sudarshan. . Overview of Presentation. Introduction to Entity Queries. Keyword search on structured data. Querying over unstructured data. Entity queries using ontology based extraction. 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 Path Queries in"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