Cn1dc July 2016 Qp Solution
Cn1dc July 2016 Qp Solution
Cn1dc July 2016 Qp Solution
PART – A
“Data communications are the exchange of data between two devices via some form of
transmission medium such as a wire cable”.
➢ Simplex:
In simplex mode, the communication is unidirectional, as on a one-way street. Only one of
the two devices on a link can transmit; the other can only receive (see Figure 1.2a).
➢ Half-Duplex:
In half-duplex mode, each station can both transmit and receive, but not at the same time.
When one device is sending, the other can only receive, and vice versa (see Figure 1.2b).
Example: Walkie-Talkie.
➢ Full-Duplex:
In full-duplex mode (also called duplex), both stations can transmit and receive
simultaneously (see Figure 1.2c).
Example: Telephone network. (Both can talk and listen at the same time)
1 b) With sketch, explain two types of wide area network in use. (04 M)
We see two distinct examples of WANs today: point-to-point WANs and switched WANs.
Point-to-point WANs
Switched WAN
A switched WAN is a network with more than two ends. A switched WAN, as we will see
shortly, is used in the backbone of global communication today.
We can say that a switched WAN is a combination of several point-to-point WANs that
are connected by switches.
1 d) Give four levels of addresses used in TCP/IP protocol and give its significances. (04 M)
Refer 1(c) July 2015 solved QP
“Transmission of signals using modulation of a higher frequency signal.” The term implies a
wide-bandwidth data combined from different sources.
iv. SNR:
“The latency or delay defines how long it takes for an entire message to completely arrive
at the destination from the time the first bit is sent out from the source.”
Components:
2 c) Draw the graph of the NRZ-L, NRZ-I, Manchester, differential Manchester scheme
using each of the following data streams, assuming that the last signa11evel has been
positive.
a. 00000000 b. 11111111 c. 01010101 d. 00110011
2 d) Give the block diagram of PCM encoder and state the role of each processes.
Sampling:
• The first step in PCM is sampling. The analog signal is sampled every Ts s, where Ts
is the sample interval or period.
• The inverse of the sampling interval is called the sampling rate or sampling
frequency and denoted by fs, where fs = 1/Ts.
• There are three sampling methods-ideal, natural, and flat-top.
Quantization
• The result of sampling is a series of pulses with amplitude values between the
maximum and minimum amplitudes of the signal.
• The set of amplitudes can be infinite with nonintegral values between the two limits.
Encoding:
The last step in PCM is encoding. After each sample is quantized and the number of bits
per sample is decided, each sample can be changed to an nb-bit code word.
“In synchronous TDM, each input connection has an allotment in the output even if it
is not sending data.”
• In synchronous TDM, the data flow of each input connection is divided into units, where
each input unit occupies one output time slot. A unit can be 1 bit, one character, or one
block of data.
• Each input unit becomes one output unit and occupies one output time slot.
• However, the duration of an output time slot is n times shorter than the duration of an
input time slot. If an input time slot is T s, the output time slot is T/n s, where n is the
number of connections.
• In synchronous TDM, a round of data units from each input connection is collected into
a frame. If we have n connections, a frame is divided into n time slots and one slot is
allocated for each unit, one for each input line. If the duration of the input unit is T, the
duration of each slot is T/n and the duration of each frame is T.
Statistical TDM
• As we saw in the previous section, in synchronous TDM, each input has a reserved slot
in the output frame.
• This can be inefficient if some input lines have no data to send.
• In statistical time-division multiplexing, slots are dynamically allocated to improve
bandwidth efficiency. Only when an input line has a slot’s worth of data to send is it
given a slot in the output frame.
• The multiplexer checks each input line in round robin fashion; it allocates a slot for an
input line if the line has data to send; otherwise, it skips the line and checks the next
line.
➢ Figure above shows a synchronous and a statistical TDM example. In the former, some
slots are empty because the corresponding line does not have data to send.
➢ In the latter, however, no slot is left empty as long as there are data to be sent by any
input line.
The pattern for this station is 101, 111, 001, 000, 010, all, 100. Note that the pattern is
pseudorandom it is repeated after eight hopping’s. This means that at hopping period 1,
the pattern is 101. The frequency selected is 700 kHz; the source signal modulates this
carrier frequency. The second k-bit pattern selected is 111, which selects the 900-kHz
carrier; the eighth pattern is 100, the frequency is 600 kHz. After eight hopping’s, the
pattern repeats, starting from 101 again. Figure shows how the signal hops around from
carrier to carrier. We assume the required bandwidth of the original signal is 100 kHz.
4 b) Find codeword, using cyclic redundancy code given generator 1011, data word
1001 and show how it is used to check for error detection in the receiver side. (08 M)
Refer 4(c) Jan 2014 solved QP
5 a) With neat sketch, explain two approaches used in variable size framing.
Character-Oriented Framing:
➢ Character-oriented framing was popular when only text was exchanged by the data-
link layers. The flag could be selected to be any character not used for text
communication.
➢ Now, however, we send other types of information such as graphs, audio, and video,
any character used for the flag could also be part of the information.
➢ If this happens, the receiver, when it encounters this pattern in the middle of the
data, thinks it has reached the end of the frame.
➢ In byte stuffing (or character stuffing), a special byte is added to the data section of
the frame when there is a character with the same pattern as the flag. The data
section is stuffed with an extra byte. This byte is usually called the escape character
(ESC) and has a predefined bit pattern.
➢ Whenever the receiver encounters the ESC character, it removes it from the data
section and treats the next character as data, not as a delimiting flag.
Bit-Oriented Framing:
➢ This flag can create the same type of problem we saw in the character-oriented
protocols. That is, if the flag pattern appears in the data, we need to somehow
inform the receiver that this is not the end of the frame.
➢ We do this by stuffing 1 single bit (instead of 1 byte) to prevent the pattern from
looking like a flag. The strategy is called bit stuffing.
➢ In bit stuffing, if a 0 and five consecutive 1 bits are encountered, an extra 0 is added.
This extra stuffed bit is eventually removed from the data by the receiver.
➢ Note that the extra bit is added after one 0 followed by five 1s regardless of the
value of the next bit. This guarantees that the flag field sequence does not
inadvertently appear in the frame.
5 c) What are the three types of HDLC frames used in HDLC bit oriented protocol?
Explain its significance with its structure. Show how that frames can be used for
exchange of data using piggy backing. (08 M)
6 c) Give the details of minimum and maximum length of Ethernet frame. With an
example, explain the format of Ethernet addresses. (06 M)
• An Ethernet frame needs to have a minimum length of 512 bits or 64 bytes. Part of this
length is the header and the trailer. If we count 18 bytes of header and trailer (6 bytes of
source address, 6 bytes of destination address, 2 bytes of length or type, and 4 bytes of
CRC), then the minimum length of data from the upper layer is 64 - 18 = 46 bytes. If the
upper-layer packet is less than 46 bytes, padding is added to make up the difference.
• The standard defines the maximum length of a frame (without preamble and SFD field)
as 1518 bytes. If we subtract the 18 bytes of header and trailer, the maximum length of
the payload is 1500 bytes. If the upper-layer packet is more than 1500 bytes,
Fragmentation technique is used.
• Preamble. The first field of the 802.3 frame contains 7 bytes (56 bits) of alternating
0s and 1s that alerts the receiving system to the coming frame and enables it to
synchronize its input timing.
• Start frame delimiter (SFD). The second field (1 byte: 10101011) signals the
beginning of the frame. The SFD warns the station or stations that this is the last
chance for synchronization. The last 2 bits is 11 and alerts the receiver that the next
field is the destination address.
• Destination address (DA). The DA field is 6 bytes and contains the physical address
of the destination station or stations to receive the packet.
• Source address (SA). The SA field is also 6 bytes and contains the physical address
of the sender of the packet.
• Length or type. Define upper layer protocol, length: the number of bytes in data
field Data. It is a minimum of 46 and a maximum of 1500 bytes.
• CRC. The last field contains error detection information, in this case a CRC-32.
The standard defines two kinds of services: the basic service set (BSS) and the extended
service set (ESS).
➢ An extended service set (ESS) is made up of two or more BSSs with APs.
➢ In this case, the BSSs are connected through a distribution system, which is usually a wired
LAN. The distribution system connects the APs in the BSSs.
➢ The extended service set uses two types of stations: mobile and stationary. The mobile
stations are normal stations inside a BSS. The stationary stations are AP stations that are part
of a wired LAN.
➢ When BSSs are connected, the stations within reach of one another can communicate without
the use of an AP. However, communication between two stations in two different BSSs
usually occurs via two APs.
Addressing Mechanism
The IEEE 802.11 addressing mechanism specifies four cases, defined by the value of
the two flags in the FC field, To DS and From DS. Each flag can be either 0 or 1, resulting in
four different situations. The interpretation of the four addresses (address 1 to address 4)
in the MAC frame depends on the value of these flags, as shown in table below:
Table: Addresses
• Case 1: 00 In this case, To DS = 0 and From DS = 0. This means that the frame is not
going to a distribution system (To DS = 0) and is not coming from a distribution system
(From DS =0). The frame is going from one station in a BSS to another without passing
through the distribution system. The ACK frame should be sent to the original sender.
The addresses are shown in figure above.
• Case 2: 01 In this case, To DS = 0 and From DS = 1. This means that the frame is
coming from a distribution system (From DS = 1). The frame is coming from an AP and
going to a station. The ACK should be sent to the AP. The addresses are as shown in
figure above.
• Case 3: 10 In this case, To DS =1 and From DS = 0. This means that the frame is going
to a distribution system (To DS = 1). The frame is going from a station to an AP. The ACK
is sent to the original station. The addresses are as shown in figure above.
• Case 4: 11 In this case, To DS =1 and From DS =1. This is the case in which the
distribution system is also wireless. The frame is going from one AP to another AP in a
wireless distribution system. Here, we need four addresses to define the original
sender, the final destination, and two intermediate APs. Figure above shows the
situation.
7 c) Show two types of networks used in Bluetooth. Explain in brief the same (06 M)
Piconets
Figure: Piconet
Scatternet
Figure: Scatternet
• Piconets can be
combined to form what
is called a scatternet.
• A secondary
station in one piconet
can be the primary in
another piconet.
• This station can
receive messages from
the primary in the first piconet (as a secondary) and, acting as a primary, deliver them to
secondaries in the second piconet.
• A station can be a member of two piconets.
8 b) Give the IPv4 datagram format and brief description of each field (10 M)
Version (VER): This 4-bit field defines the version of the IPv4 protocol. Currently the
version is 4. However, version 6 (or IPng) may totally replace version 4 in the future.
Header Length: The 4-bit header length (HLEN) field defines the total length of the
datagram header in 4-byte words. The IPv4 datagram has a variable-length header.
However, to make the value of the header length (number of bytes) fit in a 4-bit header
length, the total length of the header is calculated as 4-byte words. The total length is
divided by 4 and the value is inserted in the field. The receiver needs to multiply the
value of this field by 4 to find the total length.
Service Type: In the original design of the IP header, this field was referred to as
type of service (TOS), which defined how the datagram should be handled.
Total Length: This 16-bit field defines the total length (header plus data) of the IP
datagram in bytes. This field helps the receiving device to know when the packet has
completely arrived. To find the length of the data coming from the upper layer, subtract
the header length from the total length. The header length can be found by multiplying
the value in the HLEN field by 4.
Identification, Flags, and Fragmentation Offset: These three fields are related to the
fragmentation of the IP datagram when the size of the datagram is larger than the
underlying network can carry. We discuss the contents and importance of these fields
when we talk about fragmentation in the next section.
Protocol: This 8-bit field defines the higher-level protocol that uses the services of the
IPv4 layer. An IPv4 datagram can encapsulate data from several higher-level protocols
such as TCP, UDP, ICMP, and IGMP. When the payload is encapsulated in a datagram at
the source IP, the corresponding protocol number is inserted in this field; when the
datagram arrives at the destination, the value of this field helps to define to which
protocol the payload should be delivered
Header checksum: IP is not a reliable protocol; it does not check whether the payload
carried by a datagram is corrupted during the transmission. The datagram header,
however, is added by IP, and its error-checking is the responsibility of IP. Errors in the
IP header can be a disaster.
Source and Destination Addresses: These 32-bit source and destination address
fields define the IP address of the source and destination respectively. Note that the
value of these fields must remain unchanged during the time the IP datagram travels
from the source host to the destination host.
Options: A datagram header can have up to 40 bytes of options. Options can be used
for network testing and debugging.
End of Option: An end-of-option option is a 1-byte option used for padding at the end
of the option field. It, however, can only be used as the last option.
Record Route: A record route option is used to record the Internet routers that handle
the datagram. It can be used for debugging and management purposes.
Strict Source Route: A strict source route option is used by the source to
predetermine a route for the datagram as it travels through the Internet. Dictation of a
route by the source can be useful for several purposes. The sender can choose a route
with a specific type of service, such as minimum delay or maximum throughput.
Alternatively, it may choose a route that is safer or more reliable for the sender's
purpose
Loose Source Route: A loose source route option is similar to the strict source route,
but it is less rigid. Each router in the list must be visited, but the datagram can visit
other routers as well.