1.

Explain the difference between connectionless unacknowledged service and connectionless

acknowledged service. How do the protocols that provide these services differ?
Answer:
Connection Less:
-Connection less service comes with a single free-standing data unit for all transmissions.
-In this, each unit contains all of the protocols that control information necessary for delivery
perspective, but this also contains no provision for sequencing or flow control
Acknowledge:
-This is achieved by the use of ACK and NAK control messages
-These types of protocols are well suited for communication over the network, where high layers
are very sensitive to loss and can have a significant probability of error in these underlying
networks
Example: HDLC, which offers for unnumbered acknowledgement service (setup and release)
Unacknowledge
- This comes with a very simpler version and provides faster communication for networks, which
are inherently reliable or provide service to a higher layer, that can tolerate loss in the
information, or which has built-in error control/recovery feature.

2. Explain the difference between connection-oriented acknowledged service and connectionless

acknowledged service. How do the protocols that provide these services differ?
Answer:
Less and oriented:
>>Connection-oriented:
-In this type of service, a setup phase will be initialized between sender and receiver, to establish
a context for transferring the information
-This connection is provided to the sender for all SDUs.
-This service requires a stateful protocol, which is used to keep track of sequence numbers, and
timers
>> Connectionless:
-Here, there will be no prior context provided for transferring the information betweensender and
receiver.
-The sender will pass its SDU to an underlying layer without any notice.
-And in this, the sender requires an acknowledgment of SDU delivery.
- The protocols are very different in these services
this service also does not require transmitting protocols to track the acknowledgment of PDU.
-After receiving the PDU, the receiver needs to send acknowledgment, If not received in time,
then it will return failure

3. Explain the differences between PPP and HDLC

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

4. A 1.5 Mbps communications link is to use HDLC to transmit information to the moon.
What is the smallest possible frame size that allows continuous transmission? The
distance between earth and the moon is approximately 375,000 km, and the speed of light
is 3x108 meters/second ( Liên kết truyền thông 1,5 Mbps là sử dụng HDLC để truyền thông tin
lên mặt trăng. Kích thước khung hình nhỏ nhất có thể cho phép truyền liên tục là bao nhiêu?
Khoảng cách giữa trái đất và mặt trăng là khoảng 375.000 km và tốc độ ánh sáng là 3x108
mét/giây )
Answer:
For continuous transmission: use Go-Back-N or Selective Repeat ARQ
Maximum send Window size Maximum send Window size
in default HDLC Frame 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 (làm tròn lên)
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
5. Suppose HDLC is used over a 1.5 Mbps geostationary satellite link. Suppose that
250-byte frames are used in the data link control. What is the maximum rate at which
information can be transmitted over the link? ( Giả sử HDLC được sử dụng qua liên kết
vệ tinh địa tĩnh 1,5 Mbps. Giả sử rằng các khung 250 byte được sử dụng trong điều khiển
liên kết dữ liệu. Tốc độ tối đa mà thông tin có thể được truyền qua liên kết là bao nhiêu?)
Answer:
Let :
R is the speed of the satellite link = 1.5 Mbps =1.5*106 bps
nf is the size of the frame that occurred on the data link line = 250 bytes = 2000 bits
d is the distance from the earth to satellite = 36000 km = 36*106 m
c is the speed of light = 3*108 m/s
tprop = d/c = 120 ms
tf = nf/R=2000/1.5*106=1.33ms
Use Go-Back-N or Selective Repeat ARQ. Default window size is N=7 (with a 3bit
sequence number). 0 1 2 3 4 5 6 7 ….
The maximum information rate is achieved with no error, and hence, no retransmission.
Tcycle = minimum time to transmit a group of N packets = tf+ 2tprop = 241.33 ms
n = Number of bits transmitted in a cycle = N*nf = 7*2000 = 14000 bits
Rmax = number of bits sent in a cycle = n/tcycle =14000/ 0.24133 = 58 kbps

