1.

. ,
, , ,
, , .
, .
.

2.

. ,
. data link
, . ,
.
,
(. )
.
, .
, ,
. .

. ,
.

2.1.
, .
2.1 . (
),
, . H1 ,
. , H2 LAN-
F. . F
, , , ,
. F ,
,
, (
).

2.1. .

. ,
, -
. , (checksum).
, , .
.

2.2.
/
. :
1. .
2. ,
.
3.
() , LAN WAN .
,
.
.
connectionless( ) connectionoriented ( ) .
1) ( )
. ( 30-
, ), ,
. ,
(. ) .
connectionless,
SEND PACKET RECEIVE PACKET. ,
, ,
. , ,
, .
2) ( )
(connection-oriented). 100
.
, (Quality of Service) ,
, ,
.
() ATM-
(synchronous Transfer Mode). -
; ATM - . ,

3

, . ,
.

2.3.
(CONNECTIONLESS)

,
. ,
. ,
. .
, ( ),
(datagram subnet). ,
.
(virtual circuit),
, (virtual circuit
subnet). , ,
.

2.2. .

? P1 2.2
P2.
P2 H2. H1,
,

,
.
,

- , . PPP (Point-to-Point Protocol). .

.
. . . 2.2
, B C,
, .
a A .
, 1, 2 3 ( ).
C, . 1 , ,
F. F,
H2 LAN-a. 2 3 .
, 4. , B,
. ,
4 .
, ACE
, 2.2 .
,
. .

2.4.
CONNECTION-ORIENTED

, .

, 2.3. ,
.
, .
, .
.
, 2.3. H1 H2.
.
1, H1,
C, . ,
C , 1.
, H3 H2?
1 .
. .
1, H1, 1, H3, C

. ,
.
. , (label switching).

2.3.

2.5.
.
, ,
.
, .
, ,
(overhead), ,
. , ,
.
()
.
,
. ,
: , ,
. ,
()
.

.
,
. ,
,
, .

, (. , CPU )
, .
, .
, .
(.
), overhead
. ,
. ,
, ,
.
, , .
, ,
.
. , ,
.
,
.

3. OE A
,
,
, ,
. , , , ,
.
,
.
Routing Information Protocol (RIP), Interior Gateway Routing Protocol
(IGRP), Open Shortest Path First (OSPF), Enhanced Interior Gateway Routing Protocol
(EIGRP) Border Gateway Protocol (BGP).

3.1.
,
.
. ,
, .
.
10.120.2.0 172.16.1.0,
,
.

( 3.1). ,
,
(:
LAN-). .
, data link .
.
,
dta link . ,
.
, , ,
data link ,
,
.
,
(gateway of last resort).
, (routing table)
.
:
8

o ;

3.1. Data link

,
. ,
.
,
. :
;
.
, ,
. .
.

3.2.
,
.
.

. (stub network),
(leaf node) .
( ) ,

. , ,
, . .

,
.
.

.

3.3.
, ,
, .

, .
,
.
(
).

.
, , TCP/IP IPX,

. ,
. , ,
:
;
;
;

10

;
.
, . : ,
, , , , , .
:
(Interior Gateway Protocols, IGP)
(Exterior Gateway Protocols, EGP). IGP
(. RIP, IGRP), EGP
(. Border Gateway
Protocol, BGP).
.
,
.
,
(administrative distance).
0 255. ,
. 3.2

.

3.2. .

,
.
.
.
.

11

4. A

. ,
,
. ,
. .
,
(. ).
.
. ,
. (forwarding).
.
. .

, :
, , , , .
,
. ,
.
. ,
.


.
.
, . ,
.
, , .
, 4.1.
, B B C C, .
X X .
. O, .
, .
,
. , ,
. ,
,
, , .

12

4.1.

, ,
: (
) ( ).

4.1.
,
.
. I
K, K . ,
. I J r1, J
r2. r2 J K,
r1 I K, r1r2
. .

4.2. () () Sink B

,
.
sink (sink tre). 4.2 sink
B, .
sink .

13

Sink , .
, .
,
. , sink
.

4.2. (SHORTEST PATH ROUTING)

