A Signal Processing Approach to the Analysis of Chemical Networking Protocols

Similar documents
Modeling and Simulation NETW 707

Contents. 1 State-Space Linear Systems 5. 2 Linearization Causality, Time Invariance, and Linearity 31

Robustness of stochastic discrete-time switched linear systems

Part 2: Random Routing and Load Balancing

Switched Systems: Mixing Logic with Differential Equations

Congestion Control. Topics

Performance Evaluation of Queuing Systems

Lecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking

Controlo Switched Systems: Mixing Logic with Differential Equations. João P. Hespanha. University of California at Santa Barbara.

Min Congestion Control for High- Speed Heterogeneous Networks. JetMax: Scalable Max-Min

Information and Entropy

Stochastic Hybrid Systems: Applications to Communication Networks

THE Internet is increasingly being used in the conduct of

First Order System Types

A Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks

Cybergenetics: Control theory for living cells

Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe

Hybrid Control and Switched Systems. Lecture #1 Hybrid systems are everywhere: Examples

TCP over Cognitive Radio Channels

A Mathematical Model of the Skype VoIP Congestion Control Algorithm

Stochastic Hybrid Systems: Modeling, analysis, and applications to networks and biology

Wireless Internet Exercises

CDS 270-2: Lecture 6-1 Towards a Packet-based Control Theory

Dynamic Atomic Congestion Games with Seasonal Flows

These are special traffic patterns that create more stress on a switch

Convolutional Codes. Telecommunications Laboratory. Alex Balatsoukas-Stimming. Technical University of Crete. November 6th, 2008

Operational Laws Raj Jain

Networked Control System Protocols Modeling & Analysis using Stochastic Impulsive Systems

A model-based approach to control over packet-switching networks, with application to Industrial Ethernet

Markov Chain Model for ALOHA protocol

Approximate Queueing Model for Multi-rate Multi-user MIMO systems.

Design of IP networks with Quality of Service

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "

Towards a Theory of Information Flow in the Finitary Process Soup

Lecture 11 FIR Filters

Multiaccess Communication

Singular perturbation analysis of an additive increase multiplicative decrease control algorithm under time-varying buffering delays.

Basic modeling approaches for biological systems. Mahesh Bule

Methodology for Computer Science Research Lecture 4: Mathematical Modeling

Multiaccess Problem. How to let distributed users (efficiently) share a single broadcast channel? How to form a queue for distributed users?

Networked Control Systems:

Communication constraints and latency in Networked Control Systems

Analytic Performance Evaluation of the RED Algorithm

P e = 0.1. P e = 0.01

Queueing Theory and Simulation. Introduction

384Y Project June 5, Stability of Congestion Control Algorithms Using Control Theory with an application to XCP

Analysis of the Increase and Decrease. Congestion Avoidance in Computer Networks

Electrical Engineering Written PhD Qualifier Exam Spring 2014

Random Access Protocols ALOHA

Adaptive Reverse Link Rate Control Scheme for cdma2000 1xEV-DO Systems

Application of Optimization Methods and Edge AI

Reliable Data Transport: Sliding Windows

Introduction to queuing theory

Networking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)

Anytime Capacity of the AWGN+Erasure Channel with Feedback. Qing Xu. B.S. (Beijing University) 1997 M.S. (University of California at Berkeley) 2000

Feedback Control CONTROL THEORY FUNDAMENTALS. Feedback Control: A History. Feedback Control: A History (contd.) Anuradha Annaswamy

Linear System. Lotfi A. Zadeh & Charles A. Desoer. The State Space Approach

The objective of this LabVIEW Mini Project was to understand the following concepts:

A novel algorithm for dynamic admission control of elastic flows

Trust Degree Based Beamforming for Multi-Antenna Cooperative Communication Systems

Chapter 5. Elementary Performance Analysis

6 Solving Queueing Models

Chapter 2 Queueing Theory and Simulation

TOWARDS BETTER MULTI-CLASS PARAMETRIC-DECOMPOSITION APPROXIMATIONS FOR OPEN QUEUEING NETWORKS

A general algorithm to compute the steady-state solution of product-form cooperating Markov chains

Ateneo de Manila, Philippines

A Quantitative View: Delay, Throughput, Loss

TSCCLOCK: A LOW COST, ROBUST, ACCURATE SOFTWARE CLOCK FOR NETWORKED COMPUTERS

Networked Control Systems

Giuseppe Bianchi, Ilenia Tinnirello

Stochastic Partial Differential Equations with Levy Noise

Dynamic Systems. Simulation of. with MATLAB and Simulink. Harold Klee. Randal Allen SECOND EDITION. CRC Press. Taylor & Francis Group

Robust Control of Heterogeneous Networks (e.g. congestion control for the Internet)

The Bio-chemical Information Processing Metaphor as a Programming Paradigm for Organic Computing (CHEMORG III)

Probability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models

A Retrial Queueing model with FDL at OBS core node

Lecture on Sensor Networks

Online Companion for. Decentralized Adaptive Flow Control of High Speed Connectionless Data Networks

Note special lecture series by Emmanuel Candes on compressed sensing Monday and Tuesday 4-5 PM (room information on rpinfo)

Generating Random Variates II and Examples

Data analysis and stochastic modeling

Laplace Transforms Chapter 3

Communications and Signal Processing Spring 2017 MSE Exam

