Beruflich Dokumente
Kultur Dokumente
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 1 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 2
Notation of a network
Contents
l Roles of a data link layer and a network layer
l Differences among hubs, switches, and
routers
l Static routing and dynamic routing
l The operating principles of dynamic routing
l backup and balancing using dynamic routing
H R H
l Network design
l A hub or a switch is described, using a single line.
l Address allocation policies
l A host is described as H, and a router is described as R.
l In the explanation, Layer 3 switches are not discriminated
from routers.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 3 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 4
OSIlayer
Layer 2 :Data link layer
Layer 3 :Network layer
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 5 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 6
1
IP datagram which flows on Ethernet Connected network
l A and B are directly connected to the same network.
– Possesses the correspondence table of MAC address and IP
C D address by ARP (address resolution protocol), etc.
To C ↓
Ethernet
To A l This is called “connected.”
↓
A B
l No needs to set up routing. Communications can be
Recipient Sender
achieved when a hub and the like are connected.
A’s MAC address B’s MAC address FCS Data link frame
Header Data Frame Check Sequence
A connected B
Sender Recipient
B’s IP address A’s IP address IP datagram Network X
Header Data
Not connected R
Network Y
C D
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 7 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 8
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 9 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 10
[訳注:1]
A B A B
network Y
Network X Network X
Uncommunicable R Communicable R
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 11 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 12
2
The status of the data link frame Summary of the network terminology
MAC address IP address l Destination, or Recipient Address
– Means a destination. In a network, it is literally handled as the
A E-Dest E-S r c IP -S r c IP -Dest
destination address, or the recipient address. “Destination” is
XA IA frequently used as what it is, without being translated into
XR XA IA IC Data FCS Japanese. In the case of routing, “Destination” refers to the
XR IR0 network information which includes mask information as well as
address.
R
YR IR1 YC YR IA IC Data FCS l NEXT HOP, and NEXT HOP Address
YC IC – The next address to which packets are forwarded. When a
router or a host is neither “Destination”, nor “Connected”, the next
C IP datagram address to send a packet (NEXT HOP) is referred in order to
send the IP packet. The router or the host which receives the IP
Ethernet data link frame packet forwards it to its next address (NEXT HOP). This is
repeated to reach the “Destination.”
l The recipient and sender of the IP datagram never l Routing, Routing information
– Means a route. Destination and NEXT HOP are paired.
change on the way.
l Routing Table
l The data link frame changes whenever it passes a router. – List of routings that a router and/or a host possesses
l The ”data link frame recipient ” does not always mean the l Route
"IP datagram recipient. " – The Status where a router normally sends out an IP packet,
following the routing table. “This router routes correctly. ” "
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 13 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 14
The status of the data link frame Summary of the network terminology
MAC address IP address l Destination, or Recipient Address
– Means a destination. In a network, it is literally handled as the
A E-Dest E-S r c IP -S r c IP -Dest
destination address, or the recipient address. “Destination” is
XA IA frequently used as what it is, without being translated into
XR XA IA IC data FCS Japanese. In the case of routing, “Destination” refers to the
XR IR0 network information which includes mask information as well as
address.
R
YR IR1 YC YR IA IC data FCS l NEXT HOP, and NEXT HOP Address
YC IC – The next address to which packets are forwarded. When a router
or a host is neither “Destination”, nor “Connected”, the next
C IP datagram address to send a packet (NEXT HOP) is referred in order to send
the IP packet. The router or the host which receives the IP packet
Ethernet data link frame forwards it to its next address (NEXT HOP). This is repeated to
reach the “Destination.”
l The recipient and sender of the IP datagram never l Routing, Routing information
change on the way. – Means a route. Destination and NEXT HOP are paired.
l The data link frame changes whenever it passes a router. l Routing Table
– List of routings that a router and/or a host possesses
l The ”data link frame recipient ” does not always mean the
"IP datagram recipient. " l Route
– The Status where a router normally sends out an IP packet,
following the routing table. “This router routes correctly. ” "
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 15 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 16
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 17 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 18
3
Differences between hubs and Effective use of switches
switches -1
Constructed using a hub Server
A B 100BaseTX
Switch
Hub
To A
8 ports x 10BaseT
A B H
C D
l Mainly effective for the traffic between a server and
l All the ports are continuously connected to the hub. a host.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 19 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 20
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 21 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 22
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 23 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 24
4
Fault tolerance of switches -1 Fault tolerance of switches -2
Server C Server C
Network A Network C Network A Network C
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 25 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 26
Server C Server C
Network A Network C Network A Network C
The network B only can’t
Only B can’t communicate communicate with the server
R R
with the server
Network B Network B
A B ←The identical IP A B ←The identical IP
address with the server address with the router
l When routers are used, the wrong setting at one l When routers are used, even in the worst scenario,
client doesn’t cause a network-wide problem. the impact made by the wrong setting at one client
remains within the segment.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 27 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 28
Broadcast packet has the impact The router doesn’ t pass the broadcast
Switch R
on all ports connected with switches packet to other networks
Broadcast Broadcast
A B A B
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 29 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 30
5
Switches VS Router Connection to the Internet
default WWW Server, etc.
l Advantages of switches Internet
Server
– No needs to consider routing.
Routing by ISP
– When compared to hubs, a more efficient network can Communicable
be constructed. Routing by ISP
default l Default means
l Advantages of routers
R – Terminology in computer and internet
– Backup can be constructed using dynamic routing industries.
protocol. – The route which is selected when no specific
– No broadcast flood arises. routes are selected.
– Scalable even when the network size grows. default – Different from the financial term of “default.”
– Can minimize the damage inflicted by a fault. A
– Relatively easy switching operation when a fault occurs. l By directing the default route to the router
which is connected with the Internet,
l Conclusions communications with servers on the Internet
– Divide the network into subnets by routers, and can be achieved.
introduce switches to the ports on which traffic
concentrates on. l Routing is indispensable for the connection
with the Internet
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 31 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 32
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 33 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 34
6
Backup between Tokyo and Osaka
Reasons to choose dynamic routing -2
Internet Internet
lCan automatically select the optimized route.
– Complicated network topology out of control. Tokyo Osaka
Leased line
lCan automatically select the backup route. R R R R
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 37 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 38
PC PC … PC PC …
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 39 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 40
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 41 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 42
7
RIP2 OSPF--1
OSPF
l Routing Information Protocol Version 2
l Open shortest path first
l RFC 2453
l RFC 2328
l Can propagate netmask
– can be used for VLSM l Protocol 89
l Vector-distance routing – Neither TCP (protocol 6) nor UDP
(protocol 17)
l Compatible with RIP, and can be used
concurrently l Can propagate net mask
– Can be used for VLSM
l Can use multicast
– To reduce the burdens of a host
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 43 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 44
OSPF--2
OSPF BGP4--1
BGP4
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 45 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 46
BGP4--2
BGP4 What is dynamic routing?
l Understand RIP
– When RIP is understood, it is easy to
l Propagates using only the understand the concepts of OSPF and
optimized route when more than BGP 4.
two routes exist
l In the fields, RIP is still used in
l Doesn’t implement load -balancing some cases
– Because the routers for which OSPF
l Update protocol can not be applied still exist
– Because RIP is sufficient enough
l Can aggregate, and supports when only default is sent.
Classless Inter-Domain Routing
(CIDR) l What is OSPF?
– Will be explained based on RIP.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 47 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 48
8
RIP operating principles -1 The distance increments by one
whenever data pass a router
Vector-distance routing
(vector-distance /Bellman-Ford) RIP RIP
192.168.1.0
R R R
Vector=destination (network ) Dest=192.168.1.0 Dest=192.168.1.0 Dest=192.168.1.0
Distance=HOP count (the number of routers that Dist= 0 Dist= 1 Dist= 2
the data pass)
Dest=Destination
Dist= Distance
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 49 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 50
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 53 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 54
9
RIP propagation Routing information after RIP propagation
Internet
Internet
192.168.2.0 192.168.2.0
192.168.3.0 192.168.3.0
192.168.4.0 R1 192.168.4.0 R1
default default default default
192.168.1.0/24 192.168.1.0/24
192.168.4.0 192.168.4.0
192.168.1.0 192.168.1.0
R4 R2 192.168.4.0 R4 R2 192.168.4.0
192.168.2.0 default default
192.168.4.0/24 192.168.4.0/24 192.168.2.0
192.168.3.0 192.168.2.0/24 192.168.2.0/24
192.168.3.0
192.168.3.0 R3 R3
192.168.3.0
192.168.3.0/24 192.168.3.0/24
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 55 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 56
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 57 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 58
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 59 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 60
10
To use subnet mask by To use To use subnet mask by RIP -2
subnet mask by RIP -1
l Apply the net mask which is set up in the interface.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 61 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 62
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 63 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 64
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 65 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 66
11
Backup using RIP - Route propagation (under
Trouble shooting - RIP doesn't propagate -2 normal conditions)
A-Dist: 1Network A A-Dist: 2 Network B
B-Dist: 2 B-Dist: 1Network B
Main circuit A-Dist: 3
l The broadcast address is filtered Network A R R B-Dist: 0
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 67 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 68
Backup using RIP - Routing table (under normal Backup using RIP - Traffic flows (under normal
conditions) conditions)
Network A Network B Network B
Main circuit Main circuit
Network A R R Network B R R
R R
Network B Network A
R Network B R
Network B
Network A
Network A
Sub circuit Sub circuit
Network A R R R R R R
Network A Network A
Network B Network B
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 69 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 70
Backup using RIP: Route propagation (when a Backup using RIP: Routing table (when a failure
failure occurs) occurs)
Failure
A-Dist: 1 A-Dist: 5 Network B Failure Network B
B-Dist: 4 B-Dist: 1
NetworkA-Dist:
B 4
Network A R R B-Dist: 0 Network A R R Network B
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 71 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 72
12
Backup using RIP - Traffic flows (when a failure occurs) What is OSPF? -1
Failure Network B
l Policies for this explanation
R R
R
– General applications will be explained to
R those who don’t know OSPF.
– Some may differ from the strict definitions
Sub circuit
R R R about OSPF defined by RFC, however, that
Network A is to give better and easy-to-understand
pictures to you. Your understanding is
greatly appreciated.
l As a failure occurs on the main – For a large -scale network, the association
circuit, the traffic flow with BGP is indispensable, but, it is not
changes. explained this time.
l The sub circuit is used as
backup to maintain
communications.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 73 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 74
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 75 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 76
Simple way to calculate OSPF cost -1 Simple way to calculate OSPF cost -2
Cost to Network A Cost to Network A Cost to Network A Cost to Network B Cost to Network B Cost to Network B
0 76 86 86 20 0
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 77 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 78
13
Simple way to calculate OSPF cost -3 In order to implement backup and
Network A: 0 Network A: 76 Network A: 86
Network B: 86 Network B: 20 Network B: 0 balancing
Network A
Network A,B Network A,B
Network B l OSPF can afford backup and balancing
Circuit
H1 R1 R2 R3 H2 when it has multiple routes.
Cost is set up l When routes have different costs
at each I/F
Cost: 10 Cost: 66 Cost: 66 Cost: 10 Cost: 10 Cost: 10 – The route with smaller costs can be used as
a main route, and the the one with greater
l By assigning the same cost to the same I/F, the costs costs can be used as backup.
for outgoing and return can be identical.
l Different costs can be separately assigned for l When routes have the same costs
outgoing and return, but this will make the control
complicated. Therefore, it should not be implemented – By balancing, the traffic can be dispersed.
without some particular reasons. – Even if one of the route for which balancing
l The figure here may give you the impression that is implemented, remaining routes can be
routes are exchanged, but, practically, the route is serve as backups.
determined by exchanging topology database.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 79 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 80
Backup using OSPF -Route propagation (under normal Backup using OSPF -Traffic flows (under normal
conditions) Main circuit conditions) Main circuit
Cost: 10 A-Cost(R1): 20 Cost: 10 A-Cost(R1): 20
A-Cost(R2): 86 A-Cost(R2): 86
Cost: 10 B-Cost(R3): 86 B-Cost(R4): 20 Cost: 10 B-Cost(R3): 86 B-Cost(R4): 20
B-Cost(R4): 0 B-Cost(R4): 0
A-Cost(R1): 0 R2 R3 A-Cost(R3): 96 A-Cost(R1): 0 R2 R3 A-Cost(R3): 96
A-Cost(R6):163 Network Cost: 66
B-Cost(R2): 96 Cost: 66 B-Cost(R2): 96 A-Cost(R6): 163 Network
B-Cost(R5): 163 B B-Cost(R5): 163 B
R5 R6 R5 R6
Network A Cost: 133 Cost: 10 Network A Cost: 133 Cost: 10
A-Cost(R1): 20 A-Cost(R3): 96 Cost: 10 A-Cost(R1): 20 A-Cost(R3): 96 Cost: 10
B-Cost(R2): 96 A-Cost(R5):153 B-Cost(R2): 96 A-Cost(R5):153
B-Cost(R6):153 B-Cost(R4): 20 B-Cost(R6):153 B-Cost(R4): 20
Route which is Traffic to Network A
Sub circuit not selected Sub circuit
l Using OSPF, only the main circuit Cost value l As OSPF HELLO packets flow in the Traffic to Network B
is used under normal conditions. Router name of sub circuit as well, it is impossible to
the propagation make its traffic zero.
l When a failure occurs, the sub source
circuit is used as backup. (NEXT HOP)
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 81 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 82
R1 R4 R1 R4
R5 R6 R5 R6
Network A Cost: 133 Cost: 10 Network A Cost: 10
A-Cost(R1): 20 A-Cost(R5):153 Cost: 10 A-Cost(R1): 20 Cost: 133 A-Cost(R5):153 Cost: 10
B-Cost(R6):153 B-Cost(R4): 20 B-Cost(R6):153 B-Cost(R4): 20
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 83 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 84
14
Characteristics of OSPF backup routing Backup using OSPF -Traffic flows (when a failure occurs)
Main circuit
Cost: 10 A-Cost(R1): 20 A-Cost(R6): 163
l Different from RIP, quick backup can be Cost: 10 B-Cost(R6): 163 B-Cost(R4): 20
R2 R3
accomplished. A-Cost(R1): 0
B-Cost(R5):163 Cost: 66 B-Cost(R4): 0 Network
B
A-Cost(R6):163
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 85 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 86
R2 R3 B-Cost(R4): 0 Network
accomplished. A-Cost(R1): 0
B-Cost(R2):96 Cost: 66 A-Cost(R3):96
B
B-Cost(R5):96 A-Cost(R6):96
l The sub circuit can't be cut off because R1 Adjust to the same cost R4
OSPF HELLO packets flow in the backup
lines as well. R5 Cost: 66
R6
Network A Cost: 10
– It needs other measures than OSPF A-Cost(R1):20 A-Cost(R3):96 Cost: 10
B-Cost(R2):96 A-Cost(R5):86
configuration to backup with ISDN. B-Cost(R6):86 B-Cost(R4):20
Route which is
l Set up the two lines at the same costs. not selected
l Two lines can be used for different Cost value
purposes, and when a failure occurs, the l From R1 to Network B, the costs of Router name of
both R2 and R5 should be the same. the propagation
remaining line can be used as backup for source
l From R4 to Network A, the costs of (NEXT HOP)
the faulty line. both R3 and R6 should be the same.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 87 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 88
R5 R6 R5 R6
Network A Cost: 66 Cost: 10 Network A Cost: 66 Cost: 10
A-Cost(R1):20 A-Cost(R5):86 Cost: 10 A-Cost(R1):20 A-Cost(R3):96 Cost: 10
B-Cost(R6):86 B-Cost(R4):20 B-Cost(R2):96 A-Cost(R5):86
B-Cost(R6):86 B-Cost(R4):20
Traffic to Network A
Cost value
l Due to a failure, the network l Using OSPF, respective lines can
information between R2 and R3 is Router name of be balanced to use under normal Traffic to Network B
deleted. the propagation conditions.
source
(NEXT HOP)
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 89 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 90
15
Backup and balancing using OSPF - Traffic flows (when a
failure occurs) Characteristics of backup and
Cost: 10 A-Cost(R1):20
B-Cost(R5):96
A-Cost(R6):96
B-Cost(R4):20
balancing
Cost: 10
A-Cost(R1): 0 R2 Cost: 66
R3 B-Cost(R4): 0 Network l When a failure occurs, 50% of the bandwidth is
B-Cost(R5):96 A-Cost(R6):96
B used for backup.
R1 R4 l Balancing is basically achieved by the ratio of
1 to 1, therefore, it is difficult to balance the
R5 R6 lines whose speeds are different.
Network A Cost: 66 Cost: 10
A-Cost(R1):20 A-Cost(R5):86 Cost: 10
B-Cost(R6):86 B-Cost(R4):20 l Two lines are effectively used to reduce line
costs.
Traffic to Network A
l The line which doesn ’t have the l When they are applied for a LAN, 100Mbps
failure is used to backup. Traffic to Network B media can be used as 200Mbps media.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 91 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 92
– Always set a default route by “static”, and n Don’t mix External Type 1 and External Type 2
then inject default route by OSPF. —Besides OSPF costs, External Type 1 has priority over External Type 2.
Therefore, switching at the time of a failure will become diffic ult.
n If it affords, use External Type 1.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 93 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 94
– Better to start up with a router with higher l When Multicast is not supported
performance and smaller load. – Some OS can ’t handle multicast.
n OSPF gives the priority to DR (Designated Router), BDR In this case, use broadcast as substitute.
(Backup DR), or DROTHER, or the start-up order. In the
case of multimedia communications such as Ethernet,
DR controls information. For those reasons, it better to
start up with a router with higher performance to control
information.
n In many small-sized networks, it is not necessary to
concern.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 95 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 96
16
Conclusions of dynamic routing Fault-resistant network configuration
Fault-
using dynamic routing protocol
l Considering VLSM, the introduction of RIP
2 and/or OSPF is desired. l Backup and balancing using the dual
structure + OSPF
l For a simple network configuration,
choose static. l Backup by ring topology
l When only default routes are used, RIP is
sufficient enough. l ATM failure detection
l To implement balancing and others, use
OSPF.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 97 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 98
Backup and balancing using the dual structure + Backup and balancing using the dual structure +
OSPF - Connection diagram ‐Route propagation (under normal conditions)
OSPF‐
OSPF
Network A
Network X switch
Network A
Network A
R R R
R Network X R
Network A
Switch Network A Network Y switch
Network A
Switch
l Use OSPF to advertise the Network A routing
information.
Network Y
R R l The routing information equivalently
propagates from 2 switches to respective
routers.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 99 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 100
Backup and balancing using the dual structure + OSPF Backup and balancing using the dual structure +
-Route propagation (when a failure occurs) OSPF - Traffic flows (when a failure occurs)
Network A
Failure Network X switch Network X switch
Failure
R R R R R R
Network A
Network A Network Y switch Network A Network Y switch
Network A
l Due to a failure, the propagation of routing l When a failure occurs, use either of those 2
information partially changes. switches to avoid the failure.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 101 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 102
17
Backup by ring topology - Route Backup by ring topology
propagation (under normal conditions) -Traffic flows (when a failure occurs)
Not Selected because
Selected because its of its greater distance
distance is the smallest
R Network A
Network A R
Failure
Distance=1 Distance=2
R R
R R
Network A
Distance=1
Network A
Network A
l Use RIP to advertise the Network A routing
information. l When a failure occurs, make a detour to back
up communications.
l Under normal conditions, the shortest route
has the priority.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 103 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 104
Network B Network A
l It can’t detect that VP is down to automatically l When OSPF is used for dynamic routing to implement
shut down the interface (Cisco IOS11.X). balancing, even an ATM line can detect a failure.
l For this reason, when the static routing is set up Failure
as described above to bundle 2 ATM lines, the Network A Network B
OSPF ATM line
desired backup can ’t be achieved.
Failure R R
Network A Network B Network A Network B
ATM line
R R l OSPF detects a failure, and stops using the line.
Therefore, no packets will be lost.
Network B Network A
l In this case, approximately 50% of packets will be
lost.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 105 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 106
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 107 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 108
18
HSRP--2
HSRP HSRP--3
HSRP
Failure l HSRP+Interface Tracking
(when a failure occurs)
R R – Switches by Interface
l HSRP+Interface Tracking Tracking
R R (under normal operation) – Stops for 10 seconds (3
seconds, recently)
default
default Server
Server
l HSRP+Interface Tracking
(when a failure occurs)
l When a failure occurs, the faulty interface is R R – Due to recovery, switching
back occurs.
detected, and it implements tracking to switch to
– Stops for 30 seconds (10
active routers. seconds, recently).
default – Recent firmware provides the
Server HSRP Delay function to
eliminate the shutdown time
derived from switching back.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 109 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 110
HSRP--5
HSRP MHSRP--1
MHSRP
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 111 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 112
MHSRP--2
MHSRP Design to consider the future
expansion -1 Features of the network configuration
Failure l MHSRP on the left
(when a failure occurs) Server
l Even if the size is small, the
R R segment for the server is
separate.
default R → To assure the safety for the
server
Server Server
l Clients obtain address allocation
and default routes by DHCP.
H H H
l It protects the server against the
l However, MHSRP has the group ID conflict impact made by the broadcast
problem, therefore, attentions need to be paid flood.
when it is used for open networks.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 113 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 114
19
Design to consider the future Design to consider the future
expansion -2 Add a server expansion -3 Add a server segment
Server Server Server Server
l Add a server, while ensuring the
Server Server safety of the server segment.
l When more segments
l Client segment broadcast can be R R are added, it can be
confined to the segment, handled only by
Backbone segment
therefore, it prevents the accelerating the
R broadcast flood phenomena from 100BaseTXswitch,
Giga bit Ethernet, speed of the
arising. FDDI switch R R backbone segment.
l When a network
H H H H expands from the
switching-based
H H H H network to the one
described on the left,
H H renumbering
H H H H becomes inevitable.
Add a network Add more networks
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 115 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 116
Address allocation in expectation of network expansion l How can the addresses be allocated to
respective hosts in respective departments?
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 117 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 118
Server Renumbering
Router
Department A Department B Department C
1415 16 17
192.168.1.0/25 192.168.1.128/25
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 119 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 120
20
Address allocation
Address allocation in a department -1
for respective departments -2
Department A
Good example Bad example Creates
192.168.1.0/24 Creates
1 14 1516 17 303132 33 1 7 14 subnets
subnets
Server PC Router
Department A Department B
Transferred without changes
routerServer PC
l How can the addresses be allocated to
Server
respective departments?
– Consider subnets, and allocate 1 to 14 to the
department A, and 17 to 30 to the department B,
for example.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 123 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 124
Conclusions -1 Conclusions -2
l Difference between a data link layer and a
network layer l Use RIP 2 and/or OSPF to introduce
– A data link frame changes whenever interchange VLSM.
occurs.
– IP datagram never changes. l Use dynamic routing to construct fault-
– The data link frame recipient doesn ’t always mean the resistant networks.
IP datagram recipient.
l Use OSPF to implement balancing and
l Differences between hubs and switches, as well backup concurrently.
as those between switches and routers
– Allocate them effectively l Allocate servers and others, for which the
safety needs to be assured, to different
l Routing is essential for connections with the segments.
Internet
l Operate following the address allocation
l Once you understand the basic of dynamic policy which concerns about the future
routing, you can apply it expansion of the network.
2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 125 2000/12/21 Copyright © 2000 Internet Initiative Japan Inc. 126
21
[訳注:
1]unreachableと入力されていますが、パワーポイント上の表示がうまくい
きません。ご確認をお願いします。
[訳注:
2]原文はroutedとなっていますが、routerの間違いではないかと推測しま
した。ご確認をお願い致します 。
いくつか全く同じページが含まれています。
P13と15、P14と16、P84と86、P85と87がそれぞれ同一のようです。
構成上の必要と推定して、そのまま翻訳しています。
ご確認をお願いします。
22