If the extended sequence numbering option (7-bit) is used, the maximum send window
size would be N = 128 – 1 = 127.
So maximum information rate is : N.nf/tcycle = 127*2000/(241.33*10-3) = 1052500 bps =
1.0525 Mbps

6. Suppose that a multiplexer receives constant-length packet from N = 60 data sources.

Each data source has a probability p = 0.1 of having a packet in a given T-second period.
Suppose that the multiplexer has one line in which it can transmit eight packets every T
seconds. It also has a second line where it directs any packets that cannot be transmitted
in the first line in a T-second period. Find the average number of packets that are
transmitted on the first line and the average number of packets that are transmitted in the
second line
Answer:
First, find out the probability of the k packets that have reached the T- second. It can be
computed with the help of binomial distribution that has parameters as N=60 and shows
the probability of p=0.1.
The average number for the arrivals of the packets can be given as Np=6. Now, calculate
the average number of packets received through the first line as below:
8

∑ k ( 0.1 )k 0.960 k=4.59

k=0

4.59 is the average number of packets received that gets transmitted through the first line.
The remaining will get transmitted by the second line.
The average number of packets transmitted through the second line per T second = 6 –
4.59 = 1.41
So, it will transmit 1.41 packets on average per T second from the second line.

7. Consider the transfer of a single real-time telephone voice signal across a packet
network.
Suppose that each voice sample should not be delayed by more than 20 ms.
a. Discuss which of the following adaptation functions are relevant to meeting the
requirements of this transfer: handling of arbitrary message size; reliability and
sequencing; pacing and flow control; timing; addressing; and privacy, integrity
and authentication.
b. Compare a hop-by-hop approach to an end-to-end approach to meeting the
requirements of the voice signal.
Answer:
a/Message size is important because in real-time signals of voice it is necessary to
transfer a fixed packet size of that holds no more than 20 ms of the speech signal. The
handling of arbitrary message size is not as important as long as the desired packet size
for voice can be handled.
Sequencing is essential because each packet needs to arrive in the same sequence that it
was generated. Reliability is moderately important since voice transmission can tolerate a
certain level of loss and error.
Pacing and flow control are not as important because the synchronous nature of the voice
signal implies that the end systems will be matched in speed. Timing, for real-time voice
transfer, is important because this adaptation function helps to control the jitter in the
delivered signal.
Addressing is only during the connection setup phase if we assume some form of virtual
circuit packet switching method.
Privacy, integrity, and authentication have traditionally not been as important as the other
issues discussed above.

If the underlying network is

