Tim Dosen Jaringan Komputer 2016

Slides:

Advertisements

Similar presentations

4/12/2015© 2009 Raymond P. Jefferis IIILect Internet Protocol - Continued.

Advertisements

COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.

Routing Protocol.

Courtesy: Nick McKeown, Stanford

TDC365 Spring 2001John Kristoff - DePaul University1 Interconnection Technologies Routing I.

Routing So how does the network layer do its business?

RD-CSY3021 Comparing Routing Protocols. RD-CSY3021 Criteria used to compare routing protocols includes  Time to convergence  Proprietary/open standards.

Summary The Problem The Dijkstra’s Shortest Path Algorithm

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.

Chapter 4 Network Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 13.

RFC 2453 RIP 2 (Routing Information Protocol) Daher Kaiss.

CSE 461: Distance Vector Routing. Next Topic  Focus  How do we calculate routes for packets?  Routing is a network layer function  Routing Algorithms.

ROUTING PROTOCOL IGRP. REVIEW 4 Purpose of Router –determine best path to destination –pass the frames to the destination 4 Protocols –routed - used by.

INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is.

Introduction to Routing and Routing Protocols By Ashar Anwar.

1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)

Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.

1 13-Sep-15 S Ward Abingdon and Witney College Routing loops And other problems CCNA 2 Chapter 4.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 14 Routing Protocols RIP, OSPF, BGP.

Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.

CCNA Guide to Cisco Networking Chapter 8: Routing Protocols and Network Address Translation.

1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 7 Distance Vector Routing Protocols.

Network Layer r Introduction r Datagram networks r IP: Internet Protocol m Datagram format m IPv4 addressing m ICMP r What’s inside a router r Routing.

Routing and Routing Protocols Routing Protocols Overview.

1 Computer Networking Dr. Mohammad Alhihi Communication and Electronic Engineering Department Philadelphia University Faculty of Engineering.

1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.

RIP2 (Routing Information Protocol) Team Agile. Routing Protocols Link State – OSPF – ISIS Distance vector – RIP (version 1 and 2) – IGRP (Cisco Proprietary)

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.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 13 Routing Protocols (RIP, OSPF, BGP)

1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.

Lecture 17 November 8Intra-domain routing November 13Internet routing 1 November 15Internet routing 2 November 20End-to-end protocols 1 November 22End-to-end.

Networking and internetworking devices. Repeater.

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.

Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.

Computer Networks22-1 Network Layer Delivery, Forwarding, and Routing.

Ch 22. Routing Direct and Indirect Delivery.

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.

CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.

Computer Networks 0110-IP Gergely Windisch

CSE 421 Computer Networks. Network Layer 4-2 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside.

Routing algorithms. D(v): the cost from the source node to destination that has currently the least cost. p(v): previous node along current least.

Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.

TRANSPORT LAYER BY, Parthasarathy.g.

Centralized vs Distributed Routing

Link State Routing protocol

Networking CS 3470, Section 1 Sarah Diesburg

Routing BY, P.B.SHANMATHI.

COMP 3270 Computer Networks

Chapter 5 The Network Layer.

Network Layer Introduction Datagram networks IP: Internet Protocol

Intra-Domain Routing Jacob Strauss September 14, 2006.

Routing: Distance Vector Algorithm

Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.

Routing Protocols (RIP, OSPF, BGP).

Intradomain Routing Outline Introduction to Routing

RFC 1058 & RFC 2453 Routing Information Protocol

Networking CS 3470 Sarah Diesburg

CCNA2 chap4 routing loops.ppt And other problems CCNA 2 Chapter 4

Chapter 22. Network Layer: Routing

Communication Networks

Advanced Computer Networks

ECE 544 Project3 Team member.

EE 122: Intra-domain routing: Distance Vector

Communication Networks

Chapter 4: Network Layer

Networking CS 3470 Sarah Diesburg

Chapter 4: Network Layer

CCNA 2 JEOPARDY Module 6.

Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.

Presentation transcript:

Tim Dosen Jaringan Komputer 2016 Routing Tim Dosen Jaringan Komputer 2016

Background

Routing Vs Forwarding

Example

Routing Protocol

Protocol

Definition

Break 5-10 Menit

Ditance Vector

Distane Vector Example

Next ..

Explain abaout network convergencies

Link Failure ? When link failure happen.

Routers Goal ? Routing basic goal …

Count to Infinity Problem ~ Explain about Split Horizon

Routing Information Protocol (RIP)

RIP Cont’d

Break 5-10 Menit

Link State

Reliable Flooding

Route Calculation

Forward Search algorithm

Forward Search Algorithm

Open Shortest Path First

Definition

Homework Write resume about Mobile IP IPv6 Format Address Header IPV6 Multicast Tugas dibuat perkelompok, untuk di presentasikan minggu depan di depan kelas. Slide dikumpulkan via Classroom maksimal 1 Hari sebelm jadwal kuliah selanjutnya..