Mumit Shawlin
111 152 229
SHORT QUESTION
Ans to the qs no 1
The hidden terminal problem occurs when a node can’t directly communicate with other nodes that
are communicating with a access point but can communicate with that wireless access point.
Ans to the qu no 2
    ■   Confidentiality
    ■   Integrity
    ■   Authentication
    ■   Operational security
Ans to the qu no 3
    ■   Bit map method
    ■   Token passing
Ans to the question no 4
802.11a is an IEEE standard for transmitting data over a wireless network. It uses a 5 GHz frequency
band and supports data transfer rates of 54 Mbps, or 6.75 megabytes per second.
Ans to the qu no 5
Quantization is used to round a bit rate by 2.
Ans to the qs no 6
Private CDN.
Content Distribution Network is the full form of the content providing servers that manages contents
geographically.
Ans to the qs no 7
    ■   Eavesdropping
    ■   Modification
                                                                                        Mumit Shawlin
                                                                                          111 152 229
Ans to the qs no 8
1. Confidentiality: Confidentiality means the data is only available to receiver and sender. Sender has
the encryption key, and the receiver has the decryption key.
2. Integrity: When the data is being transferred, the attackers won’t be able to alter the data.
3.End-point-authentication: Both sender and receiver will confirm their identity during the data
communication.
4. Operational Security: Precautions taken by both sender and receiver side to get rid of from the
attackers and different types of malicious attacks
Ans to the qs no 9
                                         Traditional Ethernet        Fast Ethernet
                 Bandwidth                     10 Mbps                 100 Mbps
                 Distance                       2500m                    250m
                 Frame size                       72B                     72B
Ans to the qs no 10
Collision detection CSMA uses its 3 stages of contention period, idle period andtransmission period.
                                                                                      Mumit Shawlin
                                                                                        111 152 229
BROAD QUESTIONS
Ans to the qs no 11
1. UDP streaming : With UDP streaming, the server transmits video at a rate that matches with
client’s video consumption rate. It is a connectionless video streaming between server to client, or
there is no handshaking between server to client. For example: To send each UDP video frame from
server to client would be (8000 bits/2 mbps) = 4000 = 4msec
2. HTTP streaming : Here the video is stored in a HTTP server as a normal file with a specific URL.
When the client wants to see the video, client can go to the URL and see the video. It is also called
TCP streaming. When the client enters the url, a tcp connection request is being sent to the http
server. Client can see the video after the connection is established.
3. Adaptive HTTP streaming : example of adaptive HTTP streaming is youtube.
Ans to the qs no 12
Principles of cryptography: Convert the data in some unreadable form. This helps in protecting the
privacy while sending the data from sender to receiver.
Types of text available in cryptography:
1. Plaintext: Original form of the message. For example: I love my country. J iowf nz dpvmusz (k=1)
2. Ciphertext: Encrypted text that are being encrypted by encryption algorithm. They are called
ciphertext.
Two types key to use encryption and decryption:
1. Symmetric key: More secured. There are secret keys, ythat only available to sender and receiver.
Sender will have symmetric encryption key, and receiver will have symmetric decryption key.
2. Public key: It is an open secret key, which means a single key can be available to both sender and
receiver. Other parties rather than sender and receiver will also have the knowledge about how to
decrypt the data.
                                                                                          Mumit Shawlin
                                                                                            111 152 229
Ans to the qs no 13
1. Aloha : Pure Aloha, Slotted Aloha
2. Carrier Sense : Carrier-sense multiple access is a media access control protocol in which a node
verifies the absence of other traffic before transmitting on a shared transmission medium.
A. Persistent CSMA : Carrier Sense Multiple Access
Station first checks if there is any packet being transferred or not. If there is any packet in the
channel, then the station waits for the channel to get free and then the station sends the packet.
(Station waits for a while for the channel to get free and then sends the packet)
B. Non persistent CSMA : The station first checks the channel if it is free. If the channel is not free,
the station waits for a while and then again checks the channel if it is free or not. In this method the
station uses a repeater algorithm to check the channel after some specific interval of time.
Advantage is better channel utilization
Disadvantage is longer delay then persistent CSMA,
C. P- Persistent CSMA. : Used in slotted channels (Slotted channels are those channels where the
packet transfer is slotted based on time. Here, the station first checks if the channel is idle or not. If
the channel is free, the station sends the packet with a probability p, If the slot is deferred, next time
it will send with the probability of q, where q = 1-p.
3. Collision detection CSMA: It is used in the classic Ethernet LAN. Transmission station reads the
transmitting data and if there is any problem then there is any collision happen.
There are 3 states in Collision detection CSMA: Contention period, transmission period, idle period.
4. Collision free protocol:
A) Bit map method: If there are N number of slot, so stations are 0-N-1. If the station 0 has a frame
to send, it transmits 1 bit size of frame in the slot. When the station is sending a frame, no other
station is allowed to transmit during the slot. Another name for bit map protocol is reservation
protocol.
B) Token passing: Token passing or Bus passing happens in Ring topology. In a ring topology when a
station sends a frame to another station, it sends a small message to the receiver, which is called a
token.
                                                                                       Mumit Shawlin
                                                                                         111 152 229
Ans to the qs no 14
Properties of video: To make video file stream easily. There are three types of compressing method.
1. Spatial redundancy: Spatial redundancy happens when a video or image file consists mostly
white spaces. So spatial redundancy redundant those white spaces to a high degree so that the
video or image file gets compressed without compromising the quality.
2. Temporal redundancy: Partial image gets repetition from similar image of that video or image
file. It happens with the video block which are not white and having other colors.
3. Multiple version: It doesn’t compress the video, rather it stores multiple versions of a video in
the video server or the file server. User streams the preferable video based on their bandwidth
speed. Example is YouTube, where we can choose the preferable version of video we want to watch.
720p, 1080p, 4k.
Properties of audio: The audio files that we download from internet converts from analogue audio to
digital audio.
1. Quantization: If the audio signal is streaming at 8000 samples per seconds (8 bits per sample)
then the audio file size will be 64 kbps. So when the audio file is streaming in internet the file has
specific value of finite number, which is called quantization. Which is power of two. For example,
256, 128, 64
2. When the audio file is playing on audio speakers, the digitally converted files will again be
converted back to analogue audio files. So that the high frequency sounds maybe missing.
                                                                               Mumit Shawlin
                                                                                 111 152 229
MATHS
Ans to the qs no 1
Arrival rate, λ = 3000 frames/sec
Channel capacity, C = 12 Mbps = 12 * 10, 00, 000 bps = 12 6 = 12,000,000 (channel capacity is
basically in bits/second)
Frame size, 1/μ = 78932 bits/ frame , μ = 1.267 -5
T = 1/ (μC – λ)
= 1/ ((1/1.267-5)*126) – 3000
= 1/(-2999.9*126 )- 3000)
=1.027-7
=0.0000001 frames per second
= 0.0001 frames per milliseconds
Ans to the qs no 2
Arrival rate, λ = 2796 frames/sec
Channel capacity, C = 18 Mbps = 12 * 10, 00, 000 bps = 18 6 = 12,000,000 (channel capacity is
basically in bits/second)
Frame size, 1/μ = 82302 bits/ frame , μ = 1.215 -5
T = 1/ (μC – λ)
= 1/ ((1/1.215-5)*186) – 2796
= 1.1104-8
=0.433 frames per second