,
. ;
, (
). ,
.
.
. , ABC ABE 4.3 .
, ABC
ABE.
, . .

, .
, .

4.3. 5 D. .

14

,
, , , ,
, . ,
.
.
, Dijkstra (1959). ( )
. ,
, ( ). ,
, .
, . .
, .
, .

4.3, .
D. , . ,
, .
, , .
, ,
.
, .
, .
B.
B. B
B , ,
. , ,
.
. 4.3
.
. 4.3 ()
. ABE, AXYZE,
: Z , . , (
Z ), AXYZE
.
Z . Z
, AXYZE ABE,
, Z, , . Z.
, BE , .

4.3. (FLOODING)
flooding,
.

15

, , .
,
, .
. ,
,
, . .
,
.
, .

, .
, k.

. . , k ,
k .
flooding-a flooding. ,
, .
Flooding , .
, ,
. flooding
. ,

, flooding, .
. Flooding
, . ,
( , . overhead,
).

4.4.
(DISTANCE VECTOR ROUTING)

( ),
. distance vector routing link state
routing, .
(.
),
.
. , ,
, .
. ,
. , . ,

16

, ECHO
(timestamp) .
,
. T
. .
X, Xi X
i. X m ,
i X Xi + m .
,
.

4.4. () () , I, H, K,

4.4. () .
() ,
A, I, H K. A 12 B, 25 ms
C, 40 ms D, . J
A, I, H K 8, 10, 12 6 ms, .
J G? 8 ms,
G 18 ms, J 26 ms,
G A. , G I, H
K 41 (31+10), 18 (6+12) 37 (31+6), .
18, 18 ms,

17

H. ,
.

4.4.1.

,
: , (.
). , , .
X .
,
. ,
.
, 5
4.5 (), .
. ,
.

4.5.

, .
,
. , B . B
A .
. C B 1,
, 2. D E
. , .
N , N
.

18

4.5(),
. B, C, D E 1, 2, 3 4, .
, B , B
.
, B . , C
2. B C
. , B C, 3.
D E .
, C
3. 4.
4.5 ().
:
. ,
,
. ,
. ,
,
.
.
, .
, X Y , Y
.

4.5. (LINK STATE ROUTING)

ARPANET- 1979,
. .
, ,
. , 56 kbps,
. 230 kbps, 1.544 Mbps,
. ,
, , .
, , (link state
routing). .
.
:
1. .
2. , .
3. .

19

4. .
5. .
.

4.5.1.

, .
HELLO - .
. .
. F,
F.
LAN , .
4.6 LAN , C F.
.
4.6 () LAN , N, A, C
F. C LAN- NC.

4.6. (a) LAN. () ().

4.5.2.

.
ECHO , .
, . ,
, . ,
, .

20

.
, ECHO .
, ECHO .

4.7. .

,
, .
, . 4.7,
, , CF I.
CF, ,
.
, EI .
, EI,
. , , CF
. , ,
.
, . ,
,
, .

4.5.3.

,
. , ,
. .
4.8 (). .
4.8 ().
.
. , .
. , , .
, , .
21

4.8. () ()

4.5.4.

.
, ,
. ,
, , , , .
flooding- .
,
.
. ,
. ,
. , .
, .
, . ,
, . 32-
. ,
137 , .
,
. 0,
. , , . 65 540 4
( ), 5 65 540 ,
65 540.
,
. , .
.

.

22

. LSP
, . ,
. LSP
, . ,
. , .
, LSP .
, Round Robin
.
B 4.8
4.9. LSP .
, , , .
,
.

4.9. B 4.8 ()

LSP , C F ,
. , F C
F. , , , .
, B EFB. ,
C, A F.
, . .
LSP C F ,
100011, F
.

23


4.5.5.

LSP , ,
. , , .
.
Dijkstra
.
.
n , k ,
kn.
. . ,
, link state routing .
:
.

, .

.
.
LSP ,
.
,
:
;

;

(
);
;
(summarization).

24

4.6. (HIERARCHICAL ROUTING)

, .
,

. ,
,
, .

4.10.

,
. ,
,
.
.
, , , .
. ,
() (, ).
,
.
, , , , , , ,
, .
.

25