reliable then the end-to-end
approach is better because the
probability of error is very
low so processing at the edge
suffices to provide acceptable
performance.
If the underlying network is
unreliable then the hop-by-
hop approach may be
required.
For example, if the
probability of error is very
high, as in a wireless channel,
then error
recovery at each hop may be
necessary to make effective
communication possible
If the underlying network is
reliable then the end-to-end
approach is better because the
probability of error is very
low so processing at the edge
suffices to provide acceptable
performance.
If the underlying network is
unreliable then the hop-by-
hop approach may be
required.
For example, if the
probability of error is very
high, as in a wireless channel,
then error
recovery at each hop may be
necessary to make effective
communication possible
If the underlying network is
reliable then the end-to-end
approach is better because the
probability of error is very
low so processing at the edge
suffices to provide acceptable
performance.
If the underlying network is
unreliable then the hop-by-
hop approach may be
required.
For example, if the
probability of error is very
high, as in a wireless channel,
then error
recovery at each hop may be
necessary to make effective
communication possible
If the underlying network is
reliable then the end-to-end
approach is better because the
probability of error is very
low so processing at the edge
suffices to provide acceptable
performance.
If the underlying network is
unreliable then the hop-by-
hop approach may be
required.
For example, if the
probability of error is very
high, as in a wireless channel,
then error
recovery at each hop may be
necessary to make effective
communication possible
If the underlying network is
reliable then the end-to-end
approach is better because the
probability of error is very
low so processing at the edge
suffices to provide acceptable
performance.
If the underlying network is
unreliable then the hop-by-
hop approach may be
required.
For example, if the
probability of error is very
high, as in a wireless channel,
then error
recovery at each hop may be
necessary to make effective
communication possible
If the underlying network is
unreliable then the hop-by-
hop approach may be
required.
For example, if the
probability of error is very
high, as in a wireless channel,
then error
recovery at each hop may be
necessary to make effective
communication possible
b/ if the underlying network is reliable then end-to-end approach is better because the
probability of error is very low so processing at the edge sufficed to provide acceptable
performance
if the underlying network is unreliable the hop-by-hop approach may be required. For
example, if the probability of error is very high, as in a wireless channel, then error
recovery at each hop may be necessary to make effective communication possible
8. Consider the Stop-and-Wait protocol as described. Suppose that the protocol is
modified so that each time a frame is found in error at either the sender or receiver, the
last transmitted frame is immediately resent.
a. Show that the protocol still operates correctly.
b. Does the state transition diagram need to be modified to describe the new
operation?
c. What is the main effect of introducing the immediate-retransmission feature?
Answer:
a/ The sender in the stop-and-wait protocol described in the chapter retransmits a frame
when an acknowledgement is not received in time. The modified protocol says that the
frame is retransmitted every time the sender or receiver sees an error
b/ No. The state transition diagram will stay the same.
c/ The error recovery process will be faster with this modified protocol.

9. Suppose that two peer-to-peer processes provide a service that involves the transfer of
discrete messages. Suppose that the peer processes are allowed to exchange PDUs that
have a maximum size of M bytes including H bytes of header. Suppose that a PDU is not
allowed to carry information from more than one message
Answer:
a.Bytes each to be transmitted in several PDUs in order to exchange messages of any
size. A single PDU must include all small messages.
b.Peer processes must exchange information that permits messages to be reassembled at
the recipient. The message length, for example, could be included in the first PDU. A
message end-of-message marker could be included in the last PDU. In connection-
oriented networks, sequence numbers can be used to detect loss, while in connectionless
networks, they can be used to aid in message reconstruction. Finally, because variable-
size PDUs are allowed, the PDU size must be specified in the PDU header.
c.In this instance, each PDU must be identified with a stream ID in addition to all of the
header information specified in (b), so that the receiver may treat each stream separately
while reassembling messages.
10. A 1 Mbyte file is to be transmitted over a 1 Mbps communication line that has a bit
error rate of p = 10-6.
a. What is the probability that the entire file is transmitted without errors? Note for n
large and p very small, (1 - p)n ≈ e-np
b. The file is broken up into N equal-sized blocks that are transmitted separately.
What is the probability that all the blocks arrive correctly without error? Does
dividing the file into blocks help?
c. Suppose the propagation delay is negligible, explain how Stop-and-Wait ARQ can
help deliver the file in error-free form. On the average how long does it take to
deliver the file if the ARQ transmits the entire file each time? (
Tệp 1 Mbyte sẽ được truyền qua đường truyền thông 1 Mbps có tỷ lệ lỗi bit là p = 10-6.

a. Xác suất để toàn bộ tệp được truyền đi mà không có lỗi là bao nhiêu? Lưu ý với n lớn và p rất nhỏ, (1 -
p)n ≈ e-np.

b. Tệp được chia thành N khối có kích thước bằng nhau được truyền riêng rẽ. Xác suất mà tất cả các khối
đến đúng mà không có lỗi là gì? Việc chia tệp thành các khối có hữu ích không?

c. Giả sử độ trễ lan truyền là không đáng kể, hãy giải thích cách ARQ Dừng và Chờ có thể giúp phân phối
tệp ở dạng không có lỗi. Trung bình mất bao lâu để gửi tệp nếu ARQ truyền toàn bộ tệp mỗi lần? )

Answer:

