ECE 544 Project3 Team member.

Slides:



Advertisements
Similar presentations
Computer Networking A Top-Down Approach Chapter 4.7.
Advertisements

Project3 Malabika Das Prajna Setty Preeti Rao. Assumptions and Address Scheme Assumptions End hosts can only connect to one router and knows which router.
Routing So how does the network layer do its business?
CS335 Networking & Network Administration Tuesday, April 20, 2010.
ECE 544 Project 3 Content Based Routing Neelakantan Nurani Krishnan Shikha Kakkar Suja Srinivasan.
INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is.
ECE 544 Project3 Kush Patel Siddharth Paradkar Ke Dong.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Link State Routing Protocols Last Update Copyright Kenneth M. Chipps Ph.D.
ECE 544 Project3 Team member. Assumptions and Address Scheme Assumptions End hosts can only connect to routers Same content available at multiple end.
RIP2 (Routing Information Protocol) Team Agile. Routing Protocols Link State – OSPF – ISIS Distance vector – RIP (version 1 and 2) – IGRP (Cisco Proprietary)
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Network Layer Protocols: Unicast and Multicast Routing Protocols 21.1 Unicast Routing 21.2 Unicast Routing.
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.
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:
1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
OSPF Open Shortest Path First. Table of Content  IP Routes  OSPF History  OSPF Design  OSPF Link State  OSPF Routing Table  OSPF Data Packets.
Content Routing Protocol Design Karthikeyan Ganesan Shruti Venkatesh Rafay Zamir.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
Transport Layer3-1 Network Layer Every man dies. Not every man really lives.
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
UNIT 2 LESSON 8 CS PRINCIPLES. UNIT 2 LESSON 8 OBJECTIVES Students will be able to: Describe how routers develop routing tables to determine how to send.
Computer Networks22-1 Network Layer Delivery, Forwarding, and Routing.
Ch 22. Routing Direct and Indirect Delivery.
ECE 544 Project3 Ali Rostami Mohsen Ghassemi Mahmoud Ramezani-Mayiami.
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
TCP/IP (Routing). Content DHCP And Mobile IP Internet Routing Protocol RIP (Routing Information Protocol) OSPF (Open Shortest Path First) BGP (Border.
ECE 544 Protocol Design Project 2016 Chengyao Wen Hua Deng Xiaoyu Duan.
ECE 544 Protocol Design Project 2016 Nirali Shah Thara Philipson Nithin Raju Chandy.
ECE 544 Protocol Design Project 2016 Michael Sherman Murtadha Aldeer Leonard T. Park.
ECE 544 Project3 Parishad Karimi Mehrnaz Tavan Sai Teja Lingam.
+ Dynamic Routing Protocols 2 nd semester
ECE 544 Protocol Design Project 2016 Kiran Jatty Lasya Nandamuri Varun Vinnakota.
Configuration for routing example
Chapter 21 Multicast Routing
ECE 544 Protocol Design Project 2016
Routing Protocols and Concepts
COMP 3270 Computer Networks
Link-State Routing Protocols
What is a router? A router is a device that connects multiple computers together. Not to be confused with a switch Routers transmit packets of data across.
Chapter 5 Network and Transport Layers
THE NETWORK LAYER.
ECE 544 Protocol Design Project 2016
ECE 544 Project3 Team member.
ECE 544 Protocol Design Project 2016
(How the routers’ tables are filled in)
ECE 544 Protocol Design Project 2016
ECE 544 Protocol Design Project 2016
Anup Mathur Anusha Sheelavant Prakhar Srivastava
ECE 544 Protocol Design Project 2016
Vidur Nayyar Xueting Wang Weicong Zhao
Link-State Routing Protocols
ECE 544 Group Project : Routing
ECE 544 Software Project 3: Description and Timeline
ECE 544 Software Project 3: Description and Timeline
ECE 544 Project3 Team member: BIAO LI, BO QU, XIAO ZHANG 1 1.
ECE 544 Protocol Design Project: Description and Timeline
Aayush Patidar Ashwin Ramakrishnan Manoj Juneja
ECE 544 Software Project 3: Description and Timeline
COMPUTER NETWORKS CS610 Lecture-42 Hammad Khalid Khan.
ECE 544 Software Project 3: Description and Timeline
Viet Nguyen Jianqing Liu Yaqin Tang
Christopher Beyer Hajar Mahdavi-Doost Tony Thayil
ECE 544 Project III Description and Timeline March 23, 2018
Chapter 22. Network Layer: Routing
Link-State Routing Protocols
ECE 544 Software Project 3: Description and Timeline
ECE 544 Project3 Dheeraj Medikonda Ravi Chandra Godavarthi 1.
OSPF Protocol.
Presentation transcript:

ECE 544 Project3 Team member

Assumptions and Address Scheme Lossy Environment End nodes can only connect to Routers Etc… Packet Format Router Name and Address scheme End Node

Bootstrapping and Discovery Algorithm Router and End node boot up (Hello packet?) Discovery: Router discover router Router discover end node End node discover router Packet Format

Baseline Routing Algorithm RIP or OSPF or others? Routing Table Construction Routing Table Update (How long?) How to find the shortest way to do multicast routing? Packet Format

Multicast & k-out-of-m Algorithm Exact Algorithm followed by each router Key benefits/demerits of your scheme

Data Transfer and Reliability Message Forward Unicast, Multicast Packet Format of DATA, ACK ARQ Scheme Hop-by-hop or End-by-end Stop-and-wait, Selective-repeat, sliding windows or other schemes

Appendix: Network Architecture Refer to the following 3 networks, what is the best (shortest) way to transmit packet from Source S to Destinations D1, D2, D3 for different values of k

Example Networks: Network 1 Network 2

Example Networks Network 3: A 20 node Internet topology