,
. .
4.10 () .
1 17 . ,
, ,
, 2 1B-2A,
1C-3B.
17 7 . 4.10 () 4.10 ().
, . .
1 5 2,
5 3,
.
.
Kamoun Kleinrock (1979) N
ln N, ln N .
, ,
.

4.7. (BROADCAST ROUTING)

,
.
(broadcasting). . ,
(broadcast).

. ,
.
, .
Flooding .
- :
.
(multidestination routing).
.
,
( ).

. ,
. ,
.
,
, .

26

sink ,
spanning . Spanning ,
. spanning ,
spanning
. ,
.
spanning .
(. link state routing), (. distance vector routing).
,
spanning . ,
(reverse path forwarding) .
,
. ,
, , .
. , ,
, .

4.11. . () . () Sink tree. () .

4.11. () , () sink
, a () . , I
F, H, J N. I
. , ,
. , 8
, 5 . 6 ,
3 ; . 5 24 ,
. 14 sink .

27

reverse path forwarding

. spanning .
, ,
.
, .

4.8.
(MULTICAST ROUTING)
, .
.
,
. , - . ,
, . ,
1000
, ( ;
, ). ,
, ,
.
(multicasting).
(multicast routing).
.
, , .
,
. .

. ,
.
, spanning . .
4.12 () , 1 2.
. Spanning
4.12 ().
multicast, spanning
, .
, 4.12 () spanning 1. ,
4.12 () 2. Multicast
spanning .
spanning .
. ,
. Spanning e ,
,
.

28

4.12. () . () Spanning . () Multicast 1.

() Multicast 2.

distance vector routing .

reverse path forwarding.
, multicast , PRUNE
, .
, .

. n , m .
, m spanning , mn
. ,
.
, , ()
(core-based ). multicast , ,
. ,
m .

29

4.9.
(ROUTING FOR MOBILE HOSTS)
. e-mail
, .
;
, .
,
.
4.13.
WAN, . LAN MAN c WAN ,
(wireless cells).
, , .
. ,
. (migratory hosts) , ,
,
. Roaming (roaming hosts)
.
(mobile hosts) , . ,
.

4.13. WAN LAN MAN .

, .
,
.

30

, .
4.13, () .
, LAN (wireless cell).
(foreign agent).
. ,
(home agent), ,
.
, .
:
1. ,
. ,
,
.
2. , ,
.
3.
,
, ,
.
4. , (
). ,
.
5. ,
.
, ,
, , .
, , . .
.
.
, .
. ,
. tunneling.
, ,
data link .
,
, ,
31

, , . ,
.

4.10. AD HOC
a
. .
:
1. .
2. .
3. .
4.
( 802.11).
,
. ad
hoc MANET (Mobile Ad hoc NETworks).

, , IP
, .
. , ,
( ). ad hoc
;
, . ad hoc
.
.
AODV (d hoc On-demand Distance Vector) (Perkins Royer,
1999). Bellman-Ford ,
,
.
, ,
.

4.10.1.

, ad hoc ( +
). ( ),
. ,
B, B . , ,
.
.
, .
32

, 4.14,
I. AODV (
), ,
.
I. I.

4.14. () . () B D . () C, F G .
() E, H I . .

I, ROUTE REQUEST (broadcast).

B D. B D ,
. F , .
ROUTE REQUEST 4.15.
, IP , .
(Request ID).
ROUTE REQUEST . ,
Request ID, ROUTE REQUEST ,
.

4.15. ROUTE REQUEST

Request ID ,
ROUTE REQUEST ( ROUTE
REQUEST).
. (
33

). I (
), (0 ).
. ,
. 0.
ROUTE REQUEST (B D ),
:
1. ( , ID )
. ,
. ,
, .
2. .
(fresh route), ROUTE REPLY
.

ROUTE REQUEST . ,
. ,
3.
3. ,
ROUTE REQUEST .
(reverse route
table). ,
. 4.14
. .
, .
B D I, ,
4.14, 1.
B C D. C reverse route table .
D . , broadcast D B.
F G . , I ,
ROUTE REQUEST .
,
.
, I ROUTE REPLY ( 4.16).
, ROUTE REQUEST ,
0. .
Lifetime .
ROUTE REQUEST , G.
D . ,
.
, .
I, :