The file length n = 8x106 bits, the transmission rate R = 1 Mbps, and p = 10-6.
a. P[no error in the entire file] = (1 – p)n ≈ e–np , for n >> 1, p << 1
= e-8 = 3.35 x 10-4
We conclude that it is extremely unlikely that the file will arrive error free.
b. A subblock of length n/N is received without error with probability:
P[no error in subblock] = (1 – p)n/N
A block has no errors if all subblocks have no errors, so
P[no error in block] = P[no errors in subblock]N =((1 – p)n/N)N = (1 – p)n
So simply dividing the blocks does not help.
c/We assume the
following: • • • • • • t0 =
basic time to send a
frame
and receive the
ACK/NAK ttotal = total
transmission time until
success
nf = number of bits/frame
na = number of bits per
ACK nt = number of
transmissions Pf =
probability of frame
transmission error t0 = tf
+ tACK
= nf /R + na /R (tprop ≈
0).
c/We assume the
following: • • • • • • t0 =
basic time to send a
frame
and receive the
ACK/NAK ttotal = total
transmission time until
success
nf = number of bits/frame
na = number of bits per
ACK nt = number of
transmissions Pf =
probability of frame
transmission error t0 = tf
+ tACK
= nf /R + na /R (tprop ≈
0).
c/We assume the
following: • • • • • • t0 =
basic time to send a
frame
and receive the
ACK/NAK ttotal = total
transmission time until
success
nf = number of bits/frame
na = number of bits per
ACK nt = number of
transmissions Pf =
probability of frame
transmission error t0 = tf
+ tACK
= nf /R + na /R (tprop ≈
0).
c/We assume the
following: • • • • • • t0 =
basic time to send a
frame
and receive the
ACK/NAK ttotal = total
transmission time until
success
nf = number of bits/frame
na = number of bits per
ACK nt = number of
transmissions Pf =
probability of frame
transmission error t0 = tf
+ tACK
= nf /R + na /R (tprop ≈
0).
c/
We assume the following:
- t 0= basic time to send a frame and receive the ACK/NAK ≈ ttimeout
-t total = total transmission time until success
-n f ¿ number of bits/frame

-n a = number of bits per ACK

-nt = number of transmissions
- Pf = probability of frame transmission error

