Three planes in networks

Similar documents
Internet Routing. Reminder: Routing. CPSC Network Programming

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.

Distance vector protocol

Inter-domain Routing

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS

CS Summer Lecture #23: Network and End-to-End layers

Declarative Routing: Extensible Routing with Declarative Queries

Distributed Systems Principles and Paradigms

CICS Application Design

10.2 Graph Terminology and Special Types of Graphs

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks

All in One Kit. Quick Start Guide CONNECTING WITH OTHER DEVICES SDE-4003/ * 27. English-1

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA:

This Unit: Processor Design. What Is Control? Example: Control for sw. Example: Control for add

Greedy Algorithm. Algorithm Fall Semester

12/9/14. CS151 Fall 20124Lecture (almost there) 12/6. Graphs. Seven Bridges of Königsberg. Leonard Euler

McAfee Network Security Platform

Discussion 1 Recap. COP4600 Discussion 2 OS concepts, System call, and Assignment 1. Questions. Questions. Outline. Outline 10/24/2010

CMPUT101 Introduction to Computing - Summer 2002

Network Layer: Routing Classifications; Shortest Path Routing

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION

How to Design REST API? Written Date : March 23, 2015

Lecture 13: Graphs I: Breadth First Search

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.

Table-driven look-ahead lexical analysis

Lesson 4.4. Euler Circuits and Paths. Explore This

CS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string.

Containers: Queue and List

Chapter 4 NETWORK LAYER

Security Issues in the Optimized Link State Routing Protocol version 2 (OLSRv2)

Performance characterization of CSMA/CA adapted multi-user MIMO aware MAC in WLANs

Error Numbers of the Standard Function Block

Architecture and Data Flows Reference Guide

McAfee Web Gateway

A distributed edit-compile workflow

Shared Memory Architectures. Programming and Synchronization. Today s Outline. Page 1. Message passing review Cosmic Cube discussion

Symbol Table management

Short Form Return of Organization Exempt From Income Tax

Pattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions

Definition of Regular Expression

High-speed architectures for binary-tree based stream ciphers: Leviathan case study

Mid-term exam. Scores. Fall term 2012 KAIST EE209 Programming Structures for EE. Thursday Oct 25, Student's name: Student ID:

What are suffix trees?

COMP108 Algorithmic Foundations

Distributed Systems Principles and Paradigms

EXTENDED TO AUGUST 15, 2017 Short Form Return of Organization Exempt From Income Tax. terminated 100 FESTIVAL PARK AVE

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

IP: Network Layer. Goals and Tasks. Routing. Switching. Switching (cont.) Datagram v/s Virtual Circuit. Overview Addressing Routing

COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE

Network Interconnection: Bridging CS 571 Fall Kenneth L. Calvert All rights reserved

CS 241. Fall 2017 Midterm Review Solutions. October 24, Bits and Bytes 1. 3 MIPS Assembler 6. 4 Regular Languages 7.

CS 241 Week 4 Tutorial Solutions

Mobility Support for a QoS Aggregation Protocol

Section 2.3 Functions. Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A B, is a subset of A B such that

Certificate Replacement. 21 AUG 2018 VMware Validated Design 4.3 VMware Validated Design for Software-Defined Data Center 4.3

Short Form Return of Organization Exempt From Income Tax

McAfee Network Security Platform

Reducing a DFA to a Minimal DFA

McAfee Data Loss Prevention Prevent

Research Article Distributed Dynamic Memetic Algorithm Based Coding Aware Routing for Wireless Mesh Sensor Networks

Routing: Network Layer Part II

Resilience in Multilayer Networks

Smart Output Field Installation for M-Series and L-Series Converter

Comparison-based Choices

Single-Layer Trunk Routing Using 45-Degree Lines within Critical Areas for PCB Routing

Comparison between nmos Pass Transistor logic style vs. CMOS Complementary Cells*

Installer reference guide

Active Fail-Open Kit Quick Start Guide

CS201 Discussion 10 DRAWTREE + TRIES

Architecture and Data Flows Reference Guide

Light Module Type. Lens Color Description V AC/DC (no-lamp module ) Steady no lamp. 3 Green 24 24V AC/DC. Steady LED.

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.

Outline. CS38 Introduction to Algorithms. Graphs. Graphs. Graphs. Graph traversals

Short Form Return of Organization Exempt From Income Tax

COSC 6374 Parallel Computation. Dense Matrix Operations

Software Configuration Management

Lexical Analysis. Amitabha Sanyal. ( as) Department of Computer Science and Engineering, Indian Institute of Technology, Bombay

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam

Premaster Course Algorithms 1 Chapter 6: Shortest Paths. Christian Scheideler SS 2018

Compilers. Topic 4. The Symbol Table and Block Structure PART II. Mick O Donnell: Alfonso Ortega:

INSTALLING PRIVA GATEWAY FOR PRIVA CONNEXT

Minimal Memory Abstractions

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards

Lesson6: Modeling the Web as a graph Unit5: Linear Algebra for graphs

