The Active Node Transfer System By Chris McAnally & Manu Mittal

Slides:



Advertisements
Similar presentations
Author : David Wetherall Presented By : Gokul Nadathur
Advertisements

Evaluating scalability Peer-to-Peer File Sharing Networks of Sayantan Mitra Vibhor Goyal.
20.1 Chapter 20 Network Layer: Internet Protocol Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Introduction to TCP/IP TCP / IP –including 2 protocols Protocol : = a set of rules that govern the communication between different devices Protocol : =
1 Network Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.
1 Improving the Performance of Distributed Applications Using Active Networks Mohamed M. Hefeeda 4/28/1999.
10/31/2007cs6221 Internet Indirection Infrastructure ( i3 ) Paper By Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Sharma Sonesh Sharma.
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.
Spring 2002CS 4611 Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.
Networking Theory (Part 1). Introduction Overview of the basic concepts of networking Also discusses essential topics of networking theory.
CSCI 4550/8556 Computer Networks Comer, Chapter 19: Binding Protocol Addresses (ARP)
CS335 Networking & Network Administration Tuesday, May 11, 2010.
© 2007 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets with Internet Applications, 4e By Douglas.
Anycast Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
1 Network Management Active Networks. 2 Network Management.
Freenet A Distributed Anonymous Information Storage and Retrieval System I Clarke O Sandberg I Clarke O Sandberg B WileyT W Hong.
Secure Overlay Services Adam Hathcock Information Assurance Lab Auburn University.
Wide-area cooperative storage with CFS
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
1 Internet Protocol: Forwarding IP Datagrams Chapter 7.
CEN Network Fundamentals Chapter 19 Binding Protocol Addresses (ARP) To insert your company logo on this slide From the Insert Menu Select “Picture”
Lecturer: Ghadah Aldehim
Integrated Services (RFC 1633) r Architecture for providing QoS guarantees to individual application sessions r Call setup: a session requiring QoS guarantees.
1 Chapter 6: Proxy Server in Internet and Intranet Designs Designs That Include Proxy Server Essential Proxy Server Design Concepts Data Protection in.
Topics covered: Memory subsystem CSE243: Introduction to Computer Architecture and Hardware/Software Interface.
Denial of Service (DoS) Attacks in Green Mobile Ad–hoc Networks Ashok M.Kanthe*, Dina Simunic**and Marijan Djurek*** MIPRO 2012, May 21-25,2012, Opatija,
Defense by Amit Saha March 25 th, 2004, Rice University ANTS : A Toolkit for Building and Dynamically Deploying Network Protocols David Wetherall, John.
Information-Centric Networks07a-1 Week 7 / Paper 1 Internet Indirection Infrastructure –Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh.
Freenet: A Distributed Anonymous Information Storage and Retrieval System Presenter: Chris Grier ECE 598nb Spring 2006.
UNIT IP Datagram Fragmentation Figure 20.7 IP datagram.
Security Michael Foukarakis – 13/12/2004 A Survey of Peer-to-Peer Security Issues Dan S. Wallach Rice University,
Invitation to Computer Science 5 th Edition Chapter 6 An Introduction to System Software and Virtual Machine s.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing Part 5 Multicasting protocol.
Chapter 19 - Binding Protocol Addresses
IP1 The Underlying Technologies. What is inside the Internet? Or What are the key underlying technologies that make it work so successfully? –Packet Switching.
ECE 526 – Network Processing Systems Design Computer Architecture: traditional network processing systems implementation Chapter 4: D. E. Comer.
1 UNIT 13 The World Wide Web Lecturer: Kholood Baselm.
A Survey of Active Network Research By:Tennehouse,Smith,Sincoskie,Wettherall,Minden Presented By:Prashant, Ravikiran, Ashutosh.
CS 501: Software Engineering Fall 1999 Lecture 12 System Architecture III Distributed Objects.
Lecture 8 Virtual Switching (contd.) & Message Switching.
Introduction to Active Network Technology Bernhard Plattner Computer Engineering and Networks Laboratory ETH Zurich, Switzerland.
High-Speed Policy-Based Packet Forwarding Using Efficient Multi-dimensional Range Matching Lakshman and Stiliadis ACM SIGCOMM 98.
CMSC Presentation An End-to-End Approach to Host Mobility An End-to-End Approach to Host Mobility Alex C. Snoeren and Hari Balakrishnan Alex C. Snoeren.
DNS Security 1. Fundamental Problems of Network Security Internet was designed without security in mind –Initial design focused more on how to make it.
A Scalable High-Performance Active Network Node Dan S. Decasper and Bernhard Plattner, EETH Zurich Guru M. Parulkar, Sumi Chai, John D. Dehart, and Tilman.
1 UNIT 13 The World Wide Web. Introduction 2 Agenda The World Wide Web Search Engines Video Streaming 3.
1 UNIT 13 The World Wide Web. Introduction 2 The World Wide Web: ▫ Commonly referred to as WWW or the Web. ▫ Is a service on the Internet. It consists.
Mobile IP THE 12 TH MEETING. Mobile IP  Incorporation of mobile users in the network.  Cellular system (e.g., GSM) started with mobility in mind. 
1 Distributed Hash tables. 2 Overview r Objective  A distributed lookup service  Data items are distributed among n parties  Anyone in the network.
I3 and Active Networks Supplemental slides Aditya Akella 03/23/2007.
Invitation to Computer Science 6th Edition
Netscape Application Server
Zueyong Zhu† and J. William Atwood‡
Self Healing and Dynamic Construction Framework:
Network Security Marshall Leitem 11/30/04
ANTS Goals Today’s networks lack flexibility …
Programming with ANTS ANTS facilitates protocols construction and deployment Demonstrate some examples using Mobility services Multicasting.
Chris Meullion Preston Burden Dwight Philpotts John C. Jones-Walker
CS4470 Computer Networking Protocols
Troubleshooting IP Communications
Understanding the OSI Reference Model
University of Technology
Cloud Testing Shilpi Chugh.
Security in Java Real or Decaf? cs205: engineering software
Presentation by Theodore Mao CS294-4: Peer-to-peer Systems
Ch 17 - Binding Protocol Addresses
IPv4 Addressing By, Ishivinder Singh( ) Sharan Patil ( )
Outline The spoofing problem Approaches to handle spoofing
Computer Networks Protocols
Presentation transcript:

The Active Node Transfer System By Chris McAnally & Manu Mittal Ants The Active Node Transfer System By Chris McAnally & Manu Mittal

The Current Network Architecture Currently routing behavior is fixed But performance is heavily dependant on network services New protocols and services are rapidly being developed but deployment is long and difficult One Solution Standardize the communications model rather than individual protocols.

Ants Overview Treats the network as a restricted distributed computing environment. Provides a scripting language model to express new protocols as operations at nodes. Allows dynamic deployment

Goals 3 Goals Simultaneously support a variety of protocols and services Support the construction of new protocols through mutual agreement Support dynamic deployment of new protocols

The model Protocols Capsule Code Groups To replace the packet we use capsules which refer to the forwarding routine used to process them. Code Groups A collection of Capsules whose forwarding routines are transferred as a group by the code distribution system. Protocols A collection of related code groups that are treated as a single unit of protection.

Architecture INSERT PICTURES HERE

Type Field An Identifier that tells the associated protocol and forwarding routine. Based on a secure hash of the forwarding routine. MD5 hash function Provides a fingerprint of code for security Prevents protocol spoofing

Active Nodes The biggest problem with a programmable network is ensuring the safety of forwarding routines. Solution Each node provides a set of primitives that are used to construct forwarding routines Active nodes limit access to resources

Node Primitives 10 Primitives that fall into 3 categories Environment Calls Return local information, such as address, etc. Storage calls Objects stored in a “soft-state” i.e. cached Application determines the caching interval Control Operations If no control operation is called, it’s discarded.

Execution Model Four main Characteristics Fixed Forwarding Routine The forwarding routine is fixed at the sender Designed to prevent a bandit from hijacking another application’s capsules Selective Execution Capsules belonging to protocols the active node chooses not to execute are handled as regular IP packets

Execution Model(continued) Resource Limits Cache time Soft-state storage space Network bandwidth Protocol-based Protection Only capsules belonging to the same protocol can share state

Code Distribution System 1). Capsules identify their type 2). When a capsule arrives at a node the cache is checked. If it’s not there the previous node is queried and execution is suspended. 3). When a node receives a load request it responds immediately. 4). When a node receives a load response it places it into the cache and activates the sleeping capsules.