Tackling network heterogeneity head-on

Similar documents
Semantic Web Systems Introduction Jacques Fleuriot School of Informatics

Wither OWL in a knowledgegraphed, Linked-Data World?

Operational Semantics

TMQL issues. October 14, slide 1

Introduction. Who wants to study databases?

Introduction. Example Databases

Semantic Web Systems Web Services Part 2 Jacques Fleuriot School of Informatics

Orthogonal complements

WHAT NETWORK VIRTUALIZATION TECHNOLOGY CAN DO FOR YOUR NETWORK TODAY

CS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring Lecture 21: Network Protocols (and 2 Phase Commit)

Lesson 13: The Graph of a Linear Equation in Two Variables

DISCUSSION 5min 2/24/2009. DTD to relational schema. Inlining. Basic inlining

Lecture 1: Overview

CS411 Database Systems. 05: Relational Schema Design Ch , except and

Using the Semantic Web in Ubiquitous and Mobile Computing

Semantic Web: vision and reality

Knowledge representation Semantic networks and frames

Design Issues 1 / 36. Local versus Global Allocation. Choosing

The Bizarre Truth! Automating the Automation. Complicated & Confusing taxonomy of Model Based Testing approach A CONFORMIQ WHITEPAPER

DIONE. (DAML Integrated Ontology Evolution Tools) Ontology Versioning in Semantic Web Applications. ISX Corporation Lehigh University

Scaling Without Sharding. Baron Schwartz Percona Inc Surge 2010

Design Principles for End-to-End Multicore Schedulers

CS2112 Fall Assignment 4 Parsing and Fault Injection. Due: March 18, 2014 Overview draft due: March 14, 2014

CS 3640: Introduction to Networks and Their Applications

Science-as-a-Service

Context-aware Services for UMTS-Networks*

CS511 Design of Database Management Systems

H1 Spring B. Programmers need to learn the SOAP schema so as to offer and use Web services.

Quality of Service (QoS) Routing. A Quick Review of NP-Completeness

Week 4. COMP62342 Sean Bechhofer, Uli Sattler

It Is What It Does: The Pragmatics of Ontology for Knowledge Sharing

A Formal Approach for the Inference Plane Supporting Integrated Management Tasks in the Future Internet in ManFI Selected Management Topics Session

COMP4418 Knowledge Representation and Reasoning

UNIK Multiagent systems Lecture 3. Communication. Jonas Moen

Semantics Modeling and Representation. Wendy Hui Wang CS Department Stevens Institute of Technology

Computer Network Protocols: Myths, Missteps, and Mysteries. Dr. Radia Perlman, Intel Fellow

Web Services Annotation and Reasoning

Rack-scale Data Processing System

E-Commerce Website Project

SOA Distilled. Udi Dahan The Software Simplist..NET Development Expert & SOA Specialist Microsoft Solutions Architect MVP

Toward a Standard Rule Language for Semantic Integration of the DoD Enterprise

CS1102: What is a Programming Language?

POWERVR MBX. Technology Overview

KNOWLEDGE-BASED MULTIMEDIA ADAPTATION DECISION-TAKING

Agenda. Introduction. Semantic Web Architectural Overview Motivations / Goals Design Conclusion. Jaya Pradha Avvaru

Introduction to Data Management. Lecture #1 (Course Trailer ) Instructor: Chen Li

A few important patterns and their connections

Plan. A few important patterns and their connections. Singleton. Singleton: class diagram. Singleton Factory method Facade

Eleven+ Views of Semantic Search

Lecture 4: examples of topological spaces, coarser and finer topologies, bases and closed sets

Where is the Semantics on the Semantic Web?

OWL as a Target for Information Extraction Systems

USING DECISION MODELS METAMODEL FOR INFORMATION RETRIEVAL SABINA CRISTIANA MIHALACHE *

Please view notes for further information on later slides

An Efficient Semantic Web Through Semantic Mapping

Reducing Consumer Uncertainty

CSE 461: Computer Networks John Zahorjan Justin Chan Rajalakshmi Nandkumar CJ Park

Efficient, Scalable, and Provenance-Aware Management of Linked Data

Static Program Analysis

XML technology is very powerful, but also very limited. The more you are aware of the power, the keener your interest in reducing the limitations.

l A family of logic based KR formalisms l Distinguished by: l Decidable fragments of FOL l Closely related to Propositional Modal & Dynamic Logics

