Examples of Research Patterns

Slides:



Advertisements
Similar presentations
Generating Ideas #1: Research Patterns
Advertisements

Applications of one-class classification
Networking Research Nick Feamster CS Nick Feamster Ph.D. from MIT, Post-doc at Princeton this fall Arriving January 2006 –Here off-and-on until.
Research Summary Nick Feamster. The Big Picture Improving Internet availability by making networks easier to operate Three approaches –From the ground.
My Experience Writing an NSF NeTS FIND Proposal Nick Feamster Georgia Tech.
Multihoming and Multi-path Routing
Nick Feamster Research: Network security and operations –Helping network operators run the network better –Helping users help themselves Lab meetings:
Nick Feamster Research: Network security and operations Teaching CS 7260 in Spring 2007 CS 7001 Mini-projects: –
Research Patterns Nick Feamster and Alex Gray CS 7001 September 26, 2007.
IEEE CCW 08 New Network Architectures: Why Bother? Paul Francis Cornell.
An Overview Of Virtual Machine Architectures Ross Rosemark.
Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond.
Decoding of Convolutional Codes  Let C m be the set of allowable code sequences of length m.  Not all sequences in {0,1}m are allowable code sequences!
Logically Centralized Control Class 2. Types of Networks ISP Networks – Entity only owns the switches – Throughput: 100GB-10TB – Heterogeneous devices:
Algorithm and Complexity Analysis
1 Scalability is King. 2 Internet: Scalability Rules Scalability is : a critical factor in every decision Ease of deployment and interconnection The intelligence.
Dynamic Routing Scalable Infrastructure Workshop, AfNOG2008.
Geometry of large networks (computer science perspective) Dmitri Krioukov (CAIDA/UCSD) AIM, November 2011.
Automated Analysis and Code Generation for Domain-Specific Models George Edwards Center for Systems and Software Engineering University of Southern California.
Andrew Stone -- Colorado State University Slide 1 Andrew Stone, Michelle Strout, Steven DiBenedetto, and Daniel Massey December 5, 2009 FRACTAL Workshop.
CSCD 433/533 Advanced Computer Networks Lecture 1 Course Overview Fall 2011.
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
1 GENI: Global Environment for Network Innovations Jennifer Rexford On behalf of Allison Mankin (NSF)
On the Death of BGP MSN July 8, 2004 Timothy G. Griffin Intel Research, Cambridge UK
Quantum Technology Essential Question:
Routing and Routing Protocols
Spring Routing & Switching Umar Kalim Dept. of Communication Systems Engineering 06/04/2007.
Routing Protocol Pertemuan 21 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
A victim-centric peer-assisted framework for monitoring and troubleshooting routing problems.
SM3121 Software Technology Mark Green School of Creative Media.
Relating Two Formal Models of Path-Vector Routing March 15, 2005: IEEE INFOCOM, Miami, Florida Aaron D. Jaggard Tulane University Vijay.
Draft-li-rtgwg-cc-igp-arch-00IETF 88 RTGWG1 An Architecture of Central Controlled Interior Gateway Protocol (IGP) draft-li-rtgwg-cc-igp-arch-00 Zhenbin.
TICTOC -Topology-Discovery and Clock-Discovery TICTOC BOF IETF70 Stewart Bryant
報告日期 :2012/03/07 指導教授 : 蔡亮宙 報 告 者 : 吳烱華 自製率 :100%.
Towards a Logic for Wide- Area Internet Routing Nick Feamster Hari Balakrishnan.
Introduction to Routing and Routing Protocols By Ashar Anwar.
Part 2  Access Control 1 CAPTCHA Part 2  Access Control 2 Turing Test Proposed by Alan Turing in 1950 Human asks questions to another human and a computer,
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
L13. Shortest path routing D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2014.
9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
1.1 What is the Internet What is the Internet? The Internet is a shared media (coaxial cable, copper wire, fiber optics, and radio spectrum) communication.
Artificial Neural Nets and AI Connectionism Sub symbolic reasoning.
1. 2 Anatomy of an IP Packet IP packets consist of the data from upper layers plus an IP header. The IP header consists of the following:
Lecture on Computer Science as a Discipline. 2 Computer “Science” some people argue that computer science is not a science in the same sense that biology.
Responding to the Unexpected Yigal Arens Paul Rosenbloom Information Sciences Institute University of Southern California.
Visualizing QoS. Background(1/2) A tremendous growth in the development and deployment of networked applications such as video streaming, IP telephony,
Current state of affairs No framework for theoretical analysis of (some) protocols –chaos small changes make a lot of difference difficult to tune - or.
Concerns with Network Research Funding S.Floyd & R. Atkinson, Editors Internet Architecture Board draft-iab-research-funding-02.txt.
1 7-Jan-16 S Ward Abingdon and Witney College Dynamic Routing CCNA Exploration Semester 2 Chapter 3.
Metarouting and Network Optimization CISS 2006 (work in progress)
Computer Networks 0110-IP Gergely Windisch
CSCD 433/533 Advanced Computer Networks Lecture 1 Course Overview Spring 2016.
Prof. Alfred J Bird, Ph.D., NBCT Office – Science 3rd floor – S Office Hours – Monday and Thursday.
A Classification for Access Control List To Speed Up Packet-Filtering Firewall CHEN FAN, LONG TAN, RAWAD FELIMBAN and ABDELSHAKOUR ABUZNEID Department.
Prof. Alfred J Bird, Ph.D., NBCT Office – McCormick 3rd floor 607 Office Hours – Monday 3:00 to 4:00 and.
DOWeR Detecting Outliers in Web Service Requests Master’s Presentation of Christian Blass.
Sub-fields of computer science. Sub-fields of computer science.
LESSON Networking Fundamentals Understand IPv4.
SDN Network Updates Minimum updates within a single switch
Eick: Introduction Machine Learning
Routing: Distance Vector Algorithm
A Novel Framework for Software Defined Wireless Body Area Network
Software Defined Networking (SDN)
Link State on Data Center Fabrics
Introduction Artificial Intelligent.
Metarouting (SIGCOMM 2005) T. G. Griffin and J. L. Sobrinho
Automated Analysis and Code Generation for Domain-Specific Models
Christoph F. Eick: A Gentle Introduction to Machine Learning
Chapter 2 from ``Introduction to Parallel Computing'',
Presentation transcript:

Examples of Research Patterns Nick Feamster and Alex Gray CS 7001

General Approach Find a problem Understand a problem Solve a problem Review solution

Finding Problems

Finding Problems Hop on a trend Find a nail that fits your hammer Revisit old problems (with new perspective) Making life easier Pain points Wish lists “*-ations” Generalization Specialization Automation

Hop on a Trend Need places to discover trends Funding agencies Funded proposals Calls for proposals Conference calls for papers Industry/technology trends: trade rags

Funding Agencies Example call for proposals: CISE Cross- Cutting Proposal http://www.nsf.gov/pubs/2009/nsf09558/nsf0 9558.htm

Call for Papers Examples: Workshop Call for Papers

Example: Trade Rag http://www.renesys.com/blog/2009/06/iran-and-the-internet-uneasy-s.shtml

Finding a Nail for Your Hammer Become an expert at something You’ll become valuable to a lot of people Develop a system that sets you ahead of the pack Apply your “secret weapon” to one or more problem areas Algorithm System Expertise “Turn the crank”

Example Hammer: Generalized n-body Problem NIPS 2000 paper: “N-body Problems in Statistical Learning” – identifies a common type of computational bottleneck appearing in ML: problems involving pairwise distances between points Hammer: Generalized N-body algorithm New nails, 2009: Hartree-Fock quantum simulation (distances between all quadruples)

Revisiting Problems Previous solutions may have assumed certain problem constraints What has changed since the problem was “solved”? Processing power Cost of memory New protocols New applications …