Languages. L((a (b)(c))*) = { ε,a,bc,aa,abc,bca,... } εw = wε = w. εabba = abbaε = abba. (a (b)(c)) *

Using SIMD Registers and Instructions to Enable Instruction-Level Parallelism in Sorting Algorithms

Extended to November 15, 2017 Short Form Return of Organization Exempt From Income Tax. terminated 4 WEST 43RD STREET

Loop Shifting and Compaction for the High-Level Synthesis of Designs with Complex Control Flow

Calculus Differentiation

Operational Verification. 26 SEP 2017 VMware Validated Design 4.1 VMware Validated Design for Software-Defined Data Center 4.1

Form 990 (2017) ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Form 990 (2017) ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

PRIMATE RESCUE CENTER

Form 990 (2016) ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Lexical Analysis: Constructing a Scanner from Regular Expressions

LS Example 5 3 C 5 A 1 D

Chapter 16. Shortest Paths Shortest Weighted Paths

Transcription:

Three plnes in networks Prof. Mlthi eerrghvn Ele. & Comp. Engg. Dept/CATT Polytehni University mv@poly.eu M. eerrghvn 1 Polytehni University User plne, ontrol plne, n mngement plne Mngement plne: onsists of ll the protools neee to onfigure t tles for the opertion of the network For exmple, protools for routing t issemintion (istriute or entrlize) Other funtions: performne, fult mgmt., ounting, seurity Control plne: Connetion ontrol protools in CO networks, this inlues onnetion t eh swith (onnetions t the network lyer) in CL networks, this inlues onnetion only t the enpoints (onnetions t the trnsport lyer, if the TL protool is relile) Cll ontrol protools User plne: protools for the tul flow of t M. eerrghvn 2 Polytehni University 1

Routing protool in ll three types of networks - Phse 1 Dest. Next hop Dest. -* Next hop Routing protool Dest. -* Routing protool Next hop Routing protool Routing tles Host M. eerrghvn Routing protools exhnge topology/loing/rehility informtion Routes to estintions re preompute n store in routing tles 3 Polytehni University Signling protool for NL onnetion in PS CO network - Phse 2 Connetion () Port /Lel /L1 Port/Lel /L2 Connetion Port /Lel /L2 Connetion Port/Lel /L1 Host Connetion onsists of eh swith on the pth Route lookup for next hop noe to reh estintion CAC (Connetion Amission Control) for uffer n W Writing the input/output lel mpping tles n progrmming the sheuler M. eerrghvn 4 Polytehni University Port /Lel /L1 Port/Lel /L3 Connetion irtul iruit 2

Signling protool for NL onnetion in CS CO network - Phse 2 Connetion () /1 /2 Connetion Connetion /2 /2 Host Connetion onsists of eh swith on the pth Route lookup for next hop noe to reh estintion CAC (Connetion Amission Control) for W (note: no uffers) M. eerrghvn Writing the port/timeslot/λ 5 mpping tle Polytehni University /2 /1 Connetion Ciruit User-plne pket forwring in PS CO network - Phse 3 L1 Port /Lel /L1 Port/Lel /L2 L2 Lels re P/Cs in ATM Lels re trnslte from link-to-link L1 L3 Host M. eerrghvn 6 Polytehni University 3

User-plne tions in iruit-swithe network - Phse 3 /1 /2 Host its rriving t swith on time slot 1 on port re swithe to time slot 2 of port M. eerrghvn 7 Polytehni University User-plne pket forwring in CL PS network - Phse 3 Host Pket heers rry estintion host ress (unhnge s it psses hop y hop) Eh CL pket swith oes route lookup to etermine the outgoing port/next hop noe M. eerrghvn 8 Polytehni University 4

Aressing Where re enpoint resses use: n CL PS networks, enpoint resses re rrie in pket heers n CO networks, e it PS or CS, enpoint resses re rrie in onnetion messges M. eerrghvn 9 Polytehni University Summrize resses Wht re summrize resses? Why summrize resses? M. eerrghvn 10 Polytehni University 5

Summrize resses Wht re summrize resses? An ress tht represents group of enpoint resses e.g., ll 212 numers, 128.238 P resses Why summrize resses? Reues routing tle sizes hol one entry for summrize ress inste of lrge numer of iniviul resses Reues routing messge lengths tht onvey rehility informtion M. eerrghvn 11 Polytehni University Exmples of signling protools SS7 (Signling System No. 7) network (with its SS7 protool stk) rries signling messges to set up n relese iruits in telephone network M. eerrghvn 12 Polytehni University 6

Exmples of routing protools n the nternet: Link-stte routing protools, suh s Open Pth Shortest First (OSPF) Distne-vetor se routing protools, suh s Routing nformtion Protool (RP) n telephone networks: Rel-Time Network Routing (RTNR) M. eerrghvn 13 Polytehni University Exmples of ressing shemes nternet 4-yte P resses Telephone networks 8-yte E.164 ress (telephone numer) ATM networks 20-yte ATM En System Aress (AESA) M. eerrghvn 14 Polytehni University 7