SOFTWARE ENGINEERING DESIGN I

DAML Ontologies for Agent-Enabled Web Services

(Refer Slide Time: 4:00)

Lecture 20 : Trees DRAFT

IETF YANG models for VLAN interface classification. draft-wilton-netmod-intf-vlan-yang Robert Wilton (Cisco)

The Agentcities Network Architecture

Enterprise Web based Software Architecture & Design

Exercises: Instructions and Advice

Programming Language Concepts, cs2104 Lecture 01 ( )

Introduction to Data Management. Lecture #1 (Course Trailer )

Notebook Assignments

Parley: Federated Virtual Machines

This is already grossly inconvenient in present formalisms. Why do we want to make this convenient? GENERAL GOALS

Reducing Consumer Uncertainty Towards a Vocabulary for User-centric Geospatial Metadata

Deep Integration of Scripting Languages and Semantic Web Technologies

Advanced Computer Networks. End Host Optimization

A REVIEW OF BASIC KNOWLEDGE OF DATABASE SYSTEM

CPS 214: Computer Networks. Slides by Adolfo Rodriguez

Static Program Analysis

Introduction to Data Management. Lecture #1 (Course Trailer )

Semantic Web Knowledge Representation in the Web Context. CS 431 March 24, 2008 Carl Lagoze Cornell University

Lightweight Semantic Web Motivated Reasoning in Prolog

Assignment 5. Georgia Koloniari

Priority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies

The Proposition. Roger Bishop Jones. Abstract. A place to play formally with the concept of proposition. Created 2009/11/22

CSCI Computer Networks

Advancing RDMA. A proposal for RDMA on Enhanced Ethernet. Paul Grun SystemFabricWorks

Linguistics and Philosophy 23: , Is Compositionality Formally Vacuous? Francis Jeffry Pelletier

Advanced Topics in the Semantic Web: Semantic Services for Business Process Management

Hello, I am from the State University of Library Studies and Information Technologies, Bulgaria

Principles of Programming Languages

1. I NEED TO HAVE MULTIPLE VERSIONS OF VISUAL STUDIO INSTALLED IF I M MAINTAINING APPLICATIONS THAT RUN ON MORE THAN ONE VERSION OF THE.

0.1 Upper ontologies and ontology matching

Scalability, Performance & Caching

As a programmer, you know how easy it can be to get lost in the details

C 1. Recap. CSE 486/586 Distributed Systems Distributed File Systems. Traditional Distributed File Systems. Local File Systems.

Understanding and Improving the Cost of Scaling Distributed Event Processing

CS221: Algorithms and Data Structures. Asymptotic Analysis. Alan J. Hu (Borrowing slides from Steve Wolfman)

CITS5501 Software Testing and Quality Assurance Formal methods

Transcription:

Tackling network heterogeneity head-on Timothy Roscoe Networks and Operating Systems Group ETH Zürich ETH Zürich

Scene setting Different dimension of MAD networks: Independent evolution Arbitrary policies Centralized standards Tension between heterogeneity and interoperability Not addressing: Cooperative / selfish behavior (but ) Security (but see later) Politics (beer conversation!) 2

Disclaimer I am going to talk about things I know nothing about! I am not going to present any results, or, indeed, work! I make no claims for originality here. I am not convinced this is a good idea (but I think it is!) Instead, I am talking an idea for walk Trying something out and looking for feedback 3

Specific problem: resource heterogeneity in federated networked systems Scenario: GENI-like infrastructure (Combined utility computing and networking) Resource providers: - Links - Processing - Storage - Etc. Resource consumers: - Overlays - Applications 4

Specific problem: resource heterogeneity in federated networked systems How do domains and principals express: What resources they have to offer? What their resource requirements are? Commitments to provide resources? Old, hard problem: Information is incomplete and may be restricted Requirements are complex and span domains Resources are heterogeneous and evolve over time 5

Specific example: current GENI design Current designs use an rspec for all three purposes XML document giving resource values Wildcards are used for resource requests/offers Inherited from PlanetLab and Emulab Challenges: Anticipating all hardware types & configurations Expressing complex requirements as wildcards Interpreting a hierarchical description of nonhierarchical concepts 6

