CSCS 311

Computer Networks
Home Work I

Saqib Atiq
12-10564

21st Oct 2010

 Computer Networking CSCS311
Review Questions

Ans 1: A host and an end system are the same thing. Any system connected to the
computer network is called a host or end system. Web TV, Mobile computers (Laptops)
pagers and even a toaster are the devices connected to the internet network are example
of hosts. Yes, a server is also an end system.

Ans 3: A client program is an application program running on a client, while the same a
server program is also an application program running on server which make them client
or server devices through which they talk to each other by passing messages. No, not a
server requests rather a client requests from the server for the services.

Ans 8: I am unable to understand the question statement.

Ans 16: There are different transmission rates for the Ethernet LANs they are available
in 10 Mbps, 100 Mbps and 1 Gbps. Not every user connected to the local area can
transmit the files at the same rate. They will have to face some delays in transmission.

Ans 17: Ethernet LANs can run over the different Media as coaxial cables, twisted pair
cables, copper wire or fiber optics.

Ans 21: There are five layers in Internet Protocol Stack

Application Layer: Is responsible for the applications running over the network
Transport Layer: Is responsible for the transporting of the messages between client and
servers.
Network Layer: Is responsible for routing of the datagram from one to another host
Link Layer: Is responsible for specifying the route for the packets (Message) from
different and to different switches from source to destination.
Physical Layer: Is responsible for putting message (Data) onto the physical media.
Problems

Ans 2:
a) Yes, a circuit switch network will be appropriate for these phenomena. As it is
a long term and low bandwidth connection so to have continuous propagation of data it
will be good choice as it has a stand alone way to transfer data to the only existing
devices.
b) No there won’t be need of any congestion control as we have the entire link’s
capacity more than the sum of all application’s data.

Ans 3:
a) As told in the statement that each link has “n” circuits and can accommodate
“n” simultaneous connections. Thus for the given figure there are 4 links that means it
can accommodates 4n simultaneous connections.
b) For each of the link there are “n” possible connections, n for the upper-left-
hand and n for the lower-right-hand. Thus 2n simultaneous connections are possible.

Ans 7:
When packet reached at B it behaves like A that converts the signal into 48-bytes
that is in 48 x 8 bps / 64 x 1000 bps = .006 sec.
While A converts the signal in 48 x 8 bps / 1 x 1000 x 1000 bps = .000384 sec
Time to establish the connection is 2msec
So total delay for the whole process will be .006 + .000384 + .002 sec
That is total of .008384 sec

Ans 14:
a)We know that time for propagation delay is d/s where d is the total distance
between the nodes and ‘s’ is the speed of the propagation thus we have time for
propagation 10000 x 1000 meters / 250000000 meters/sec = .04 sec. For the given
formula R * t (prop) we have 1 x 1000 x 1000 bps * .04 sec = 40,000 bits
b)
c)
d) For the width of the bit we have the expression d = s/R where‘d’ is the length
of the bit. So d = 250000000 / 1 x 1000 x 1000 => 250m. I think that is more than the
length of a football ground.
e) From (15a) we have an expression R * m / s from this we can get width
(length) of a bit that is R = s / m => m = s/R
Ans 15:
We have t (prop) = .04sec. We want bit to be 10000 x 1000 meters long.
R * d / s => R = s /d => 250000000 / 10000 x 1000m = 25bps

Ans 17:
a) For a total time of the file to be sent from one host to another is the sum of the
time of transmission and propagation. That we have here is
Transmission delay = L / R (L is total message length and R is bandwidth of the link)
So 400,000 / 1 x 1000 x 1000 = .4sec
Propagation delay = d / s (d total distance of wire, s is speed of propagation)
So 10,000 x 1000 m / 250000000 m/s = .04sec
Total time is .4+.04 = .44sec
b)
c) There is a huge difference in above 2 results; one is too low while other is
much greater compare to first one. That is not a good result.

Discussion Questions

Ans 3:
PC to Phone is the mechanism of calling from Personal Computer to the Phones
via internet connection. There are many companies providing the facility of PC to phone
calls one cheap rates, the companies doing this business are
www.skype.com
www.yahoo.com
www.gmail.com
www.icq.com

Ans 7:
Following are the companies providing p2p file sharing services
www.nepster.com provides music files
www.limewire.com provides audio files sharing
www.piratebay.com provides torrent service
www.bittorrent.com provides torrent service
www.qtrax.com [1] provides music files
Ans 8:
IM or Instant Messaging is the free facility provided by some companies in which
two or more user can pass text messages to each other through software. In answer 3
almost all companies provide the IM services.

PROBLEM 1
1
http://www.p2p-weblog.com/50226711/companies.php
 a)
(i) We know that throughput is the fraction of useful data over total data sent so for
circuit switching throughput expression would be like
We have total length of message L that’s useful data we need to be sent
While there are 3 requests in connection creating and terminating of size H bits that is 3H
and the expression becomes L / L + 3H where ‘h’ is the size of header with the message.
(ii)We know in circuit switching there must be sometime taken to establish the
connection suppose we take it T, according to the definition of message delay.
Transmission delay that takes a message to leave host1 is L/W. We know that the time
for sending a message (packet) of L bits from one host to another in circuit switching is
the propagation delay that is given as ‘τ’. Thus total time in message delay would be T +
L/W + τ.
b)
(i) In message switching the throughput expression is L-H / L
(ii) Message switching works on store and forward manner. Each switch has to store the
whole message and then forward it. Each switch then has to transmit the message onto
the link as well. So there are a few things involve in this delay say L/W as transmission
delay time for one switch, we have ‘τ’ as propagation delay, as we have ‘k’ many links
between them then ‘kτ’ time to reach one whole message from one host to destination.
And total message delay would be k-1(L/W) + kτ.
c)
(i) In packet switching there’s no need to establish a connection, throughput for this
would be P that is our required useful data while P * L/P-H is useful data that would be
sent including. So (P * L/P)-H / L
(ii) Message delay for this would be the total propagation delay plus total transmission
delay from host1 to host2. Transmission delay k-1(L/W) plus propagation delay kτ.
(k-1(L/W) + kτ) L/P where L/P is the total numbers of packets
d)
Highest throughput will be in Message switching then circuit switching and at the last
packet switching according to the throughput.
e)
For ‘τ = 0’ the only delay will be transmission delay in sending the data. For H < P there
will be no effect except the time reduction in connection establishment and a decrement
in message delay. While for large numbers of k, the propagation delay will increase
hence the message delay will increase in each scenario.