Coding on a Trellis: Convolutional Codes

The Age of Information in Networks: Moments, Distributions, and Sampling

FDST Markov Chain Models

requests/sec. The total channel load is requests/sec. Using slot as the time unit, the total channel load is 50 ( ) = 1

Processor Sharing Flows in the Internet

Capacity Region of the Permutation Channel

communication networks

Stability Analysis in a Cognitive Radio System with Cooperative Beamforming

A Simple Model for the Window Size Evolution of TCP Coupled with MAC and PHY Layers

PIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control

NICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

Control Systems, Lecture 05

Signal Structure for a Class of Nonlinear Dynamic Systems

CSE 123: Computer Networks

Markovian Decision Process (MDP): theory and applications to wireless networks

Transcription:

Laurea Specialistica 19 July 2010 A Signal Processing Approach to the Analysis of Chemical Networking Protocols Author Supervisors Prof. Marco Luise Prof. Filippo Giannetti (University of Pisa) (University of Pisa) Prof. Christian Tschudin (University of Basel) Thomas Meyer (University of Basel)

Chemically Inspired Communication System Communication Model Chemical Model Ack1 Sender 1 IN1 Ch OUT Receiver 1 IN2 Sender 2 Ack2 Receiver 2 Loss Congestion Avoidance CNP (T.Meyer, to be published) Dynamics 2

Concept of Chemical Networking Protocols (CNPs) Equilibrium Robustness Self-Healing Self-Optimization Self-Protection Life-like properties observed in nature Goal Chemical Metaphor... Molecules Packets Chemical vessel Communication network nodes Chemical reactions Communication links Chemical virtual machines Computers with standard CPU Chemical model implementation: Fraglets simulator. 3

CNP Information Encoding User Information User information is encoded inside packets. A certain type of molecules (species) contain the same string of symbols. e.g. [node2 HELLO WORLD] System State Information System state information is encoded in the packet rate itself. Concentration of a chemical species Number of molecules of that species. Reactions happen according to the «Law of mass action»: Reaction Rate Randomize queue entries Schedule the service Species concentration Forwarding as fast as possible 4

CNP Properties Dynamics Forecast Communication protocol implementations mapped Abstract chemical models Chemical model dynamics are analyzable Dynamics analysis lead to Chemical model optimization lead to Protocol implementation optimization 5

Standard Analysis of Network Dynamics (1/2) The Chemical Master Equation (CME) The chemical model as a continuous time discrete space Markov jump process (System state equals species concentration) Dynamics of the system probability distribution governed by the CME Features: Exact analysis of the stochastic dynamical behavior of a model Very high computational complexity Solution not always possible 6

Standard Analysis of Network Dynamics (2/2) The Differential Rate Equations Approximation (DREs) Deterministic approximation of the exact stochastic behavior. Features: Decrease of the computational complexity (still high) High concentration systems required Dependence on initial condition 7

The New Signal Processing Approach Chemical networks as systems of blocks and interconnections. Concentration seen as a continuos-time continuos-value signal. Transfer function description Generality of results Based on Differential Rate Equations (DREs) approximation (DREs model description Laplace transform solution) Low computational complexity Deterministic approximation Dependence on initial condition Concept Features 8

Our Analysis Approach of Linear CNPs The Disperser CNP Series of N-Node Parallel of N-Node Connections Typology Loop Network Disperser Features: Species Vessels Nodes Impulse input Injenction of molecules Distributed average computation Molecules equally distributed over the network Elementary Reactions 1 Output N Output 9

Simulink Schematic Node 1 Node 2 Node 3 Node 4 10

Analysis Results (1/2) Frequency Transforms The Disperser CNP 11

Analysis Results (2/2) Impulse Responses The Disperser CNP 12

System Control Theory (1/2) State Variable Representation Block Diagram State matrix Input matrix Output matrix Direct transmission matrix Analyzed systems must be Linear Time Invariant (LTI) 13

System Control Theory (2/2) Frequency Transform Frequency characterization of species concentration Dynamical behavior of the network Step Response Analyzed systems must be Linear Time Invariant (LTI) 14

A Non-Linear CNP Non-Linear Chemical Model DREs with Non-Linearities Traffic Generation of Tx.1 Tx.1 Output Rate Tx.2 Output Rate Channel Limitation Actual Network Output Rate Selective Feedbacks Species Molecules Reactions Chemical Homeostasis Species Dilution Flow Reaction Coefficients 15

Metabolic Control Analysis to Non-Linear CNPs Non-Linear Chemical Model DREs with Non-Linearities Concept: System linearization around a fixed point (steady states) State Variable Representation 16

Analysis Results (1/2) (n) Frequency Transform W (s) Ack1 Tx 1 V out R V out Rx 1 V in Tx 2 Ack2 Rx 2 17

Analysis Results (2/2) Step Response Ack1 Tx 1 V out R V out Rx 1 V in Tx 2 Ack2 Rx 2 18

Discussion! Conclusion Protocol behavior was not easily predictable. Now, all linear chemical networks are analyzable, with similar procedures to those shown. Non-linear networks are linearizable (MCA), with the side effect of a high computational complexity. Even links with delay have been analyzed (not shown). Bi-stable systems. Fixed point near the saddle point. Stochasticity of CNPs briefly introduced. Limits & Future 19

Specialistic Degree 19 July 2010 End End Thank You