Observation Much of the systems community fixated with static (even though extensible) formats: IDLs, type systems, fixed schemas, etc. Separation between: Schema / type defn (out of band, agreed in advance) Concrete, semantics-free atomic values (in the msg) Result: Clumsy specification of complex requests or offers 7

What should an advertisement look like? The kinds (classes) of object available E.g. share of link, wavelength, NIC bandwidth, CPU share List of objects available (instances) Node with 4 processors 50 CHF for 1 hour of a full CPU 2 NICs, on the following links respectively Constraints on allocation NIC bandwidth and buffer memory must be allocated together No share less than 5% Tradeoff between throughput and latency By default you re not worthy of more than best effort 8

Exercise for the audience Do the same for: Resource requests / requirements Commitments for resources For extra credit: Convince me that the right XML schema will surely solve all these problems 9

Open vs. closed specifications Networking formats are closed Expressing a new construct in the format requires new syntax or abuse of existing concepts Example: BGP attributes Languages are open (to varying degrees) Languages are generative of a range of descriptions - Sometimes called constructors Extensions can often be expressed in the language itself 10

Why have networks always avoided languages? Historical reasons: It was too complex at the time! (the 70s) I needed something to work quickly! Prejudice: What do these theoreticians know about networking? Fear: I don t want to learn Prolog! - (or KL-ONE or FOL or PLANNER or BINDER or ) Practical considerations My graduate students aren t logicians! 11

Back to the future: ANSAware (c.1988) Early DPE explicitly addressing federation ANSA Trading model specified: Services described as arbitrary name/value pairs Requests expressed in a constraint language Rich resource advertisement/negotiations Across administrative boundaries In the presence of incompose knowledge Mostly lost with SLP, WSDL, etc. 12

Various approaches (1) Databases and query languages + Very fast evaluation + Ready infrastructure - No truth theory - Not very expressive or generative Logic programming + easy to distribute +/- very expressive +/- lots of hacks to go fast (& many implementations) 13

Various approaches (2) Constraint programming + good match to problem space - doesn t capture descriptive richness - very computationally intensive? Parallelizable? Description logics + highly predictable framework (proven results!) + controllable tractability (but still complex!) + work well with the web - tools are complex (or are they?) 14

The good news: Description Logics is a whole theory of such languages View resource allocation as theorem proving? Solid theoretical foundation Evaluation tractability vs. Expressivity Fundamental theoretical basis Efficient (well ) algorithms for evaluation E.g. Tableaux algorithms Unification of logic programming, databases, knowledge representation 15

Others are moving in this direction Web services: RDF -> OWL (inc. OWL-DL) Cognitive Networks DARPA project use of DLs Security: Authorization logics + theorem proving Information planes Sophia: network as logic soup Declarative networking Integrates naturally with resource mgmt Recent work on integrating access control languages 16

Concerns 1: Why bother? Getting distracted by ontologies! I m NOT going to mention the S****t*c W*b. Metaphysics is a rathole I m a poststructuralist Isn t this overengineering? Claim: we ve reached the end of the road with tuples. We are researchers: better to overshoot than undershoot Problems with GENI and other systems are clear 17

Concerns 2: Avoiding intractability Restrict expressibility of language Description logics: explicit tradeoff! Add procedural hints to guide evaluation E.g cuts, evaluation order in Prolog Restrict evaluation semantics C.f. databases We re systems people! Fail and handle at a higher level Hybrid systems: wire-in domain knowledge 18

Systems characteristics of the problem Datasets are small Compare with database defns. of large Resource descriptions are rich, but not arbitrary What language features are needed? Need to avoid DoS through complex expressions See previous slide The problem is distributed Need for distributed evaluation strategies Possibly crossing administrative domains 19

Building a better white elephant? Resource frameworks have been built too many times before This time: concrete scenario GENI resource federation Real implementation opportunity Real code, real users Applicable to other utility computing areas 20

(In)conclusion : I d like to at least try: Using a richer logic to express resource: Offers / Advertisements Requests / Requirements Commitments / Allocations Using DLs in anger to implement it all Sound theoretical basis and framework Subsequently wrecked by systems techniques Investigating resource allocation as distributed theorem proving And the restrictions needed to make this work, 21

Thanks! Acknowledgements: Katerina Argyraki (EPFL) Mic Bowman (Intel) Bryan Lyles (Telcordia) Petros Maniatis (Intel) John Wroclawski (ISI) 22