Scribd
Upload
254 views5 pages

Data Communication Assignment Final PDF

This document contains a student's answers to questions on a final exam for a data communication course. The student answered questions about: 1) How multiplexing is cost-effective and how frequency division multiplexing avoids interference. 2) Requirements for effective communication over a data link such as flow control, error control, addressing, etc. 3) Explanations of congestion control techniques illustrated in a figure such as policing, implicit signaling, explicit signaling, back pressure, and choke packets. 4) A sliding window protocol example showing window positions before and after frame transmissions and acknowledgments.

Uploaded by

Fahad Ruhul
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
254 views5 pages

Data Communication Assignment Final PDF

This document contains a student's answers to questions on a final exam for a data communication course. The student answered questions about: 1) How multiplexing is cost-effective and how frequency division multiplexing avoids interference. 2) Requirements for effective communication over a data link such as flow control, error control, addressing, etc. 3) Explanations of congestion control techniques illustrated in a figure such as policing, implicit signaling, explicit signaling, back pressure, and choke packets. 4) A sliding window protocol example showing window positions before and after frame transmissions and acknowledgments.

Uploaded by

Fahad Ruhul
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Department: Computer Science & Engineering

Course Title: Data Communication


Course Code:CSE-3105
Faculty: Shah Reza Fahad Hossain

Student ID: 18304003


Name: MD. Rakibul Islam

Creative Assignmnt

Final Examination: Spring 2020


1.Explain how multiplexing is so cost-effective. How is interference avoided by
using frequency division multiplexing?
Ans:
Multiplexing is very cost effective: It is a popular networking technique that integrates multiple
analog and digital signals into a signal transmitted over a shared medium. Multiplexing helps
cost effectiveness by allowing multiple parties to share the cost of a link. The closer that you can
get the link to pure 100% utilization, the better off you are, from an efficiency perspective. Stat
muxing is especially interesting because it can typically achieve a higher real goodput than other
forms of muxing.. Interference is avoided under frequency division multiplexing by the use of
guard bands, which are unused portions of the frequency spectrum between subchannels.

Inteference avoided by using frequency division multiplexing: Interference is avoided under


frequency division multiplexing by the use of guard bands, which are unused portions of the fre-
quency spectrum between subchannels.

2. List and briefly define some of the requirements for effective communica-
tions over a data link.
Ans:
Requirements for effective communicationsover a data link layer: Because of the possibil-
ity of transmission errors, and because the receiver of data may need to regulate the rate at which
data arrive,synchronization and interfacing techniques are insufficient by themselves. It is neces-
sary to impose a layer of control in each communicating device that provides functions such as
flow control, error detection, and error control.This layer of control is known as a data link con-
trol protocol.

Flow control: It enables a receiver to regulate the flow of data from a sender so that the receier’s
buffers do not overflow.Error Control: In a data link control protocol, error control is achieved
by retransmission of damaged frames that have not been acknowledged or for which the other
side requests a retransmission.

Control Protocol: High-level data link control (HDLC) is a widely used data link control proto-
col. It contains virtually all of the features found in other data link control protocols.

Addressing: On a multipoint line, such as a local area network (LAN), the identity of the two
stations involved in a transmission must be specified

Control and data on same link: The receiver must be able to distinguish control
information from the data being transmitted.

Link management: The initiation, maintenance, and termination of a sustained data exchange
require a fair amount of coordination and cooperation among stations. Procedures for the man-
agement of this exchange are required.
3. Give a brief explanation of each of the congestion control techniques illus-
trated in the following figure.

Ans:

Congestion control techniques: there are five types of congestion control illustrated they are:
a) Policing b) Implicit Signaling c) Explicit Signaling d) Back pressure e) Choke packet

Policing: In policing, A node in the network, typically the node to which the end system attach-
es, monitors the traffic flow and compares it to the traffic contract. Excess traffic is either dis-
carded or marked to indicate that it is liable to discard or delay.

Implicit congestion signaling: In implicit, If a source is able to detect increased delays and
packet discards, then it has implicit evidence of network congestion
.
Explicit congestion signaling: Ifor explicit congestion avoidance, the network alerts end sys-
tems to growing congestion within the network and the end systems take steps to reduce the of-
fered load to the network.

Backpressure: It involves link-by-link use of flow control in a direction toward the source. This
technique produces an effect similar to backpressure in fluids flowing down a pipe.

Choke packet: A choke packet is a control packet generated at a congested node and transmitted
back to a source node to restrict traffic flow.
4. Two neighboring nodes (A and B) use a sliding-window protocol with a 3-bit sequence number. As the ARQ
mechanism, go-back-N is used with a window size of 4. Assuming A is transmitting and B is receiving, show the
window positions for the following succession of events: a. Before A sends any frames b. After A sends frames 0,
1, 2 and receives acknowledgment from B for 0 and 1 c. After A sends frames 3, 4, and 5 and B acknowledges 4
and the ACK is received by A

Ans: a)

Sender
0 1 2 3 4 5

Receiver
0 1 2 3 4 5

b)
Sender
0 1 2 3 4 5
Acknowledgement received for two bits remains in 4 bit size

Receiver
0 1 2 3 4 5
receiver has received all data hence the window

c)
Sender
0 1 2 3 4 5 6 7 0

Receiver
0 1 2 3 4 5 6 7 0
Acknowledgement received for two bits

You might also like