nf na
t0 = t f +t ACK = +
R R
(t ¿≈ 0 ¿ ¿
P [ nt =i ]=P[one success after i−1 failure] = (1 - pf ¿ p f i−1

Given i transmissions : t total | = i * t 0

∞ ∞ t 0 ( 1−P f ) t0
E[t total] = ∑ i t 0P[nt =i ] =t 0 (1−P f ) ∑ i . Pi−1
f = (1−Pf ) 2 = 1− pf
i=1 i=1
 Here , n f = n >> n a thus t 0 ≈ t f = n/R ; and Pf =1−P [no error ] =
1−¿ e−np
E[total] = n/R(1 - pf ¿=n /[ℜ−np ] = 8 / (3.35 x 10-4) = 23847 seconds = 6,62 hours
The file gets through, but only after many retransmissions.

11.

Answer:
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.How many usable hosts does this create per subnet? 28-n – 2 = 28-3 – 2 = 30
12. Five stations (S1-S5) are connected to an extended LAN through transparent bridges (B1-
B2), as shown in the following figure. Initially, the forwarding tables are empty. Suppose the
following stations transmit frames: S1 transmits to S5, S3 transmit to S2, S4 transmits to S3, S2
transmits to S1, and S5 transmits to S4. Fill in the forwarding tables with appropriate entries after
the frames have been completely transmitted

Answer:

- Đi tất cả các hướng khi

chạm vào port và tới đúng
điểm mới tính là 1 đường.
13. Consider the network in Figure
a) Use the Dijkstra
algorithm to find the set of
shortest paths from node 4
to other
nodes.

b) Find the set of

associated routing table
entries (Destination, Next
Hop, Cost)

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 (chính là D1) 4 2
2 1 2
3 2 3
5 3 5
6 3 3
 14.

You are a network technician assigned to install a new network for a customer.
You must create multiple subnets out of the 192.168.1.0/24 network address space
to meet the following requirements:
- The first subnet is the LAN-A network. You need a minimum of 50 host
IP addresses.
- The second subnet is the LAN-B network. You need a minimum of 40
host IP addresses.
- You also need at least two additional unused subnets for future
network expansion.
Note: Variable length subnet masks will not be used. All of the device subnet masks
should be the same length.
Answer the following questions to help create a subnetting scheme that meets the
stated network requirements:

a. How many host addresses are needed in the largest required subnet?
b. What is the minimum number of subnets required?
c. The network that you are tasked to subnet is 192.168.1.0/24. What is
the /24 subnet mask in binary?
d. The subnet mask is made up of two portions, the network portion, and the
host portion. This is represented in the binary by the ones and the zeros in
the subnet mask.

In the network mask, what do the ones and zeros represent?

 e. When you have determined which subnet mask meets all of the stated
network requirements, derive each of the subnets. List the subnets from first
to last in the table. Remember that the first subnet is 192.168.0.0 with the
chosen subnet mask.
Answer ::::

a. The largest required subnet needs 50 host addresses, so the subnet

mask must be able to accommodate at least 51 hosts.

b. The minimum number of subnets required is 3: LAN-A, LAN-B, and 2

unused subnets.

c. The /24 subnet mask in binary is 255.255.255.0. This can be represented as

11111111.11111111.11111111.00000000 in binary.

d. The ones in the subnet mask represent the network portion of the IP
address, and the zeros represent the host portion. The network portion of
the IP address identifies the network, and the host portion identifies the
individual host on the network.

e. When you have determined which subnet mask meets all of the stated network
requirements, derive each of the subnets. List the subnets from first to last in the
table. Remember that the first subnet is 192.168.12.0 with the chosen subnet mask.

Subnet Prefix Subnet Mask

Address

192.168.12.0 /26 255.255.255.192

192.168.12.64 /26 255.255.255.192

192.168.12.12 /26 255.255.255.192

8

192.168.12.19 /26 255.255.255.192

2
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
15. Suppose that Selective Repeat ARQ is modified so that ACK messages contain a list
of the next m frames that it expects to receive.
a. How does the protocol need to be modified to accommodate this change?
b. What is the effect of the change on protocol performance?
Answer:
a. There are two things needed to be changes:
The frame header needs to be modified to receive the list of frames and since the receiver
explicitly indicated which frames are needed to be transmitted.
Change in transmitter operation is needed. If the received list contains m oldest frames
that are yet to be received, then it can be used to skip retransmission of frames that have
already been received
b. Performance will surely increase if the error rate is high or delay is high. A single
frame can ask for the retransmission of several frames
The complexity of the protocol will sure lt increase relative to the unchanged Selective
repeat ARQ
16. Suppose the size of an uncompressed text file is 1 megabyte
Note: Explain your answer in details.
a. How long does it take to download the file over a 32 kilobit/second modem?
b. How long does it take to take to download the file over a 1 megabit/second
modem?
c. Suppose data compression is applied to the text file. How much do the transmission
times in parts (a) and (b) change?
If we assume a maximum compression ratio of 1:6, then we have the following times for the 32
Kb and Mb lines respectively
Answer:

There are two things needed

to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
Download time= File size/ Bandwidth
a. R=32Kbps=32000bps
 Download time = 8388608/32000 = 262144s
b. R=1Mbps=1000000bps
 Download time = 8.39s
c. Maximum compression ratio of 1:6 -> L’ = L/6
R=32Kbps
Download time = 262144/6 = 43.69s
R=1Mbps
Download time = 8.39/6 = 1.4s

17. Let g(x)=x3+x+1. Consider the information sequence 1001. Find the codeword
corresponding to the preceding information sequence. Using polynomial arithmetic we obtain
Answer:
g(x)=x3+x+1 -> 1011
the information sequence -> 1001
Add 0 to data bits string. It will be 1001000
Divide 1001000 to 1011. Get the remainder
 110
Codeword: 1001110
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
18. A router has the following CIDR entries in its routing table:
Address/mask Next hop
135.46.56.0/22 Interface 0
135.46.60.0/22 Interface 1
192.53.40.0/23 Router 1
default Router 2
(a) What does the router do if a packet with an IP address 135.46.63.10 arrives?
(b) What does the router do if a packet with an IP address 135.46.57.14 arrives?
Interface 0
Convert to binary
10000111.00101110.001110 00.00000000 (min)

ere are two things needed to

be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
There are two things needed
to be changes:
The frame header needs to be
modified to receive the list of
frames and Since the receiver
explicitly indicates which
frames are needed to be
transmitted.
Change in transmitter
operation is needed. If the
recieved list contains m
oldest frames
that are yet to be received,
then it can be used to skip
retransmission of frames that
have
already been received.
b)
Performance will surely
increase if the error rate is
high or delay is high. A
single frame
can ask for the retransmission
of several frames.
The complexity of the
protocol will surely increase
relative to the unchanged
Selective
repeat ARQ.
10000111.00101110.001110 11.11111111 (max)
Convert to decimal
(a) Packet with IP address 135.46.63.10 will be forwarded to "Interface 1".

