Routing: Algoritma Routing (Dinamis) :

Ukuran: px

Mulai penontonan dengan halaman:

Download "Routing: Algoritma Routing (Dinamis) :"

Yulia Wibowo
7 tahun lalu
Tontonan:

2 Routing: 1. Routing Default 2. Routing Statis 3. Routing Dinamis Algoritma Routing (Dinamis) : 1. Distance Vector Routing 2. Link State Routing

4 Distance Vector Routing Protocols Contoh Protokol Routing Distance Vector : Routing Information Protocol (RIP) Interior Gateway Routing Protocol (IGRP) Enhanced Interior Gateway Routing Protocol (EIGRP)

5 Distance Vector Routing Protocols Distance Vector Technology The Meaning of Distance Vector: A router using distance vector routing protocols knows 2 things: Distance to final destination Vector, or direction, traffic should be directed

6 Distance Vector Routing Protocols Karakteristik Distance Vector : Update Periodik Tetangga Update Broadcast Seluruh tabel Routing dimasukkan saat update

7 Distance Vector Routing Protocols Routing Protocol Algorithm: (Algoritma adalah Sebuah prosedur untuk memenuhi sebuah kerja tertentu) Tujuan Algoritma Routing: 1. Mengirim dan menerima Update 2. Mengkalkulasi Jalur terbaik 3. Mendeteksi dan bereaksi terhadap perubahan topologi

8 Distance Vector Routing Protocols Routing Protocol Characteristics Kriteria yang digunakan untuk membandingkan protokol routing : -Waktu konvergensi -Skalabilitas -Penggunaan Resources -Implementasi dan maintenance

9 Distance Vector Routing Protocols

10 Network Discovery Router initial start up (Cold Starts) -Initial network discovery Network yang terhubung langsung ditempatkan di tabel routing.

Network Discovery Tukar Menukar tabel informasi pertama kali Jika sebuah protokol routing di konfigurasi, maka akan terjadi saling tukar informasi routing Update Routing diterima

11 Network Discovery Tukar Menukar tabel informasi pertama kali Jika sebuah protokol routing di konfigurasi, maka akan terjadi saling tukar informasi routing Update Routing diterima dari router lainnya -Router melakukan memeriksa informasi update jika ada informasi baru -Jika ada informasi baru: -Metric di update -Informasi baru disimpan ke dalam tabel routing

Network Discovery Tukar Menukar Informasi Routing Konvergensi router tercapai apabila - Seluruh tabel routing pada network tersebut berisi informasi network yang sama.

12 Network Discovery Tukar Menukar Informasi Routing Konvergensi router tercapai apabila - Seluruh tabel routing pada network tersebut berisi informasi network yang sama. Jika belum tercapai, Router akan terus saling bertukar informasi routing -Jika tak ada informasi baru ditemukan maka Convergence (konvergensi ) telah reached (tercapai)

13 Network Discovery Konvergensi harus dicapai sebelum sebuah network dianggap beroperasi lengkap Kecepatan pencapaian konvergensi tergantung dari dua kategori yang saling berhubungan - Kecepatan broadcast informasi routing - Kecepatan dalam mengkalkulasi route

14 Permasalahan pada Distance Vector Konvergensi yang Lambat Skalabilitas yang terbatas Routing Loops

15 Inconsistent Routing Entries Each node maintains the distance from itself to each possible destination network.

16 Inconsistent Routing Entries (Cont.) Slow convergence produces inconsistent routing.

17 Inconsistent Routing Entries (Cont.) Router C concludes that the best path to network is through router B.

18 Inconsistent Routing Entries (Cont.) Router A updates its table to reflect the new but erroneous hop count.

19 Count to Infinity Hop count for network counts to infinity.

20 Defining a Maximum Define a limit on the number of hops to prevent infinite loops.

21 Routing Loops Packets for network bounce (loop) between routers B and C.

22 Routing loops adalah kondisi ketika paket dikirimkan secara terus menerus tanpa mencapai tujuannya. Routing Loops

23 Routing Loops Routing loops may be caused by: -Incorrectly configured static routes -Incorrectly configured route redistribution -Slow convergence -Incorrectly configured discard routes Routing loops can create the following issues -Excess use of bandwidth -CPU resources may be strained -Network convergence is degraded -Routing updates may be lost or not processed in a timely manner

24 Mengatasi Routing Loops Split Horizon Route Poisoning Hold down timer Trigger Update

25 Split Horizon It is never useful to send information about a route back in the direction from which the original information came.

26 Route Poisoning Routers advertise the distance of routes that have gone down to infinity.

27 Poison Reverse Poison reverse overrides split horizon.

28 Holddown Timers The router keeps an entry for the network s possible down state, allowing time for other routers to recompute for this topology change.

29 Triggered Updates The router sends updates when a change in its routing table occurs.

30 Routing Protocols Today Factors used to determine whether to use RIP or EIGRP include -Network size -Compatibility between models of routers -Administrative knowledge

dokumen-dokumen yang mirip

INTERNETWORKING. Dosen Pengampu : Syariful Ikhwan ST., MT. Submitted by Dadiek Pranindito ST, MT,. SEKOLAH TINGGI TEKNOLOGI TELEMATIKA TELKOM LOGO

INTERNETWORKING. Dosen Pengampu : Syariful Ikhwan ST., MT. Submitted by Dadiek Pranindito ST, MT,. SEKOLAH TINGGI TEKNOLOGI TELEMATIKA TELKOM LOGO INTERNETWORKING Dosen Pengampu : Syariful Ikhwan ST., MT. Submitted by Dadiek Pranindito ST, MT,. SEKOLAH TINGGI TEKNOLOGI TELEMATIKA TELKOM LOGO PURWOKERTO Topik Pembahasan Chapter 1 Pendahuluan Dinamic