chapter 5 network layer part 1
DESCRIPTION
Chapter 5 Network Layer Part 1. Topics: Network layer design issues Routing Algorithm. 1. Network Layer Design Isues. Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation of Connection-Oriented Service - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/1.jpg)
Topics:
-Network layer design issues
-Routing Algorithm
Chapter 5
Network Layer Part 1
![Page 2: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/2.jpg)
1. Network Layer Design Isues
Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation of Connection-Oriented Service Comparison of Virtual-Circuit and Datagram Subnets
![Page 3: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/3.jpg)
Store-and-Forward Packet Switching
The environment of the network layer protocols.
fig 5-1
![Page 4: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/4.jpg)
Service Provided to Transport Layer• The network layer provides services to the transport layer at the
network layer/transport layer interface• The network layer services have been designed with the
following goals :1.The services should be independent of the router technology.2.The transport layer should be shielded from the number, type, and
topology of the routers present.3.The network addresses made available to the transport layer should use
a uniform numbering plan, even across LANs and WANs.• Thus, the designers of the network layer have a lot of freedom in
writing detailed specifications of the services to be offered to the transport layer
![Page 5: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/5.jpg)
Implementation of Connectionless Service
The algorithm that manages the tables and makes the routing decisions is called the routing algorithm
![Page 6: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/6.jpg)
Implementation of Connection-Oriented Service
Routing within a virtual-circuit subnet.
![Page 7: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/7.jpg)
Comparison of Virtual-Circuit and Datagram Subnets
5-4
![Page 8: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/8.jpg)
2. Routing Algorithms
• The Optimality Principle• Static Routing
Shortest Path Routing Flooding
• Dynamic Routing Distance Vector Routing Link State Routing
• Hierarchical Routing• Broadcast Routing• Multicast Routing• Routing for Mobile Hosts• Routing in Ad Hoc Networks
![Page 9: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/9.jpg)
Routing Algorithms
It is sometimes useful to make a distinction between :
• routing, which is making the decision which routes to use, and
• forwarding, which is what happens when a packet arrives.
![Page 10: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/10.jpg)
Routing Algorithms
Routing algorithms can be grouped into two major classes:
a)a) NNonon--adaptive adaptive (static)(static)
b)b) AdaptiveAdaptive (dynamic) (dynamic)
In the following sections we will discuss a variety of routing algorithms, both static and dynamic.
![Page 11: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/11.jpg)
The Optimality Principle
(a) A subnet. (b) A sink tree for router B.
Tujuan dari semua algoritma routing adalah untuk menemukan dan menggunakan sink tree bagi seluruh router
• If router J is on the optimal path from router I to router K, then the optimal path from J to K also falls along the same route
• Since a sink tree is indeed a tree, it does not contain any loops, so each packet will be delivered within a finite and bounded number of hops
![Page 12: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/12.jpg)
Static Routing
1. Shortest Path Routing
2. Flooding
![Page 13: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/13.jpg)
1. Shortest Path Routing
The first 5 steps used in computing the shortest path from A to D. The arrows indicate the working node.
![Page 14: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/14.jpg)
Dijkstra’s Algorithm
Dijkstra's algorithm to compute the shortest path through a graph.
5-8 top
![Page 15: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/15.jpg)
Dijkstra’s Algorithm (2)
Dijkstra's algorithm to compute the shortest path through a graph.
5-8 bottom
![Page 16: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/16.jpg)
2. Flooding
Setiap paket yang masuk dikirimkan melalui saluran keluar kecuali saluran tempat paket tersebut datang.
Problems vs Solution
• Age Hop counter
• More flood Sequence number
• Duplication Limit the sequence number, by augmenting with a counter
Distributed database applications, wireless networks, a metric against which other routing algorithms can be compared
![Page 17: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/17.jpg)
Dynamic routing
1. Distance Vector Routing
2. Link State Routing
![Page 18: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/18.jpg)
1. Distance Vector Routing
(a) A subnet. (b) Input from A, I, H, K, and the new routing table for J.
Setiap router menjaga sebuah tabel routing yang di indeks oleh masing2 router pada subnet dan berisi sebuah entry bagi setiap router di dalam subnet.
Entry ini berisi :-Saluran keluar untuk mencapai tujuan-Estimasi waktu atau jarak ke tujuan itu
![Page 19: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/19.jpg)
Distance Vector Routing (2)
The count-to-infinity problem.
Routing bereaksi cepat untuk berita baikRouting bereaksi sgt lambat utk berita buruk
Solusi: menetapkan nilai tertinggi
![Page 20: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/20.jpg)
2. Link State Routing
Pengembangan kapasitas saluran yg berbeda mengharuskan untuk memperhitungkan bandwidth sbg parameter. Solusinya : link state routing
Each router must do the following:
1.Discover its neighbors, learn their network address.
2.Measure the delay or cost to each of its neighbors.
3.Construct a packet telling all it has just learned.
4.Send this packet to all other routers.
5.Compute the shortest path to every other router.
![Page 21: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/21.jpg)
1-Learning about the Neighbors
(a) Nine routers and a LAN. (b) A graph model of (a).
- Ketika router di boot !- Paket “hello” via P2P-Nama router harus unik
![Page 22: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/22.jpg)
2-Measuring Line Cost
A subnet in which the East and West parts are connected by two lines.
Lintasan yg tdk berbeban sbg rute --> unjuk kerja meningkat
Memperhitungkan delay?
Routing berosilasi scr tdk teratur, routing mjd tdk menentu
![Page 23: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/23.jpg)
3-Building Link State Packets
(a) A subnet. (b) The link state packets for this subnet.
Kapan membuatnya?
![Page 24: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/24.jpg)
4-Distributing the Link State Packets
The packet buffer for router B in the previous slide (Fig. 5-13).
Tumpang tindih?
32 bit !
-Router tabrakan/ duplikat-Nmr urut rusak
![Page 25: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/25.jpg)
5-Computing the New Routes
Router membuat graf subnet keseluruhan Algoritma dijkstra dpt dioperasikan scr lokal utk
menentukan lintasan terpendek. Memori yg dibutuhkan sebanding dengan kn, dg n= jumlah
router, dan k= jumlah tetangga tiap router Bila subnet sangat besar? Memori?
![Page 26: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/26.jpg)
Hierarchical Routing
Hierarchical routing.
Tabel routing bertambah:-Konsumsi memori router-Waktu penulusuran
720 Router = Berapa entry?- Tanpa hirarki- 24 wilayah @ 30 router- 8 cluster@ 9 wilyh @10 rou
![Page 27: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/27.jpg)
Broadcast Routing
Reverse path forwarding. (a) A subnet. (b) a Sink tree. (c) The tree built by reverse path forwarding.
![Page 28: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/28.jpg)
Multicast Routing
(a) A network. (b) A spanning tree for the leftmost router. (c) A multicast tree for group 1. (d) A multicast tree for group 2.
![Page 29: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/29.jpg)
Routing for Mobile Hosts
A WAN to which LANs, MANs, and wireless cells are attached.
![Page 30: Chapter 5 Network Layer Part 1](https://reader035.vdocument.in/reader035/viewer/2022081511/56813e5c550346895da85be4/html5/thumbnails/30.jpg)
Routing for Mobile Hosts (2)
Packet routing for mobile users.