Presentation is loading. Please wait.

Presentation is loading. Please wait.

Stainov - DataComMET CS TC5353 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Distance Vector Routing (Bellman-Ford, Ford-Fulkenson). It was used.

Similar presentations


Presentation on theme: "Stainov - DataComMET CS TC5353 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Distance Vector Routing (Bellman-Ford, Ford-Fulkenson). It was used."— Presentation transcript:

1

2

3 Stainov - DataComMET CS TC5353 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Distance Vector Routing (Bellman-Ford, Ford-Fulkenson). It was used in early versions of ARPANET and in Internet (RIP), DECnet,, AppleTalk and Cisco. Each router maintains a table (i.e. a vector) indexed by, and containing one entry for each router in the subnet. The entry contains the preferred outgoing line for this destination and an estimate giving the best known distance to that destination (# of hops, time delay, etc.).  Once every T msec each router sends to (and receives from) each neighbor a list of estimated distance to each destination. The router recalculates the distances. 2 1

4 Stainov - DataComMET CS TC5354 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Count-to-Infinity Problem - the distance vector routing propagates the good news, but leisurely to the bad news.

5 Stainov - DataComMET CS TC5355 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Link State Routing (Second Generation in ARPANET) - the first generation did not consider the speed, but only the queue length, and took too long to converge. 1. Discover its neighbors and learn their network addresses. 2. Measure the delay or cost to each of its neighbors (e.g. by ECHO packets)  measure RTT/2 and calculate only the queue delay (to avoid load oscillation) or both, the queue delay and the communication load transformed to "link utilization". 3. Construct a packet telling all it has just learned, and send the packet to all routers. 4. Compute the shortest path to every other router.  The complete topology and all delays are experimentally measured and distributed to every router.

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31 Stainov - DataComMET CS TC53531 5.5 INTERNET: Subnets a. The classic (and externally transparent) IP address: b. Internal structuring of the IP address: For example are the first 8 bits (= 1 byte) the host ID. The 3 high order bits can be used as subnet ID. It means, 2 8 = 256 host addresses are divided into 2 3 = 8 subnets with 2 5 = 32 host addresses each. How many bits are to be used for the subnet ID is specified by the subnet mask. Example: The subnet mask 255.255.255.224, of a C class address means, that the three high order bits in the first byte are used for subnet IDs: »11111111 2. 11111111 2. 11111111 2. 11100000 2 Net-IDSubnet-IDHost-ID Net-IDHost-ID

32

33

34

35

36

37

38

39

40

41 Stainov - DataComMET CS TC53541 Internetworking IP Routing Example

42

43

44

45

46

47

48

49


Download ppt "Stainov - DataComMET CS TC5353 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Distance Vector Routing (Bellman-Ford, Ford-Fulkenson). It was used."

Similar presentations


Ads by Google