Example: New Protocols Refactoring of networking devices: the separation of “control” from the box that forwards packets Examples of this refactoring: Routing Control Platform(implemented in AT&T) OpenFlow (deployed by 8 switch vendors) How does refactoring the device make solving old problems easier?

Pain Points Look to industry, other researchers, etc. for problems that recur In programming, if you have to do something more than a few times, script! In research, if the same problem is recurring and solved the same silly way, there may be a better way…

New Assumptions Reducing the gap between theory and practice Well-known textbook theoretical result: 'Distribution-free' density estimation requires a number of samples which is exponential in the dimension – 1970's In fact, such methods somehow do work in high dimensions NIPS 2009: Actually, real high-dimensional data can be assumed to live on a manifold – then the complexity depends on this much lower dimension

Example Pain Point

Wish Lists What systems do you wish you had that would make your life easier? Less spam? Faster file transfer, automatic file sync? … What questions would you like to know the answer to? Chances are there is data out there to help you find the answer…

Example Wish List

Generalize From Specific Problems Previous work may outline many points in the design space There may be a general algorithm, system, framework, etc., that solves a large class of problems instead of going after “point solutions”

Examples: In-Class Exercise

Specialize a General Problem Finding general problems Look for general “problem areas” Look for taxonomies and surveys that lay out a problem space Applying constraints to the problem in different ways may yield a new class of problems Example: Routing (in wireless, sensor networks, wired, delay-tolerant networks, etc.)

Specialization: In-Class

Automation Some existing problems, tasks, etc. are manual and painful Automation could make a huge difference It’s also often very difficult because it requires complex reasoning Related to pain points

AutoBayes Deriving an optimizer for a new statistical model is hard, error-prone, and time- consuming... but ultimately mechanical, given certain encoded knowledge AutoBayes (NIPS 2002): Given a high- level spec for a statistical model, automatically derives the EM (expectation- maximization) algorithm for it and generates the code

Understanding Problems

Formalization Define metrics Consider ways to measure the quality of various solutions What constitutes a “good solution” Objective functions can be optimized Formalization/modeling can lead to simplifying assumptions (hopefully not over-simplifying) Can also suggest ways to attack the problem …or an algorithm itself

Today …. Small number of routing protocols Design, implementation, deployment, standardization  long, slow process BGP is being pressed into service as an IGP No convergence guarantees BGP Wedgies (RFC 4264) Endless stream of BGP extensions Cost Communities

… Tomorrow Distinction between router configuration and protocol definition will vanish Network Operators will define their own routing protocols operator community will define standards when needed Vendors will no longer implement routing protocols, but rather a standardized metalanguage for their specification. Routing metalanguage and associated components are standardized in the IETF.

Metarouting (Griffin & Sobrinho, SIGCOMM 2005) Routing Algebras (Sobrinho 2003) Expressive framework Specific algebraic properties required for correctness of each algorithm (Path-Vector, Link-State+Dijkstra) A meta-language for Routing Algebras Base algebras Constructors Property Preservation Rules Properties of base algebras known, Preservation rules for each constructor Properties are derived much as types in a programming language Metalanguage can be implemented on a router Protocols defined via configuration

Routing Algebras m m + n n “Network Routing with Path Vector Protocols: Theory and Applications” João Sobrinho. SIGCOMM 2003 m m + n n Generalize Shortest Paths

Routing Algebras An ordered set of signatures is a set of policy labels Is policy application function

Important Properties Isotonicity Monotonicity (M) Strict monotonicity (SM) Isotonicity (I) Strict isotonicity (SI)

Decomposition Given a model, it often becomes easier to break a solution into smaller parts Solve (or at least understand) each piece individually and how they interact Even if you cannot solve the whole problem in toto, you can make progress

Examples of Decomposition Artificial Intelligence Vision Planning Machine Learning ... Network Architecture Security Management Availability Troubleshooting