1.

Answer:
HDLC can support various data transfer modes, supports multipoint links and point to point
links, and can implement error control and flow control mechanisms. PPP uses HDLC-like
frames but does not use error control and flow control protocols. Instead PPP supports
powerful link and network control protocols.
PPP is character based and can be implemented on any physical layer, HDLC is bit based and
can be implemented only on bit synchronous physical layer.

2. Answer:
For continuous transmission: use Go-Back-N or Selective Repeat ARQ
Maximum send Window Maximum send Window
size in default HDLC Frame size in extended HDLC
Frame
Go-Back-N 7 127
Selective Repeat 4 64

The round trip propagation delay is:

2tprop = 2(375x106/3x108) = 2.50 s
Go-Back-N
If N = 7 : 7nr/(1.5Mbps) = 2.5 -> nr=535715 bits
If N = 127: 127nr/(1.5Mbps) = 2.5 -> nr=29528 bits
Selective Repeat
If N = 4: 4nr/(1.5Mbps) = 2.5 -> nr=973500 bits
If N = 64: 64nr/(1.5Mbps) = 2.5 -> nr=58594 bits

3. Answer:
a,
We saw that S1, S2, S3, S4, S0/0/0 are the subnets needed, so that there is 5
subnets are needed.
b,
We call N is the number of bits, then N is the smallest number that satisfies
N
4 ×2 −2 ≥ 25

Then we got N = 3.
(4 because 4 is subnet S1, S2, S3 , S4 not S0/0/0)
c,
We saw that number of bits N = 3, then the number of subnets does this create is
3
2 =8.

d,
28-n – 2 = 28-3 – 2 = 30.

4.Answer:
a.
Iteration N D1 D2 D3 D5 D6

Initial {4} (−1 , ∞) −1 , ∞ ¿ (−1 , ∞) (−1 , ∞) (−1 , ∞)

1 {4,2} (5,4) (1, 4) (2,4) (3,4) (−1 , ∞)

2 {4,2,3} (4,2) ______ (2,4) (3,4) (−1 , ∞)

3 {4,2,3, 5} (4,2) ______ ______ (3,4) (3,3)

5 {4,2,3,5,6} (4,2) ______ ______ ______ (3,3)

6 {4,2,3,5,6,1 (4,2) ______ ______ ______ ______

}

The shortest part from D4 to D1 is 4 and the path is D4 -> D2 -> D1

The shortest part from D4 to D2 is 1 and the path is D4 -> D2

The shortest part from D4 to D3 is 2 and the path is D4 -> D3

The shortest part from D4 to D5 is 3 and the path is D4 -> D5

The shortest part from D4 to D6 is 3 and the path is D4 -> D3 -> D6

b.
Destination Cost Next Hop

1 4 2
2 1 2
 3 2 3
5 3 5
6 3 3

5.Answer:
Header: (11111111 11111111, 11111111 00000000, 11110000 11110000, 11000000 11000000)

Step 1: Add up all the 16-bit words (considering carry):

11111111 11111111 + 11111111 00000000 + 11110000 11110000 + 11000000 11000000

-----------------

 10111111 01101111 (Carry is 1, which is added back to the result)

Step 2: Add the carry to the sum:

10111111 01101111 + 1 (carry)

 10111111 01110000

Step 3: Take the one's complement of the sum:

01000000 10001111

Therefore, the Internet checksum for the given header is:

 01000000 10001111

Or => 56814