Towards PubSub and Storage integration in ANIMA

Slides:



Advertisements
Similar presentations
Universidade do Minho A Framework for Multi-Class Based Multicast Routing TNC 2002 Maria João Nicolau, António Costa, Alexandre Santos {joao, costa,
Advertisements

Impala: A Middleware System for Managing Autonomic, Parallel Sensor Systems Ting Liu and Margaret Martonosi Princeton University.
Dynamic Routing Scalable Infrastructure Workshop, AfNOG2008.
1 LINK STATE PROTOCOLS (contents) Disadvantages of the distance vector protocols Link state protocols Why is a link state protocol better?
5/31/05CS118/Spring051 twisted pair hub 10BaseT, 100BaseT, hub r T= Twisted pair (copper wire) r Nodes connected to a hub, 100m max distance r Hub: physical.
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
1 The Cryptographic Token Key Initialization Protocol (CT-KIP) Web Service Description KEYPROV WG IETF-68 Prague March 2007 Andrea Doherty.
Network Kernel Architectures and Implementation ( ) Naming and Addressing Chaiporn Jaikaeo Department of Computer Engineering.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing
TRansparent Interconnection of Lots of Links (TRILL) March 11 th 2010 David Bond University of New Hampshire: InterOperability.
Common Devices Used In Computer Networks
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
March 12, 2008© Copyright 2008 John Buford SAM Overlay Protocol draft-buford-irtf-sam-overlay-protocol-01.txt John Buford, Avaya Labs Research IETF 71.
1 Brian Carpenter (editor) Bing Liu (editor) Michael Richardson Tom Taylor Laurent Ciavaglia Michael Behringer Jéferson Campos Nobre IETF 93 July 2015.
The Network Layer.
1 Mobility Support by the Common API for Transparent Hybrid Multicast draft-irtf-samrg-common-api-03 Project Matthias Wählisch,
Information-Centric Networks10b-1 Week 10 / Paper 2 Hermes: a distributed event-based middleware architecture –P.R. Pietzuch, J.M. Bacon –ICDCS 2002 Workshops.
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
Peer to Peer Network Design Discovery and Routing algorithms
Multicast Communications
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
1 Brian Carpenter (editor) Bing Liu (editor) Carsten Bormann IETF 95 April 2016 GeneRic Autonomic Signaling Protocol draft-ietf-anima-grasp-04.
Why Is It All?  A Network is a set of connected devices. Whenever we have multiple devices, we have the problem of how to connect them to make one-to-one.
1 Group Communications: Host Group and IGMP Dr. Rocky K. C. Chang 19 March, 2002.
Bing Liu (speaker), Sheng WG, ietf96, July 2016
Protocols and layering Network protocols and software Layered protocol suites The OSI 7 layer model Common network design issues and solutions.
William Stallings Data and Computer Communications
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
BGP-Based SPF IETF 97, Seoul
BGP-Based SPF RTGWG - Jan 2017
Bing Liu (speaker), Sheng WG, ietf97, November 2016
Selecting Unicast or Multicast Mode
draft-liu-pim-single-stream-multicast-frr-01
Synchronisation of Network Parameters draft-bryant-rtgwg-param-sync-00
Autonomic Prefix Management in Large-scale Networks
Introduction to Wireless Sensor Networks
(How the routers’ tables are filled in)
What Are Routers? Routers are an intermediate system at the network layer that is used to connect networks together based on a common network layer protocol.
Les Ginsberg Stefano Previdi Peter Psenak Martin Pilka
FAR: A Fault-avoidance Routing Method for Data Center Networks with Regular Topology Please send.
Sensor Network Routing
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
THE NETWORK LAYER.
CS 4700 / CS 5700 Network Fundamentals
Routing in Packet Networks Shortest Path Routing
Software Defined Networking (SDN)
Sheng Jiang, Artur Hecker, Zoran Despotovic
CS 4700 / CS 5700 Network Fundamentals
CS 3700 Networks and Distributed Systems
ECE 544 Protocol Design Project: Description and Timeline
Tuesday , 9:30-12:00 Morning session I, Buckingham
CS 4700 / CS 5700 Network Fundamentals
Carlos J. Bernardos, Alain Mourad, Akbar Rahman
PRESENTATION COMPUTER NETWORKS
Switching Techniques.
By co-authors Sheng Jiang & Toerless Eckert
CS 3700 Networks and Distributed Systems
Distributed Systems CS
Data-Centric Networking
Wireless Sensor Networks and Internet of Things
EE 122: Lecture 22 (Overlay Networks)
DSDV Destination-Sequenced Distance-Vector Routing Protocol
Bing Liu, Yuefeng Wu IETF July 2017
10th International Conference on Telecommunication, ICT’2003,
Computer Networks Protocols
Bing Liu, Xun Xiao, Sheng Jiang, Artur Hecker
Tuesday (July 23rd, 2019) Two sessions ( minutes)
ANIMA recharter IETF 103 Bangkok
Bing Liu (Ed. Presenter), Xun Xiao (Ed
Presentation transcript:

Towards PubSub and Storage integration in ANIMA ANIMA WG, IETF 99, Prague Xun Xiao, Zoran Despotovic, Ramin Khalili, Artur Hecker

Information Distribution in ANIMA draft-ietf-anima-reference-model-04 §4.7, p12: Defines Information Distribution as unchartered item, function of ACP Defines flooding as the implementation choice Does not describe details of the implementation §7.3, p18: Aggregated reporting draft-liu-anima-grasp-distribution-04 An implementation candidate using GRASP for information distribution: GRASP Flooding for the whole domain GRASP synchronization for the peer-to-peer distribution Selective Flooding: containing criteria with flooding messages Conflict Handling: with timestamps or version info. Three scenarios: Whole domain, selective domain, and incremental for newly joining node 7/19/2017 IETF99 PubSub and Storage in ANIMA

The “why’s” Use cases for non-time critical info distribution Configuration Autonomic does not preclude management, see current ref. model (and RFC7575) Intents (by definition, require distribution to the whole AD) Some intents might “trigger” later: need to store the rule & objects (for special ASAs) “Switch off the AC, once the temperature reaches 23°C” (For ACP) Aggregated reporting, information distribution Autonomic applications != no central/unique points Require consensus, collaboration, negotiation, agreement on values, actions Autonomic computing: avoid repetitive development Developers / apps would highly profit from a ANIMA-provided means for: Scalable and efficient message distribution (e.g. only to some ASA types) Universal storage means 7/19/2017 IETF99 PubSub and Storage in ANIMA

Flooding vs. distribution Flooding seems to be understood as “distribution to all recipients” Note that typical definition of flooding is different E.g. Wikipedia: "Flooding is a simple computer network routing algorithm, in which every incoming packet is sent through every outgoing link except the one it arrived on“ Flooding as implementation (= “unconstrained broadcast”) Simple and working solution, iff The network is small in scale The network is sparse The network is a tree / guaranteed loop free / does not have multiple paths Note: ANIMA ACP does not fulfill any of these Uses routing, does not constrain scale, does not constrain connectedness, etc. In other networks, flooding exhibits an explosive growth and does not scale There are better implementations than the latter achieving the first vs. 7/19/2017 IETF99 PubSub and Storage in ANIMA

PubSub and Storage in ANIMA An accepted popular model for async communications Decouples pools of subscribers and publishers Publishers do not need to know about subscribers and vs. Provides more flexibility in distribution/interest sets and much higher system scalability Usually implemented as a middleware, can be distributed or centralized OMG DDS, MMQT, XMMP, PubSub In principle, nothing else but application-layer multicast Suits nicely the autonomic paradigm Can achieve more precise distribution than flooding (Usually) Requires storage in its implementation To hold the so-called “backlog” (error handling, etc) 7/19/2017 IETF99 PubSub and Storage in ANIMA

PubSub and Storage in ANIMA Closed loop support for storage can be added With general calls (e.g. put() and get()) All nodes start from the same state, run a procedure and end up with network-wide storage Does not mean that all nodes have to support storage (not a MUST) Instead, the local API call would hide the complexity of how it is implemented Proposal: the node whose API is invoked MUST do one of the following: It MAY store the data object locally at the AN It MAY use GRASP to find storage-capable nodes It MAY use the distributed storage to locate the URL of the node that stores It MAY use an algorithmic means to map the data object to a suitable AN It MAY report an error (“storage not available”), e.g. during network convergence or while no storage nodes are available. 7/19/2017 IETF99 PubSub and Storage in ANIMA

Integration in ANIMA: Possible solutions Dedicated ASA Define an (Optional? Mandatory?) ASA to implement and support storage Advantage: probably easier as less standard-costly Problem: likely less interoperable Integration in ANI Storage and PubSub as part of ACP functionality Advantage: understands storage as a fundamental support for autonomic apps (just like routing) PubSub can be easily implemented on top of storage Disadvantage: probably needs rechartering, protocol extensions, additional protocols, etc. 7/19/2017 IETF99 PubSub and Storage in ANIMA

PubSub and Storage in ANIMA Who needs which API (Non time critical use cases) PubSub Storage Configuration X Intent distribution Internal ANIMA implementation Autonomic computing 7/19/2017 IETF99 PubSub and Storage in ANIMA