Scribd
Upload
33 views

Computer Network - Topic 9 Dan 10

Computer networks use routing to send network traffic along paths between devices. There are two main types of routing: static routing, where paths are manually configured; and dynamic routing, where routers automatically share information to learn paths. Common routing protocols include link-state protocols like OSPF, which flood connectivity information to all routers, and distance-vector protocols like RIP, which share path information with neighboring routers. Dynamic routing allows for automatic adaptation to network changes.

Uploaded by

Ivan Nanda
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
33 views

Computer Network - Topic 9 Dan 10

Computer networks use routing to send network traffic along paths between devices. There are two main types of routing: static routing, where paths are manually configured; and dynamic routing, where routers automatically share information to learn paths. Common routing protocols include link-state protocols like OSPF, which flood connectivity information to all routers, and distance-vector protocols like RIP, which share path information with neighboring routers. Dynamic routing allows for automatic adaptation to network changes.

Uploaded by

Ivan Nanda
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 43

Computer

Networks
L. Budi Handoko, M.Kom. ([email protected])
Dian Nuswantoro University
Computer Networks
(Network Address Translation)

• NAT is a way to conserve IP addresses

• Hide a number of hosts behind a single IP address

• Needed configuration for host :


• IP Address
• Subnet Mask / Netmask
• Network Address / Broadcast Address
• Gateway Address
Computer Networks
(NAT - Translation Modes)

• Dynamic Translation (IP Masquerading)


large number of internal users share a single external address
• Static Translation
a block external addresses are translated to a same size block of internal addresses
• Load Balancing Translation
a single incoming IP address is distributed across a number of internal servers
• Network Redundancy Translation
multiple internet connections are attached to a NAT Firewall that it chooses and uses based on
bandwidth, congestion and availability.
Computer Networks
(NAT - Topology)
Any Question ?

Anything to discuss ?
Computer Networks
(Terminology)
Computer Networks
(Routing)
How do packets get from A to B in the Internet?

Internet
A B

Routing is (refering to) a process of selecting paths in a network along which to send network traffic.
What is Routing?
IP Routing
Routing Tables
Routing Component
Computer Networks
(Routing Continues)
• Static Routing
It is the type of routing characterized by the absence of communication between routers regarding the current
topology of the network. This is achieved by manually adding routes to the routing table.

• Dynamic Routing (aka. Adaptive Routing)


The capability of a system, through which routes are characterized by their destination, to alter the path that
the route takes through the system in response to a change in conditions. The adaptation is intended to allow
as many routes as possible to remain valid (that is, have destinations that can be reached) in response to the
change.
Static Routing vs Dynamic
Routing Static Dynamic

• Route path are Manually set by administrator • Router exchange routing information Dynamically

• Router dynamically learns the changes


• Any changes should be made by the administrator

• Good for small networks


• Can perform Small to Large (Any network)

• Scalability becomes complex in terms of


• Scalable and configuration is easy. Router dynamically
configuration and maintenance. Because performs
Administrator has to memorize all routes

• Highly secured because only administrator knows


• Less Secured compared to static routing. But works fine
the routing paths
for large network infrastructure

• Consumes more resources (CPU,RAM) because router


• Consumes Less Resources (CPU,RAM) has to work dynamically
Routing algorithm
Routing protocols
Computer Networks
(Routing Protocols)
• A protocol that specifies how routers communicate with each other, disseminating information that
enables them to select routes between any two nodes on a computer network, the choice of the
route being done by routing algorithms.

• 3 major classes in widespread use on IP networks are :


• Interior gateway routing via link-state routing protocols, such as OSPF and IS-IS
• Interior gateway routing via path vector or distance vector protocols, such as RIP, IGRP and EIGRP
• Exterior gateway routing. BGP v4 is the routing protocol used by the public Internet.
Routing metrics
Hop Count
Routing algorithm types
Routing algorithm: static route
Routing algorithm: static technique
Routing algorithm: Dynamic Route
Routing algorithm: dynamic route operation
Routing algorithm: source routing
Dynamic Routing Classification
Computer Networks
(Routing Protocols Illustration)

Exterior routing

Interior routing

Customer routing
Computer Networks
(Link-state Routing Protocol)

• The basic concept is that every node constructs a map of the connectivity to the network, in the
form of a graph, showing which nodes are connected to which other nodes. Each node then
independently calculates the next best logical path from it to every possible destination in the
network. The collection of best paths will then form the node's routing table.

• The algorithm :
• Each link, the connected nodes and the metric is flooded to all routers
• Each link up/down status change is incrementally flooded
• Each router re-computes the routing table in parallel using the common link state database
• next for more details…
Routing algorithm: Link State
Link State Overview
Link State concept
Link State Routing update
Computer Networks
(Distance Vector Routing Protocol)
• Use (also known as) the Bellman-Ford algorithm, Ford–Fulkerson algorithm, or DUAL FSM to
calculate paths.
• Distance means destination
• Flood routing table only to its neighbors
• Require that a router informs its neighbors of topology changes periodically.
• Example : RIP

• The algorithm :
• Each node sends its routing table (destination distance) to all neighbors every 30 seconds
• Lower distances are updated with the neighbor as next hop
• cannot scale
• cannot resolve routing loops quickly
• next for more details…
Distance Vector Algorithm
Distance Vector Routing update
Distance Vector broadcasting
Distance vector: crashed recovery
Count to infinity
Solving count to infinity
Link State vs Distance Vector

Distance Vector routing


protocols usually send their
entire routing table to their
nearest neighbors at regular
intervals

Link State routing protocols


usually send only the
routing changes to every
other router within their
area
Any Question ?

Anything to discuss ?

You might also like