Sessional 1: Networking Solutions and Concepts, Exercises of Data Communication Systems and Computer Networks

The solutions and concepts related to various networking components, including packet switching networks, tcp/ip stack, and global buffer number (gbn) and selective repeat (sr) protocols. It also discusses the role of layers and protocols in networking, as well as persistence without pipelining, conditional get, and email protocols (pop and smtp).

Typology: Exercises

2011/2012

Uploaded on 07/26/2012

shakti
shakti 🇮🇳

4.4

(19)

99 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Sessional 1
1 of 4
Sessional 1 Solution
Component 1: Section 1
True/False
1. False
2. False
3. False
4. True (if window size=1), False otherwise
5. True
6. True
7. False
8. False
9. False
10. True
Component 1:Section 2
Short Answers
1. Since in packet switched networks the resources are not reserved along the route
from source to destination so the upper bound on delay is not guaranteed. The
service can severely degrade in time of congestion.
2. [There are various camps which support different techniques to support video in
the statistically multiplexed networks e.g. one is that there must be classes of
network traffic given different priority (its like ensuring or allocating resources in
need basis).]
In TCP/IP stack, video is supported using UDP.
3. Packet-switch buffer is full
Packet is corrupted (most DLL protocols check the integrity of the frame so it can
drop at packet-switch/intermediate nodes)
Packet is duplicated (packet is dropped at receiver)
Receivers buffer is full
4. In the case of GBN, n packets/frames have same timeout timer (simple:
advantage), since it uses cumulative acknowledge in case of timeout sender has to
send all the previously unacknowledged packets/frames (disadvantage). In
selective repeat SR each packet has its own timeout timer (complex:
disadvantage). In the case of timeout only the unacknowledged packet is sent
(disadvantage). Generally if there is high rate of packet loss and bit errors, then
SR is better than GBN.
5. Layers implement protocols. There has to be a protocol on which a layer works so
they are not mutually exclusive. Also a “thing” cannot be a protocol and a layer at
the same time so they are mutually exclusive in this respect.
docsity.com
pf3
pf4

Partial preview of the text

Download Sessional 1: Networking Solutions and Concepts and more Exercises Data Communication Systems and Computer Networks in PDF only on Docsity!

1 of 4

Sessional 1 Solution

Component 1: Section 1 True/False

**1. False

  1. False
  2. False
  3. True (if window size=1), False otherwise
  4. True
  5. True
  6. False
  7. False
  8. False**
  9. True

Component 1:Section 2

Short Answers

  1. Since in packet switched networks the resources are not reserved along the route from source to destination so the upper bound on delay is not guaranteed. The service can severely degrade in time of congestion.
  2. [There are various camps which support different techniques to support video in the statistically multiplexed networks e.g. one is that there must be classes of network traffic given different priority (its like ensuring or allocating resources in need basis).] In TCP/IP stack, video is supported using UDP.
  3. Packet-switch buffer is full Packet is corrupted (most DLL protocols check the integrity of the frame so it can drop at packet-switch/intermediate nodes) Packet is duplicated (packet is dropped at receiver) Receivers buffer is full
  4. In the case of GBN, n packets/frames have same timeout timer (simple: advantage), since it uses cumulative acknowledge in case of timeout sender has to send all the previously unacknowledged packets/frames (disadvantage). In selective repeat SR each packet has its own timeout timer (complex: disadvantage). In the case of timeout only the unacknowledged packet is sent (disadvantage). Generally if there is high rate of packet loss and bit errors, then SR is better than GBN.
  5. Layers implement protocols. There has to be a protocol on which a layer works so they are not mutually exclusive. Also a “thing” cannot be a protocol and a layer at the same time so they are mutually exclusive in this respect.

2 of 4

  1. Refer to figure 3.20: Extended FSM description of GBN sender
  2. Boxes represent servers and contain their names and the kind of entries they contain except local DNS server.
  3. In persistence without pipelining, same connection can be used for several requests between the same client and server so bandwidth is not wasted in reestablishing the connection (advantage) but since requests are sent in non- overlapped fashion so connection is idle most of the time wasting bandwidth (disadvantage).
  4. Conditional GET is a GET request that only gets the data from the server if the copy in the cache is stale OR does not exist. This saves bandwidth by not transferring the data in case it has not been modified at the server.
  5. POP is for retrieving email from the server. SMTP is to send the mail.
  6. DSL is not shared and the bandwidth is completely dedicated to the user. In HFC the medium is shared so in case of more users the bandwidth is shared by all of them. DSL has disadvantage that it runs over short distances.
  7. There are few Tier1 ISPs, their international coverage, their interconnection and their connectivity to lower-tier ISPs result in global connectivity. Lowest-Tier ISP are local ISPs and anyone can be their customer, since they are interconnected and connected to higher-tier ISPs so their customers have global access.

Component 2: Q

(a) The time to send the 2346-byte packet from A to the switch will consist of transmission time and propagation delay. The transmission time is 2346 bytes/11Mbps = 2346 * 8/(11 * 10 6 ) seconds = 1706μs. So the switch will receive the last bit of the packet after 1706+20 = 1726μs.

Local DNS dns.case. edu.

[email protected]

Root DNS Server uk k (^) TLD Server co.uk Ac uk

TLD Server bbc.co.uk

Auth. Dom. Server *.bbc.co.uk

4 of 4

the window size) shows how many bits can be on the fly. If Bandwidth delay product is less than the send window then it limits how many bits can be sent and the peak rate is 8Npkt/T’ otherwise the send window is the limiting factor and the sender can send 8Npktx bits in Tpkt (from part a) time. In latter case we can send x packets (a complete window) in Tpkt time

e) No of packets L/(8xNpkt) x T’ if bandwidth delay is less than send window or L/(8*Npkt x ) Tpkt.