(b) Packet with IP address 135.46.57.14 will be forwarded to "Interface 0".

19. A Large number of consecutive IP address are available starting at 198.16.0.0.

Suppose four organizations, A, B, C, D request 4000, 2000, 4000, and 8000 addresses,
respectively. For each of these organizations, give:
1. the first IP address assigned
2. the last IP address assigned
3. the mask in the w.x.y.z/s notation
The start address, the ending address, and the mask are as follows:
Answers:
Organization A (4000 IP addresses)
Host ID: 12 bits (212= 4096 >=4000)
-> Network ID = 20 bits
The first IP address:
11000110.00010000.00000000.00000000 -> 198.16.0.0
The last IP address:
11000110.00010000.00001111.11111111 - >198.16.15.255
The mask: 198.16.0.0/20 (The first IP address + “/” + Network ID)

Organization B (2000 IP addresses)

Host ID: 11 bits (211= 2048 >=2000)
-> Network ID = 21 bits
The first IP address:
11000110.00010000.00010000.00000000 -> 198.16.16.0 (Add 1 from the last IP of Org A)
The last IP address:
11000110.00010000.00010111.11111111 - >198.16.23.255
The mask: 198.16.16.0/21 (The first IP address + “/” + Network ID)

Organization C (4000 IP addresses)

Host ID: 12 bits (212= 4096 >=4000)
-> Network ID = 20 bits
The first IP address:
11000110.00010000.00100000.00000000 -> 198.16.32.0 (Add 1 from the last IP of Org B)
The last IP address:
11000110.00010000.00101111.11111111 - >198.16.47.255
The mask: 198.16.32.0/20 (The first IP address + “/” + Network ID)

Organization D (8000 IP addresses)

Host ID: 13 bits (213= 8192 >=8000)
-> Network ID = 19 bits
The first IP address:
11000110.00010000.01000000.00000000 -> 198.16.64.0 (Add 1 from the last IP of Org C)
The last IP address:
11000110.00010000.01011111.11111111 - >198.16.95.255
The mask: 198.16.64.0/19 (The first IP address + “/” + Network ID)

