Forwarding on Gates - a Clean-Slate Replacement for IP

Transcription

1 Forwarding on Gates - a Clean-Slate Replacement for IP Florian Liers, Thomas Volkert Research seminar KIT Karlsruhe (February 2011)

2 Main fields Electrical engineering Engineering Computer science Media Statistics Professors: ~100 Students: ~6500 TU Ilmenau 2

3 TU Ilmenau 3

4 ICS Group Projects Integrated SW/HW Systems ERADOS Experimentelle Forschung zur adaptiven Fehlerdiagnose basierend auf strukturellen multi-core Emulationstest (TAB) Quadrocopter Lab Mobile communication DFG Graduiertenkolleg Self-organized Mobile Communication Systems for Disaster Scenarios Self-organization in LTE (ALU) Cognitive Radio Network Lab (CZ Foundation) MoSaKa Mobile Satellitenkommunikation im Ka-Band (BMWi) G-Lab Forwarding on Gates (BMBF) 4

5 Forwarding on Gates - a Clean-Slate Replacement for IP Florian Liers, Thomas Volkert Research seminar KIT Karlsruhe (February 2011)

6 Content Introduction Problems Design goals Idea FoG Gates and forwarding nodes Architecture Transfer service Routing service & process internals Example routing service Zone-based Summary 6

7 Internet Problem 1: Naming DNS is just an add-on No split: name address No application names API App DNS TCP/IP IP address location hint Naming of sub-network points of attachment Uni Erlangen TU Berlin TU Ilmenau PTB Braunschweig Uni Jena 7

8 Internet Problem 2: QoS Assumption FI requires QoS Main problems for inter-network Location of state information? AAA? Provider policies? Dependencies Routing Functions per auton. system ~4 times Autonomous System Neighbor Packet Neighbor QoS QoS QoS 8

9 Internet Problem 3: Functions Adding functionality Partial deployment Management complexity Function Selection Composition Location End nodes Intermediate nodes Dependencies Routing Naming Workflow? App 1 App 2 Func 1 Func 2 Func 3 Func 4 NIC Type? 9

10 Design Goals Inter-Network Unrestricted naming Naming applications Internally visible addresses Improve QoS for inter-networks Flexible state distribution Built-in authentication AAA Flexible function injection Dynamic function chaining Simplify management 10

11 Idea Naming blocks Mapping requirements to blocks / block types Management dealing with blocks? Uniform signaling Inter-network built by building blocks No separation routing & selection/composition Blocks have to support QoS Re-using blocks 11

12 Content Introduction Problems Design goals Idea FoG Gates and forwarding nodes Architecture Transfer service Routing service & process internals Example routing service Zone-based Summary 12

13 Transition of Today s Stack TCP App Socket Port Decomposition: not in G-Lab_FoG, just an illustrative example. F Socket 5 7 F IP MAC Protocol Ethertype Gate F TCP 1 2 F F IP 5 6 F F MAC NIC Forwarding Node 2 13

14 Forwarding in Stacks and Networks Source Destination Source Destination Appl. Appl. Library Library Encoding Decoding UDP UDP IP IP Encryption Decryption Ethernet Ethernet Net D Net U IP Cable IP: layered protocol stack node-based forwarding Unicast Transport FoG: chained building blocks edge-based forwarding MAC 14

15 Gate ( Edge Building Block) Represent Abstraction of lower layer links Unicast Broadcast Multicast Implementation of application functions Video encoder/decoder Data filter: virus scanner Packet filter: firewall Additional attributes Quality guarantees Sequentially combinable Packets are transmitted gate by gate Recursively combinable Can consist of gates and FN Gate Number Forwarding Nodes x Gate 15

16 FoG Architecture Transfer service (TS) Packet forwarding Consists of and manages Gates Forwarding nodes Manipulates packet headers Routing service (RS) Path calculation Supports partial routing Authentication service (AS) AAA support Based on PKI Higher layer Transfer Service Lower layer FoG Routing Service Auth. Service 16

