Content Routing Protocol Design Karthikeyan Ganesan Shruti Venkatesh Rafay Zamir.

Slides:



Advertisements
Similar presentations
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
Advertisements

IP Forwarding Relates to Lab 3.
Geo – Routing in ad hoc nets References: Brad Karp and H.T. Kung “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, Mobicom 2000 M. Zorzi,
Project3 Malabika Das Prajna Setty Preeti Rao. Assumptions and Address Scheme Assumptions End hosts can only connect to one router and knows which router.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
ECE 544 Project 3 Content Based Routing Neelakantan Nurani Krishnan Shikha Kakkar Suja Srinivasan.
Ad Hoc Wireless Routing COS 461: Computer Networks
Connecting Networks © 2004 Cisco Systems, Inc. All rights reserved. Defining the IP Packet Delivery Process INTRO v2.0—4-1.
Introduction to IT and Communications Technology Justin Champion C208 – 3292 Ethernet Switching CE
ECE 544 Project3 Kush Patel Siddharth Paradkar Ke Dong.
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
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.
ECE 544 Project3 Team member. Assumptions and Address Scheme Assumptions End hosts can only connect to routers Same content available at multiple end.
Module 4: Fundamentals of Communication Technologies.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
The Inter-network is a big network of networks.. The five-layer networking model for the internet.
COP 4930 Computer Network Projects Summer C 2004 Prof. Roy B. Levow Lecture 3.
ECE 544 Project3 Amith V.S Pavan Kulkarni Suneet Dixit.
The Network Layer.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
Mapping IP Addresses to Hardware Addresses Chapter 5.
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
IT 210: Web-based IT Fall 2012 Lecture: Network Basics, OSI, & Internet Architecture.
1 Protocol Independent Multicast (PIM) To develop a scalable protocol independent of any particular unicast protocol –ANY unicast protocol to provide routing.
Address Resolution Protocol (ARP). Internet and Data Link Layer Addresses Each host and router on a subnet needs a data link layer address to specify.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
Packet switching Monil Adhikari. Packet Switching Packet switching is the method by which the internet works, it features delivery of packets of data.
Fundamentals of Computer Networks ECE 478/578
IP Protocol CSE TCP/IP Concepts Connectionless Operation Internetworking involves connectionless operation at the level of the Internet Protocol.
ECE 544 Project3 Ali Rostami Mohsen Ghassemi Mahmoud Ramezani-Mayiami.
TCP/IP1 Address Resolution Protocol Internet uses IP address to recognize a computer. But IP address needs to be translated to physical address (NIC).
ECE 544 Protocol Design Project 2016 Chengyao Wen Hua Deng Xiaoyu Duan.
ECE 544 Group Project : Routing KC Huang. Objective Application: message multicast. A message is sent from one sender to 1~3 recipients. Reach a protocol.
ECE 544 Project3 Parishad Karimi Mehrnaz Tavan Sai Teja Lingam.
ECE 544 Protocol Design Project 2016
Forwarding and Routing IP Packets
IP Forwarding Covers the principles of end-to-end datagram delivery in IP networks.
Link-State Routing Protocols
Internet Networking recitation #4
A comparison of Ad-Hoc Routing Protocols
THE NETWORK LAYER.
Chapter 5 The Network Layer.
ECE 544 Protocol Design Project 2016
ECE 544 Project3 Team member.
IP Forwarding Relates to Lab 3.
ECE 544 Protocol Design Project 2016
Anup Mathur Anusha Sheelavant Prakhar Srivastava
IP Forwarding Relates to Lab 3.
Vidur Nayyar Xueting Wang Weicong Zhao
Link-State Routing Protocols
ECE 544 Group Project : Routing
ECE 544 Project3 Team member: BIAO LI, BO QU, XIAO ZHANG 1 1.
Aayush Patidar Ashwin Ramakrishnan Manoj Juneja
Viet Nguyen Jianqing Liu Yaqin Tang
Christopher Beyer Hajar Mahdavi-Doost Tony Thayil
Link-State Routing Protocols
ECE 544 Project3 Team member.
IP Forwarding Relates to Lab 3.
Networking and Network Protocols (Part2)
IP Forwarding Relates to Lab 3.
Chapter 24 Mobile IP.
CCE1030 Computer Networking
ECE 544 Project3 Dheeraj Medikonda Ravi Chandra Godavarthi 1.
Presentation transcript:

Content Routing Protocol Design Karthikeyan Ganesan Shruti Venkatesh Rafay Zamir

Assumptions and Address Scheme Assumptions End hosts can only connect to routers Same content might be available at multiple end nodes or might not be available at any node.

Bootstrapping and Discovery Algorithm End hosts entering a network broadcast content list.(contains host address and list of contents) End hosts broadcast content change.(contains host address and list of changed contents and their status) Built over IP based routing. Packet Header The content request packet header contains the source address, Content ID and Sequence Number(n th packet in content ).

Baseline Algorithm Content routing algorithm Address based Forwarding table Content Table Request contains source address, content ID and Sequence Number. Router forwards towards closest source with content End to End delivery from Content provider to requester.

Data Transfer and Reliability Message Forward Unicast Content Packet forward Flooding ARQ Scheme End-to-end Selective-repeat

Advantages and Disadvantages Content table becomes too large with increasing number of hosts or content. (Alternative – Storing only the address of the closest Provider for each Content) SR has lower latency than other schemes. Upon Deletion of Content, a transfer packet can be sent to its closest router. This reduces the time taken for the user to receive content from a new host.

Example Scenarios

Scenario get (content_C3) H1 H2 H3 C1 C2 C3 R1R2R3R4 R5 H2 sends request to R5. R5’s content table indicates H3 has the content and uses the forwarding table to forward content to R2 R2’s content table indicates H3 has the content and uses the forwarding table to forward content to R3 The same continues till H3. H3 then uses the source address of the request packet to transmit the content.

H1 H2 H3 C1 C2 C3 R1R2R3R4 R5 Scenario get (content_C2) H2 sends request to R1. R1’s content table indicates H3 and H2 have the content and uses the forwarding table to see H2 is closer and forwards to R2 R2’s content table indicates H3 and H2 have the content and uses the forwarding table to forward content to R5 The same continues till H2. H2 then uses the source address of the request packet to transmit the content.

H1 C3 Scenario get (content_C1) H2H3 H4 C1 C2 C1 R1 R2 R3 R4 R5 This scenario is similar to scenario 2. The request is sent from H1->R1->R2->R3->R4->R5->H2

Thank you