20. The ability to work with IPv4 subnets and determine network and host information based on
a given IP address and subnet mask is critical to understanding how IPv4 networks operate. The
first part is designed to reinforce how to compute network IP address information from a given
IP address and subnet mask. When given an IP address and subnet mask, you will be able to
determine other information about the subnet.
Fill out the tables below with appropriate answers given the IPv4 address, original subnet mask,
and new subnet mask.
 ( Khả năng làm việc với mạng con IPv4 và xác định thông tin mạng và máy chủ lưu trữ dựa trên
địa chỉ IP và mặt nạ mạng con nhất định là rất quan trọng để hiểu cách thức hoạt động của mạng
IPv4. Các
phần đầu tiên được thiết kế để củng cố cách tính toán thông tin địa chỉ IP mạng từ một địa chỉ IP
và mặt nạ mạng con đã cho. Khi được cung cấp địa chỉ IP và mặt nạ mạng con, bạn sẽ có thể xác
định thông tin khác về mạng con.
Điền vào các bảng bên dưới với các câu trả lời thích hợp cho địa chỉ IPv4, mặt nạ mạng con ban
đầu và mặt nạ mạng con mới. )

Answer:
Number of subnet bits:
Original Subnet Mask: 255.255.255.0 (24 bit-1s)
New Subnet Mask: 255.255.255.248 (29 bit-1s)
Number of Subnet bits: 5 (29 - 24)

Number of subnet created:

2number of subnet bits = 25 = 32

Number of host bits per subnets

32 – (number of network bits) – (number of subnet bits)
= 32 – 24 – 5 = 3
Number of hosts per subnet
2Host bits - 2= 23 - 2 = 6 (-2: Network address, Broadcast address)

Network Address of this Subnet

11000000.10000111.11111010.10110100 (Host IP Address)
11111111.11111111.11111111.11111000 (New Subnet mask)
(Host IP Address) AND (New Subnet mask)
 11000000.10000111.11111010.10110000 = 192.135.250.176

First host on this subnet

Network Address of this Subnet + 1
=192.135.250.177

Last host on this subnet

Broadcast Address on this subnet
11000000.10000111.11111010.10110100 (Host IP Address)
00000000.00000000.00000000.00000111 (New Wildcard Mask) (Negative of New Subnet
mask)
(Host IP Address) OR (New Wildcard Mask)
 11000000.10000111.11111010.10110111 = 192.135.250.183
Last host on this subnet = Broadcast Address – 1 = 192.135.250.182
21. Suppose an application layer entity wants to send an L-byte message to its peer process,
using an existing TCP connection. The TCP segment consists of the message plus 20 bytes of
header. The segment is encapsulated into an IP packet that has an additional 20 bytes of
header. The IP packet in turn goes inside an Ethernet frame that has 18 bytes of header and
trailer. What percentage of the transmitted bits in the physical layer correspond to message
information, if L = 100 bytes, 500 bytes, 1000 bytes.
TCP segment header: 20 bytes
IP packet header: 20 bytes
Ethernet frame header and trailer: 18 bytes
Total overhead introduced by headers and trailers: 20 bytes (TCP) + 20 bytes (IP) + 18 bytes
(Ethernet) = 58 bytes
We need to consider that the total size of the transmitted data will be the sum of the original
message length (L) and the added headers and trailers (58 bytes).
Total transmitted data size = L + 58 bytes
Now, let's calculate the percentage of the transmitted bits that correspond to the message
information:
Percentage = (Message size / Total transmitted data size) * 100
We'll calculate this for different message lengths (L) and round to two decimal places:
For L = 100 bytes: Total transmitted data size = 100 + 58 = 158 bytes Percentage = (100 / 158) *
100 ≈ 63.29%
For L = 500 bytes: Total transmitted data size = 500 + 58 = 558 bytes Percentage = (500 / 558) *
100 ≈ 89.61%
For L = 1000 bytes: Total transmitted data size = 1000 + 58 = 1058 bytes Percentage = (1000 /
1058) * 100 ≈ 94.56%
So, for different message lengths:
When L = 100 bytes, approximately 63.29% of the transmitted bits correspond to message
information.
When L = 500 bytes, approximately 89.61% of the transmitted bits correspond to message
information.
When L = 1000 bytes, approximately 94.56% of the transmitted bits correspond to message
information.

