ECE 544 Project3 Parishad Karimi Mehrnaz Tavan Sai Teja Lingam.

Slides:



Advertisements
Similar presentations
Project3 Malabika Das Prajna Setty Preeti Rao. Assumptions and Address Scheme Assumptions End hosts can only connect to one router and knows which router.
Advertisements

CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
CSCE 515: Computer Network Programming Chin-Tser Huang University of South Carolina.
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
ECE 544 Project 3 Content Based Routing Neelakantan Nurani Krishnan Shikha Kakkar Suja Srinivasan.
Ad Hoc Wireless Routing COS 461: Computer Networks
ICMP (Internet Control Message Protocol) Computer Networks By: Saeedeh Zahmatkesh spring.
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.
Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.
1 IP Forwarding Relates to Lab 3. Covers the principles of end-to-end datagram delivery in IP networks.
ECE 544 Project3 Team member. Assumptions and Address Scheme Assumptions End hosts can only connect to routers Same content available at multiple end.
TCP/IP Illustracted Vol1. 제목 : IP Routing ( 수 ) 한 민 규
© Jörg Liebeherr (modified by M. Veeraraghavan) 1 ICMP: A helper protocol to IP The Internet Control Message Protocol (ICMP) is the protocol used for error.
ECE 544 Project3 Amith V.S Pavan Kulkarni Suneet Dixit.
1 Routing Table  The seven fields Mask: for finding (sub)network address of the destination l Host-specific routing: (/32) l Default routing:
Enhanced Interior Gateway Routing Protocol EIGRP 1.
AODV: Introduction Reference: C. E. Perkins, E. M. Royer, and S. R. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, draft-ietf-manet-aodv-08.txt,
Understanding IPv6 Slide: 1 Lesson 12 IPv6 Mobility.
Networking and internetworking devices. Repeater.
Internet Control Message Protocol (ICMP) Chapter 7.
Routing protocols. Static Routing Routes to destinations are set up manually Route may be up or down but static routes will remain in the routing tables.
TCP/IP Illustracted Vol1. 제목 : IP Routing ( 수 ) 한 민 규
Content Routing Protocol Design Karthikeyan Ganesan Shruti Venkatesh Rafay Zamir.
Ad-hoc On Demand Distance Vector Protocol Hassan Gobjuka.
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
Remote Deployment of Sensor Networks Presentation 3: Providing connectivity between sensor nodes and uplinks.
RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
ECE 544 Project3 Ali Rostami Mohsen Ghassemi Mahmoud Ramezani-Mayiami.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
4: Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
ECE 544 Protocol Design Project 2016 Kiran Jatty Lasya Nandamuri Varun Vinnakota.
Configuration for routing example
Dynamic Routing Protocols II OSPF
Dynamic Routing Protocols part2
Chapter 19 Network Layer Protocols
21-2 ICMP(Internet control message protocol)
ECE 544 Protocol Design Project 2016
Routing Protocols and Concepts
Link-State Routing Protocols
Rip Routing Protocol.
Routing.
ECE 544 Protocol Design Project 2016
ECE 544 Project3 Team member.
ECE 544 Protocol Design Project 2016
Dynamic Routing Protocols part2
Mobile and Wireless Networking
ECE 544 Protocol Design Project 2016
ECE 544 Protocol Design Project 2016
by Saltanat Mashirova & Afshin Mahini
Anup Mathur Anusha Sheelavant Prakhar Srivastava
UNICAST ROUTING PROTOCOLS
Vidur Nayyar Xueting Wang Weicong Zhao
Link-State Routing Protocols
Intradomain Routing Outline Introduction to 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.
An Enhanced Mobility Management Approach for Wireless IP Networks
Chapter 24 Mobile IP.
Routing.
Internet Control Message Protocol
Routing protocols in Mobile Ad Hoc Network
ECE 544 Project3 Dheeraj Medikonda Ravi Chandra Godavarthi 1.
Chapter 5: Link Layer 5.1 Introduction and services
Presentation transcript:

ECE 544 Project3 Parishad Karimi Mehrnaz Tavan Sai Teja Lingam

Assumptions Each host is aware of the unique file ID to associate with each content file Each host/router knows the addresses of its immediate neighbors The distance between adjacent nodes is 1 There are no router failures

Address Scheme Naming scheme and eventual address scheme End hosts flat naming 0,1,…,255 Content ID’s are C0,C1,…, C255

Packet sizes and Formats Payload Source AddressMessage Type TTL HLenPcktLength Options( Destination Address, flags)

Bootstrapping and Discovery Algorithm Hosts subscribe to network by sending a subscription packet containing HostID and the ContentID’s of their content to its neighboring router Routers broadcast (HostID, ContentID) to all the other routers  content table updated at each router  hop by hop ARQ scheme Routers run distance vector algorithm  routing tables created

Baseline Algorithm Content routing algorithm Insertion or deletion of files: the host will inform the neighboring router about the update Neighboring router updates its content table and broadcasts the update to all the routers. Host disconnecting from network: Hosts send “I am Alive” message periodically to neighboring routers. If “I am Alive” advertisement times out, the neighboring router deletes the hosts table contents and distance vector algorithm is rerun

Data Transfer and Reliability Host requesting a content Each router looks up the content ID in its tables to figure out next hop until destination is reached. The destination sends the content back to the source address provided in the message header Content requests time out and Hosts send a request repeatedly, until either the content or an “unable to access” packet is received. End to end ARQ scheme

Types of messages: A Subscription message by a newly joined Host, containing its address and content IDs Host’s own Content IDs Host IDSubscription TTL HLenPcktLength Options

Types of messages: A Query message from an existing host that contains the ID of the content it requests and its address Content ID Content Requester ID Query TTL HLenPcktLength(fixed) Options

Types of messages: A Reply to a Query if the file exists in any of the hosts File content File owner IDReply TTL HLenPcktLength Options (content requester address)

Types of messages: An Update message generated by Host when a new content is added or content is removed. Content ID File owner IDUpdate TTL HLenPcktLength Options (flags for insertion or deletion)

Other messages: An arbitrarily timed “I’m Alive” Advertisement containing the host ID If the router cannot get access to the content (due to deletion in all the hosts, etc.) an “Unable to access the file “ msg to be sent. Update messages between routers for creating and updating their content and routing tables.

Appendix: Network Architecture H1 H2 H3 C1 C2 C3 R1R2R3R4 R5 Scenario get (content_C3) Host ID’sDistanceContent ID’sNext Hop H12C1R1 H22-R5 H33C3,C2R4 Routing Table for Router R2

Appendix: Network Architecture H1 H2 H3 C1 C2 C3 R1R2R3R4 R5 Scenario get (content_C2) Host ID’sDistanceContent ID’sNext Hop H12C1R1 H22C2,C3R5 H33C3,C2R3 Routing Table for Router R2

Appendix: Network Architecture H1 C3 Scenario get (content_C1) H2H3 H4 C1 C2 C1

Thank you! Questions?