1 The Marketing Story A single protocol –Exploration = confirmation of reachability = quick check –Works the same way for the current or other pairs Efficient.

Slides:



Advertisements
Similar presentations
Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
Advertisements

Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
IKEv2 extension: MOBIKE Faisal Memon Erik Weathers CS 259.
© 2004 SafeNet, Inc. All rights reserved. Mobike Protocol Design draft-kivinen-mobike-design-00.txt Tero Kivinen
Real-Time Authentication Using Digital Signature Schema Marissa Hollingsworth BOISECRYPT ‘09.
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
1 SCTP Tutorial, Ottawa 7/2004 © 2004 Randall Stewart (Cisco Systems), Phill Conrad (University of Delaware). All rights reserved. IP Multi-homing The.
ICE Jonathan Rosenberg dynamicsoft. Issue 1: Port Restricted Flow This case does not work well with ICE right now Race condition –Works if message 13.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
RFC 2453 RIP 2 (Routing Information Protocol) Daher Kaiss.
Internet Networking Spring 2002 Tutorial 13 Web Caching Protocols ICP, CARP.
Implementing Remote Procedure Calls an introduction to the fundamentals of RPCs, made during the advent of the technology. what is an RPC? what different.
1 More on Distributed Coordination. 2 Who’s in charge? Let’s have an Election. Many algorithms require a coordinator. What happens when the coordinator.
1 SCTP Tutorial, Ottawa 7/2004 © 2004 Randall Stewart (Cisco Systems), Phill Conrad (University of Delaware). All rights reserved. Special Considerations.
Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.
CAPWAP Editor’s Report Pat R. Calhoun Cisco Systems, Inc.
ICMP (Internet Control Message Protocol) Computer Networks By: Saeedeh Zahmatkesh spring.
Mobile IP Traversal Of NAT Devices By, Vivek Nemarugommula.
1 Chapter 6 – Internet Protocol: Connectionless Datagram Delivery 6.3 Internet Architecture and Philosophy Chapters are about this layer NETWORK.
23-Support Protocols and Technologies Dr. John P. Abraham Professor UTPA.
Resource Reservation Protocol (RSVP) (1) Advanced Multimedia University of Palestine University of Palestine Eng. Wisam Zaqoot Eng. Wisam Zaqoot December.
March 7, 2005MOBIKE WG, IETF 621 Mobility Protocol Options for IKEv2 (MOPO-IKE) Pasi Eronen.
1 IP: putting it all together Part 2 G53ACC Chris Greenhalgh.
Institute of Computer and Communication Network Engineering OFC/NFOEC, 6-10 March 2011, Los Angeles, CA Lessons Learned From Implementing a Path Computation.
Mobile Routing protocols MANET
Chapter 2 – X.25, Frame Relay & ATM. Switched Network Stations are not connected together necessarily by a single link Stations are typically far apart.
6.1. Transport Control Protocol (TCP) It is the most widely used transport protocol in the world. Provides reliable end to end connection between two hosts.
1 Design of the MOBIKE Protocol Editors: T. Kivinen H. Tschofenig.
1 Section 10.9 Internet Security Association and Key Management Protocol ISAKMP.
CS332, Ch. 26: TCP Victor Norman Calvin College 1.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Data Link Layer Part I – Designing Issues and Elementary.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Bob Knowledge Plane -- Scaling of the WHY App Bob Braden, ISI 24 Sept 03.
Interest NACK Junxiao Shi, Introduction Interest NACK, aka "negative acknowledgement", is sent from upstream to downstream to inform that.
ACM SIGACT News Distributed Computing Column 9 Abstract This paper covers the distributed systems issues, concentrating on some problems related to distributed.
Chapter 12 - Packet Switching Introduction Sharing Saves Money –Arranging for multiple devices to share a single transmission path lowers cost because.
CS 453 Computer Networks Lecture 9 Layer 2 – Data Link Layer.
Security, NATs and Firewalls Ingate Systems. Basics of SIP Security.
Introduction to Mobile IPv6
Internet Control Message Protocol (ICMP) Chapter 7.
Protocol Specification Prof Pallapa. Venkataram Department of Electrical Communication Engineering Indian Institute of Science Bangalore – , India.
© 2004 SafeNet, Inc. All rights reserved. Mobike Protocol draft-kivinen-mobike-protocol-00.txt Tero Kivinen
Interactive Connectivity Establishment : ICE
Protocol Layering Chapter 11.
NATFW NSLP overview. Document history v00 - Jan 27th - Creation.
Networks, Part 2 March 7, Networks End to End Layer  Build upon unreliable Network Layer  As needed, compensate for latency, ordering, data.
LISP Locator Reachability Algorithms Dino Farinacci, Dave Meyer, Darrel Lewis, Vince Fuller, Andrew Partan, Noel Chiappa IETF Stockholm LISP Working Group.
Packet switching Monil Adhikari. Packet Switching Packet switching is the method by which the internet works, it features delivery of packets of data.
NSIS NAT/Firewall Signaling NSIS Interim Meeting Romsey/UK, June 2004 Martin Stiemerling, Hannes Tschofenig, Cedric Aoun.
McGraw-Hill Chapter 23 Process-to-Process Delivery: UDP, TCP Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
HIP-Based NAT Traversal in P2P-Environments
Codec Control for RTCWEB
SMTP: simple mail transfer protocol
Vocabulary Prototype: A preliminary sketch of an idea or model for something new. It’s the original drawing from which something real might be built or.
Telemedicine.
Vocabulary Prototype: A preliminary sketch of an idea or model for something new. It’s the original drawing from which something real might be built or.
ODMRP Enhancement.
Internet Networking recitation #12
Transport Layer Unit 5.
Communication Networks NETW 501 Tutorial 3
Sarah Diesburg Operating Systems COP 4610
Ad hoc Routing Protocols
CS412 Introduction to Computer Networking & Telecommunication
In peer-to-peer networks such as gnutella, each host must search out other hosts. When a host finds another host, these hosts become neighbors. Often a.
Protocol ap1.0: Alice says “I am Alice”
Andy Wang Operating Systems COP 4610 / CGS 5765
A simple network connecting two machines
Last Class: Communication in Distributed Systems
Revisiting Path Switch
Error Checking continued
Presentation transcript:

1 The Marketing Story A single protocol –Exploration = confirmation of reachability = quick check –Works the same way for the current or other pairs Efficient –No packets sent if payload traffic is idle –No packets sent if bidirectional payload traffic –Packets sent only if (a) there’s a failure or (b) there’s unidirectional traffic Minimization of overhead for case b is unimportant Simple, no unnecessary negotiation or messages Handles unidirectional failures Built to be extensible for handling NATs

2 The Design Same messages have four complementary functions: –Show direct reachability, i.e., that the message can get to the receiver –Show indirect reachability, i.e., that earlier messages or payload packets from the receiver have gotten to the sender –Request the receiver to send responses over different return paths –Perform a return routability test in anticipation of moving a traffic stream to an address Timeout is a protocol constant –10s ; extensible later to other values for real-time re-homing

3 REAP (1/4) - Idle A B If you are not sending or receiving payload packets, assume path is OK

4 REAP (2/4) - Bidirectional Traffic A B Payload packet If you send and receive payload packets, assume path is OK

5 REAP (3/4) - Unidirectional Traffic A B Payload packet Event (no=10, seen={a payload}, iamok=yes) If you are receiving payload packets but not sending within t, assume path is OK but send an event message

6 REAP (4/4) - Failure A B If you are sending payload packets but not receiving anything, request peer to explore other return paths. Return path failure: Payload packet Event (no=10, seen={}, iamok=no) Event (no=20, seen={10,a payload}, iamok=yes, nonce1) Event (no=21, seen={10,a payload}, iamok=yes, nonce2) Event (no=11, seen={21:nonce2}, iamok=yes) Payload packet

7 State Machine State OK –I am receiving something State Not OK –I am not receiving anything, hence something needs to change