22. Consider the three-way handshake in TCP connection setup. (a) Suppose that an old SYN segment
from station A arrives at station B, requesting a TCP connection. Explain how the three-way
handshake procedure ensures that the connection is rejected. (b) Now suppose that an old SYN
segment from station A arrives at station B, followed a bit later by an old ACK segment from A to a
SYN segment from B. Is this connection

Answers

(a)

The three-way handshake procedure ensures that the connection is rejected by ensuring that both
stations have the same sequence numbers. When station A sends a SYN segment, it includes its
sequence number in the segment. Station B then sends an ACK segment back to station A, including its
own sequence number and the sequence number of the SYN segment it received from station A. If
station B receives an old SYN segment from station A, it will not know the sequence number of the SYN
segment it sent back to station A. This means that station B will not be able to acknowledge the SYN
segment from station A, and the connection will be rejected.

(b)

The connection is not established in this case. The old SYN segment from station A will be ignored by
station B, and the old ACK segment from station A will also be ignored by station B. This is because the
sequence numbers in the old SYN segment and the old ACK segment do not match the sequence
numbers that station B expects.

Additional Information

 The three-way handshake is a process that is used to establish a

connection between two TCP hosts.
 The three-way handshake involves three messages: a SYN segment from
the client, an ACK segment from the server, and an ACK segment from
the client.

The three-way handshake ensures that both hosts have the same sequence numbers and that the
connection is established in a reliable way.

23. Suppose a header consists of four 16-bit words: (11111111 11111111,

11111111 00000000, 11110000 11110000, 11000000 11000000). Find the
Internet checksum for this code.

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

24. Consider the 7-bit generator, G=10011, , and suppose that D has the value
1001010101.
What is the value of R? Show your all steps to have result.
Here are the steps to get the result:

The generator G is 10011, which is a 7-bit binary number.

The data D is 1001010101, which is also a 7-bit binary number.

The CRC (cyclic redundancy check) is calculated by dividing D by G.

The remainder of the division is R.

The steps to calculate the CRC are as follows:

1. Initialize the remainder R to 0.

2. Shift G one bit to the right.

3. XOR the shifted G with the least significant bit of D.

4. Shift D one bit to the right.

5. Repeat steps 2-4 until all the bits of D have been processed.

6. The remainder R is the final value of the XOR operation.

In this case, the steps to calculate the CRC are as follows:

1. Initialize the remainder R to 0.

2. Shift G one bit to the right.

G = 10011

=> G >> 1 = 01001

3. XOR the shifted G with the least significant bit of D.

D = 1001010101

=> D & 1 = 1

=> R = 01001 ^ 1 = 01000

4. Shift D one bit to the right.

D = 1001010101

=> D >> 1 = 10010101

5. Repeat steps 2-4 until all the bits of D have been processed.

=> R = 01000

Therefore, the value of R is 01000.

25. Suppose two hosts, A and B, are separated by 20,000 kilometers and are connected by a
direct link of R = 2 Mbps. Suppose the propagation speed over the link is 2.5 x 108
meters/sec.
a. Calculate the bandwidth-delay product, R _ dprop.
b. Consider sending a file of 800,000 bits from Host A to Host B. Suppose the file is sent
continuously as one large message. What is the maximum number of bits that will be in
the link at any given time?

(a)
The bandwidth-delay product is calculated as the product of the link capacity (R)
and the round-trip delay time (dprop). The round-trip delay time is the time it
takes for a signal to travel from one point to another and back again.
In this case, the bandwidth-delay product is:
R * dprop = 2 Mbps * (20,000 km * 1000 m/km) / (2.5 x 108 m/sec) = 160,000 bits

Therefore, band-with delay product is 160000bits

(b)
The maximum number of bits that will be in the link at any given time is the bandwidth-delay
product. This is because the link can only transmit a certain number of bits per second, and the
file is being sent continuously.
So, the maximum number of bits that will be in the link at any given time is 160,000 bits.