SwitchWare Active Network Architecture

Slides:



Advertisements
Similar presentations
Internetworking II: MPLS, Security, and Traffic Engineering
Advertisements

COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
Jaringan Komputer Lanjut Packet Switching Network.
1 Version 3 Module 8 Ethernet Switching. 2 Version 3 Ethernet Switching Ethernet is a shared media –One node can transmit data at a time More nodes increases.
1 Improving the Performance of Distributed Applications Using Active Networks Mohamed M. Hefeeda 4/28/1999.
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.
CS 268: Active Networks Ion Stoica May 6, 2002 (* Based on David Wheterall presentation from SOSP ’99)
Department of Computer Science, Purdue University Active Networks: Applications, Security, Safety and Architectures Author: Konstantinos Psounis Stanford.
1 Version 3 Module 8 Ethernet Switching. 2 Version 3 Ethernet Switching Ethernet is a shared media –One node can transmit data at a time More nodes increases.
1 Network Management Active Networks. 2 Network Management.
Gursharan Singh Tatla Transport Layer 16-May
Introduction to networking (Yarnfield) Introduction to routing.
Introduction to networking (Yarnfield) Introduction to routing.
Semester 1 Module 8 Ethernet Switching Andres, Wen-Yuan Liao Department of Computer Science and Engineering De Lin Institute of Technology
1 CISCO NETWORKING ACADEMY PROGRAM (CNAP) SEMESTER 1/ MODULE 8 Ethernet Switching.
Cisco – Chapter 11 Routers All You Ever Wanted To Know But Were Afraid to Ask.
CS3502: Data and Computer Networks Local Area Networks - 4 Bridges / LAN internetworks.
Defense by Amit Saha March 25 th, 2004, Rice University ANTS : A Toolkit for Building and Dynamically Deploying Network Protocols David Wetherall, John.
IP Forwarding.
1 The Internet and Networked Multimedia. 2 Layering  Internet protocols are designed to work in layers, with each layer building on the facilities provided.
ECE 526 – Network Processing Systems Design Networking: protocols and packet format Chapter 3: D. E. Comer Fall 2008.
Review: –Ethernet What is the MAC protocol in Ethernet? –CSMA/CD –Binary exponential backoff Is there any relationship between the minimum frame size and.
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
CSC 600 Internetworking with TCP/IP Unit 7: IPv6 (ch. 33) Dr. Cheer-Sun Yang Spring 2001.
Sem1 - Module 8 Ethernet Switching. Shared media environments Shared media environment: –Occurs when multiple hosts have access to the same medium. –For.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
Internet Protocols (chapter 18) CSE 3213 Fall 2011.
Networks and Distributed Systems Mark Stanovich Operating Systems COP 4610.
PLAN: Packet Language for Active Networks Michael Hicks joint work with Jon Moore, Pankaj Kakkar, Carl Gunter, and Scott Nettles Switchware Project Computer.
1 Connectivity with ARP and RARP. 2 There needs to be a mapping between the layer 2 and layer 3 addresses (i.e. IP to Ethernet). Mapping should be dynamic.
Networks and Distributed Systems Sarah Diesburg Operating Systems COP 4610.
1 Transport Layer: Basics Outline Intro to transport UDP Congestion control basics.
4: DataLink Layer1 Hubs r Physical Layer devices: essentially repeaters operating at bit levels: repeat received bits on one interface to all other interfaces.
IP Protocol CSE TCP/IP Concepts Connectionless Operation Internetworking involves connectionless operation at the level of the Internet Protocol.
Data Communication Network Models
4. Interconnecting Networks: Routers. © Tallal Elshabrawy 2 Bridges Vs Routers BRIDGES DO WELL IN SMALL (FEW HUNDRED HOSTS) WHILE ROUTERS USED IN LARGE.
CISA Dumps PDF Certified Information Systems Auditor You Can Complete PDF File Download:
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
IPSecurity.
The Transport Layer Implementation Services Functions Protocols
CS408/533 Computer Networks Text: William Stallings Data and Computer Communications, 6th edition Chapter 1 - Introduction.
Encryption and Network Security
Networking Devices.
The Underlying Technologies
Scaling the Network: The Internet Protocol
Chapter 9 ICMP.
Computer Data Communications
Chapter 4 Data Link Layer Switching
Hubs Hubs are essentially physical-layer repeaters:
Chapter 6: Network Layer
Chapter 7 Backbone Network
Network Components.
Chapter 5 The Network Layer.
Hubs Hubs are essentially physical-layer repeaters:
Congestion Control, Internet transport protocols: udp
Transport Layer Unit 5.
Module 8: Ethernet Switching
Network Core and QoS.
Process-to-Process Delivery:
ECE453 – Introduction to Computer Networks
PRESENTATION COMPUTER NETWORKS
Communication Networks NETW 501
Net 323 D: Networks Protocols
Distributed Systems CS
Scaling the Network: The Internet Protocol
Computer Networks Protocols
Lecture 36.
Network Core and QoS.
Lecture 36.
Distributed Systems CS
Presentation transcript:

SwitchWare Active Network Architecture Group 5 ECE 4605 Neha Jain Shashwat Yadav

Introduction Present IP Networks (passive/traditional/legacy) ‘Smart’ hosts on the network edge connected by ‘Simple” routers. Routers store, examine and forward (table lookup) Limited options available in packet header Eg. Timestamps (10 bytes), SACK Limited user control over network behavior Active Networks Allow intermediate routers to perform computation Programs travel inside network packets (“Active Packets”) and executed at intermediate nodes. Provides a programmable network with user control. Related Work MIT: Capsules, ANTS Gatech and Uni of Kentucky: CANES project UPENN: SwitchWare

Advantages of Active Networks To accommodate the rapid evolution and deployment of network technologies To provide the increasingly sophisticated services demanded by user applications ( including QoS ) To do away with the need of standardization of protocols Allows experimentation

NACK Implosion in a Multicast tree F and G send a NACK. A receives multiple NACKS  NACK implosion Solved in an Active Network At C, it is checked if a previous NACK was received for the same packet. YES: add current sender to the list of retransmission. NO: forward NACK and leave a marker for the packet for which NACK was forwarded.

Switchware Architecture Layer III – Active Packets Layer II – Active Extensions (Node Resident) Layer I – Active Router Infrastructure Provide services which can be invoked by active packets Supports resource allocation And enforces the rules for downloading switchlets Lightweight mobile programs

Security Model Three Approaches: Public Facilities Available to anyone Low risk of abuse e.g. Ping Authenticated Facilities User must submit to an identity check, to determine authorization to use a service. e.g. Remote Login Verified Facilities A node formally verifies certain properties. E.g. Mobile code Type checking and program verification

Verification Type Checking PCC – Proof Carrying Code STATIC DYNAMIC Compile Time Greater Efficiency as errors detected earlier Conservative approach DYNAMIC Run time Greater flexibility Type errors are dealt with at runtime if they occur. PCC – Proof Carrying Code Integrates verification with authorization Easier to check an answer than to produce it. Programming language should be strongly typed. Verification can be done effectively Verification done by PCC produces formal proof. Proof checked by a node to provide authorization.

Active Packets : Layer III Instead of header + payload, we have code + data. Active packets carry programs consisting of both code and data. Code interacts with intermediate nodes – more customizable. Entire packet is forwarded to next hop. Code delivers data at the destination. Requirements for the Programming Language Lightweight Entire communication depends on how fast program is executed. Strongly typed – for security. Remote execution facilities. Bounded resource usage. No reverse traffic No excess capacity available TCP-LP slightly perturbs TCP flow

PLAN Programming Language for Active Networks Performance Security Supports simple data and control structures. Easy to compile and interpret Security PLAN program cannot alter state on a node. Strongly typed – can’t threaten integrity of a node. Statically type checkable for programmer convenience Resource Bound Like TTL (Time To Live) Bound on amount of resources (like bandwidth and CPU cycles) Guaranteed to terminate

Active Extensions – Layer II Active packets are limited in power Cannot implement arbitrary protocols or functionality. Achieved by Active Extensions combined with Active Packets. Resident and executed on a particular node Can be dynamically loaded onto routers and provide services to Active Packets Need not be light-weight Heavier weight security check Statically type checked at the router upon arrival Active extensions perform tasks like Creating or changing state at the router

Secure Active Routers - Layer I Solid base upon which active packets and active extensions are built Goals Provide support to language oriented model used at higher layers Incur minimal costs while system is in operational state Maximize system security under a minimal set of assumptions about trusted components. Embodied by SANE Secure Active Network Environment

SANE What is Integrity ? System in not altered from some known state Uses the approach of guaranteeing integrity of the lower layers Identifies minimal set of system elements upon which system integrity is dependent BIOS Public key infrastructure for authenticating of module sources Ensures that presumptions of system elements are true Dynamic checks – performed while system is operating Static Checks – performed before system enters operating mode

PLANet – Active Internetwork All transmitted packets are PLAN programs This helps in having a generic exchange protocol for all the nodes Distributed protocols are implemented as combination of PLAN programs Like routing tables and ARP Runs in user-space on Linux machines and uses Ethernet as well as UDP as underlying network layers Router achieves 50 Mbps over 100Mbps Ethernet

Active Bridge A prototype constructed to study active networking at active extension layers Bridge connects two LAN’s providing extended network Active extensions called switchlets are loaded in the bridge (coded in Caml) Switchlet 1 : Buffered repeater Switchlets 2 and 3 : Spanning tree algorithms (STA) IEEE 802.1D STA DEC STA Switchlet 4 : Sanity check One of them is flawed ‘Smart’ switch checks the result of the STA If erroneous the other STA is stored

Critique: High end routers require greater upkeep and maintenance. Handling more trust to the programmers. So more susceptible to security breaches. No comparison of time/bandwidth utilization between traditional and active networks.

Discussions Results of the Active Bridge implementation Coding language of the Active extensions? Per flow/ Per packet