17 Transfer Service Manager Observes local topology Policy handling Error handling Sends topology updates to RS Uses AS for AAA Sockets Communication end point Chain of gates Supports data sending and receiving Transfer Plane Consists of gates and FNs Informs manager about Errors Topology changes Sockets Higher Layer Transfer Service Manager Transfer Plane Lower Layer RS AS 17

18 Routing Service Requirements Mapping Application requirements gate types Topology attributes additional gate attributes Name Mapping Support human readable names Names internal addresses Path Calculation Triggers creation of additional gates in TS TS Graph Database Stores information from TS Reports topology Path Calculation Routing Service Name Mapping Requirements Mapping Graph Database 18

19 Description Language For application requirements gates gate types Idea Object oriented Extendable Serializable (e.g. XML) No negotiation process (just yes/no) (Ordered) set of Non-functional properties Bandwidth (min, max) Rule: >= Delay (min, max) Rule: + Loss rate (max) Rule: +(1-x)* Ordering (boolean) Rule: && Functional properties Ciphering Gates Encryption and Decryption Error correction Gates Checksum and Check Order Gates Numbering and Sort Virus check Gate Virus check Assignment unclear 19

20 Routing Based on Policies ISP A tu-ilmenau.de ISP C Client Gateway A 5 2. RS(Bank.svc) = 3,5,7,? Gateway C 8 x 30 Bank.svc 1. RS(Bank.svc) = 20,? 3. RS(Bank.svc) = x Globally known Locally known 6 Gateway B 7 ISP B R = 20,3,5,7,x BR = 30,8,6,4,21 20

21 Message Structure Header Footer Header Size Flags Modific. Counter Payload Size Route Payload Auth. Info. Reverse Route Description language Segment list: [20] Bank.svc Best Effort Gate number list Destination Requirements Indicates (optional) partial route 21

22 Incremental vs. Source Routing Better scalability Nodes with limited knowledge Iterative process Security Policy-based routing Explicit admission control Route access QoS usage Independent from under laying network type Wired & wireless networks 22

23 Content Introduction Problems Design goals Idea FoG Gates and forwarding nodes Architecture Transfer service Routing service & process internals Example routing service Zone-based Summary 23

24 Zone-based Routing Approach Routing hierarchy Problem separation: Partial routing based on zones One coordinator per zone QoS support: traffic classification and separation Hierarchical addressing: used to identify target zone Partial routing from S to D: Level 2 Host Level 1 Zone Coordinator Level 0 S Transfer service Gates Normal Entity D 24

25 Zone-based Flexibility Hierarchy Depth / cluster size performance vs. management Dynamic of clustering / forbidden merges Route calculation Topology distribution protocol Use BGP Use OSPF Network policy location dependent routing behavior Coordinators Nodes priority Amount of failover instances 25

26 Summary Focused on inter-networks Forwarding Based on building blocks Universal for stack and network Routing Incremental process Supports QoS Zone-based routing approach Scalability and flexibilty 26

27 Benefits of FoG For providers/administrators Unified management interface Easy to add additional functions Hide network structure Routing and security policies Explicit admission control For protocol/application developers Flexible naming and routing For users Requirements handling QoS support 27

28 Related Topics in SIG Funcomp Description language Defining requirements & BBs? Three use cases (Netlets, Sonate, FoG) Selection & Composition How? API App Network One major issue for transition to FI! Relation to recursive layers? Independent of (inter-)network? At least 5 examples (IP, Spovnet, Netlets, Sonate, FoG) 28

29 Contact Ilmenau University of Technology Univ.-Prof. Dr.-Ing. phone: +49 (0) fax: +49 (0) Visitors address: Technische Universität Ilmenau Gustav-Kirchhoff-Str. 1 (Informatikgebäude, Room 210) D Ilmenau 29