34

1. I.
2. I ROUTE RPLY
.
3. , .

4.16. ROUTE REPLY .

, ,
I. ROUTE REQUEST ,
(B, C, E, F ), .
, ,
. . Time to live IP

. 0, .
. , broadcast
ROUTE REQUEST Time to live 1.
, , Time to live 2.
3, 4, 5 . , ,
.

4.10.2.

, . .
4.14 G , I (ADGI)
. . ,
Hello . . ,
.
, , .
.
, ( N)
T .
N . N ( )
,
,
. D
4.17 ().

35

N , N
. ,
N
. ,
, .

4.17. () D G. () G.

, 4.14, G,
. 4.17 (). D
G, G
E, G I. {A, B}.
, B G ,
. D
. D , G I
.
, AODV Bellman-Ford

. .

4.11.
(NODE LOOKUP IN PEER-TO-PEER NETWORKS)
(t. peer-to-peer networks),
, ,
. peer-to-peer
: 50 Napster

36

, Napster
. , peer-to-peer
.
peer-to-peer
. .
peer-to-peer
. , ,
, . ?
, (.
). ,

.
, ,
, , , .
ASCII , . ASCII
, , IP .
, .
on-line , ,
. ,
.
. , ,
.
. ,
, , , ?
. Chord
.
. Chord n , ,
. IP ,
m- . Chord
SHA-1 .
160- . , IP 160- ,
.
: 2160
. , . 4.18
m=5. , 1, 4, 7, 12, 15, 20
27 ; .
successor(k) k
. . successor(6)=7, successor(8)=12, successor(16)=20.
( , , .)
. (key). , (ASCII )

37

, key=hash(name).
, IP .
successor(hash(name)) . (
) , .
,
successor(key) IP .
IP ,
. IP .
. 4 7, 7 12.

4.18. () 32 . .
1, 4 12. .
() .

, ( ) ,
IP .
, .
,
, , IP .

38

, IP ,
,
. . 7 10
, 3.
,
peer-to-peer , (
) o n/2. , .
finger table ( ). m , 0
m-1, . : IP
(successor(start)). i k :
start = k + 2i
IP successor(start[i])
, k .
k successor(k), k
. ,
. IP ,
.
. log2n.
. 14, 1.
14 1 4, .
14- 9, IP
9, IP 12. 12 14
, 15, IP 15.
.
. , r, ,
successor(r) IP
. , IP
. , .
. 24 ,
successor(24), 27. 27 , 20.
, . 20 24 , 27
24 . , 27 21-24,
24. , 24 .
, . ,
,
successor. , .
,
,
. , ,
. ,
39

, s
, s-1
.
Chord
, .

40

5.
, ,
.

. ,
,
. , , .
ad hoc , . ,
,
ad hoc .

41

6.
1. Andrew S. Tanenbaum: Computer Networks, Prentice Hall, 2003.
2. Steve McQuerry: Interconnecting Cisco Network Devices, Cisco Press, 2000.
3. : ,
, 2004.

42

1. ..........................................................................................................................................1
2. ....................................................................................2
2.1. ..........................................................................2
2.2. .............................................................................................3
2.3. (connectionless)........................................4
2.4. connection-oriented ...............................5
2.5. ...........................................................................................6
3. OE A..............................................................................................................8
3.1. ..................................................................................................................................8
3.2. ...............................................................................................................10
3.3. ............................................................................................................10
4. A ..............................................................................................12
4.1. ....................................................................................................13
4.2. (Shortest Path Routing).......................................................14
4.3. (Flooding)............................................................................................................15
4.4.
(Distance Vector Routing).....................................................................................................16
4.5. (Link State Routing).........................................................19
4.6. (Hierarchical Routing).............................................................25
4.7. (Broadcast Routing).........................................................................26
4.8.
(Multicast Routing).................................................................................................................28
4.9.
(Routing for Mobile Hosts)....................................................................................................30
4.10. Ad Hoc .........................................................................................32
4.11.
(Node Lookup in Peer-to-Peer Networks)...........................................................36
5. .............................................................................................................................41
6. ..........................................................................................................................42
43

....................................................................................................................................43

44