(routing)

(Datagrams):
.
(Virtual Circuits):

(session).

(Throughput)

(routing)

, (flow control)
.

:
,
.

:
5

15

10

(sessions)
,
.
,
2 15 .
, 5
.
,
.
3

 :
1.
(Centralized):

.

(Distributed):
,

.
2. ()
(Static):
, .
(Dynamic) -
(Adaptive): ,
(congestion).
, ,
,
.
4

G=(N,A) :
.
dij = (i,j)
(directed
path) p={i,j,k,,l,m} dij+djk++dlm.
: G=(N,A), dijs
- 1.
:
i 1.
: . dij = (i,j).

.
. dij = -lnpij, pij
(i,j) .

.

 Bellman-Ford

i 1, h .

-1 ,
(
):

.
,
h
, i.

: Bellman-Ford (

: Bellman-Ford ( 0)

 ARPANET

.
1969:
i Di
0.

N(i) : i
Dj : 0.62sec
D0 = 0.

(1969),
dij = buffer (i,j).

 (original ARPANET)
:

(unstable).

(i,j)

:

2
.

10

updates,
, ...
(bias)
,

( dij = + buffer (i,j) ).

11

 1979 ARPANET
dij =
(i,j) 10sec.
dij 60sec
,
(flooding).

(),
Dijkstra.

.

12


flooding .

.

( ).
SN ( )
ID .
,
.
,
(spanning tree).

13

 Dijkstra
: G=(N,A), dijs 1.
:
.

Pk, k
1

Pk
(k+1) ,
Pk

1. ,
:
.
.
, .
2.

:
1.

14

 ( Dijkstra):

15

16

17