Scribd
Upload
285 views2 pages

Networks

1. A protocol can be designed for two users communicating in a packet network to know when they can terminate their session, even if packets are arbitrarily delayed or dropped. This relates to the three armies problem in session 1.10. 2. An absent-minded professor double booked two student appointments for the same time. If the first student arrives on time but the second arrives 5 minutes late, and appointment durations are exponentially distributed with a mean of 30 minutes, the expected time between the first student's arrival and the second student's departure is calculated. 3. A program is written to determine the optimal number of items (x) used to split customers between two checkout counters at a grocery store to minimize average customer wait

Uploaded by

8085ro
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
285 views2 pages

Networks

1. A protocol can be designed for two users communicating in a packet network to know when they can terminate their session, even if packets are arbitrarily delayed or dropped. This relates to the three armies problem in session 1.10. 2. An absent-minded professor double booked two student appointments for the same time. If the first student arrives on time but the second arrives 5 minutes late, and appointment durations are exponentially distributed with a mean of 30 minutes, the expected time between the first student's arrival and the second student's departure is calculated. 3. A program is written to determine the optimal number of items (x) used to split customers between two checkout counters at a grocery store to minimize average customer wait

Uploaded by

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

INTERNATIONAL INSTITUTE OF MANAGEMENT AND

TECHNICAL STUDIES
NETWORKS
100 Marks
1) Suppose packets can get dropped or arbitrararyly delayed inside a packet
network. Suppose two users are communicating in a session and want to
terminate the session. We would like a protocol that exchanges packets in such a
way that user know that they can terminate with the knowledge that no further
packets will arrive from the user. Can such a protocol be designed? What is
relation between this problem and the 3-army problem of session1.10?
2) An absent-minded professor schedules two student appointments for the same
time. The appointment duration is independent and exponentially distributed
with 30mins.the 1st student arrives on time ,but the second student arrives 5
minutes late what is the expected time between the arrival of the first student
and departure of the second student?
3) Customer arrives at a grocery store to checkout counter according to a
Poisson process with rate per minute. Each customer carries a number of items
that is uniformly distributed between 1 and 40. The store has 2 checkout
counters, each capable of processing items at a rate of 15 per minute. To reduce
the customer wait in queue, the store manager considers dedicating a one of the
two counters to customers with x items or less and dedicating one of the two
counters to customer x items. Write a small program to find the value of x that
minimizes the average customer waiting time.
4) Give an intuitive explanation of why the maximum throughput, for small beta,
is approximately the same for CSMA slotted Aloha and FCFS splitting with
CSMA. Show the optimal expected number of packets transmitted after a state
transmission in an Aloha is the same at the beginning of a CRP for FCFS
splitting. Note that after a collision, the expected numbers are slightly different in
two systems, but the difference is unimportant since collisions are rare.
5) Consider a network with end to end window flow control applied to each virtual
circuit Assume that the data link control operates perfectly and that packets are
never thrown away inside the network. Thus packets always arrive at the
destination in the order sent, and all packets eventually arrive.
a) Suppose that the destination sends permits in packets returning to the source,
if no return packet is available for some time out period, a special permit packet
is sent back to the source. These permits consist of the number modulo m of the
next packet awaited by the destination. What is the restriction on the window size
w in terms of the modulus and why?

b) Suppose next that the permits contain the number modulo m of each of the
packets in the order received since the last acknowledgement was sent. Does
this change your answer to part (a)? Explain.
c) Is it permissible for the source to change the window size w without prior
agreement from the destination? Explain.
d) How can the destination reduce the effective window size below the window
size used by the source without prior agreement from the source? (By effective
window size we mean the maximum number of packets for the source
destination pair that can be in the network at one time.)

You might also like