ECEN4533 Exam #1 28 February 2011

1) There has actually been some research looking into some of the problems associated with an
inter-planetary Internet. Suppose IP traffic is transmitted between a station on Earth and a station
on the Moon, 472,000 km away at the time of transmission. The propagation speed on this 51
Mbps link is 3 x 108 meters/second.
1a) [10] How many 1500 byte packets, transmitted back-to-back, could simultaneously be in
transit over this link? In other words, how many 1500 B packets can be injected into this link by
the Earth station before the leading edge of the first packet reaches the station on the Moon?
[Answer: 6,686]
1b) [15] Suppose ten 1500 byte packets are to be transmitted back-to-back from Earth to the
Moon. The Moon station will send a 50 byte acknowledgment (ACK) packet back to the Earth
immediately upon the successful receipt of each packet. All packets and ACK's are transmitted
error free. A timer is started when the Earth station injects the leading edge of the 1st packet, and
stopped when the Earth station receives the trailing edge of the tenth ACK. Compute this time.
[3.146 seconds]

<<<<<>>>>>

2) A routing table has the following entries, with associated packet output ports.
128.10.4.0/24 Port 1
128.10.4.0/26 Port 3
128.10.4.0/28 Port 4
128.10.4.0/30 Port 2
[10] A packet is received with the destination address 128.10.4.5. Onto which output port will
the router place this packet? Explain. [Port 4 as it has the longest match.]

3) The traffic matrix below shows the units of traffic that must be moved between four cities. For
example the amount of traffic to be moved from Oklahoma City to Detroit is 25 units. Suppose
this traffic is to be moved using a bus configuration shown.
[15] Compute the amount of traffic that must be moved over each link, in each direction.

\ To OKC Detroit NYC Boston

From
OKC - 25 64 49
Detroit 21 - 59 16
NYC 16 40 - 51
Boston 6 12 86 -

Page 1 of 2
[Boston ± NYC 104, NYC ± Boston 116, NYC ± Detroit 74, Detroit ± NYC 188, Detroit ±
OKC 43, OKC ± Detroit 138]

<<<<<>>>>>

4) Five equal sized 1500 byte packets arrive from various input links and are placed in a router's
empty first-in, first out output queue at times t = 0, 14, 58, 113, and 167 microseconds. Once a
packet is number one in the queue, it is moved to the "server" and begins to be injected on the 87
Mbps output trunk immediately. Hence the leading edge of packet number 1 begins to be injected
on the output trunk at time t = 0.
4a) [10] Sketch a time line showing when the leading and trailing edge of these five packets are
placed on the output trunk. [The time line should show 5 packets stacked back-to-back, with #1
commencing transmission at t = 0, #2 commencing at 137.9 ìsec, #3 at 275.8 ìsec, #4 at 413.7
ìsec, and #5 at 551.6 ìsec. Numbers 1-4 end transmission when numbers 2-5 respectively start.
#5 ends transmission at t = 689.5 ìsec.]
4b) [15] Define the time a packet spends in the system T = (time a packet's trailing edge is
injected onto the trunk) - (time the packet arrives at the output queue). Compute the average
time spent in the system E[T] for these five packets. [343.3 ìsec]

<<<<<>>>>>

5) A packet switch contains two 64 Kbps input lines and one 112 Kbps output line. One 64 Kbps
input is active 11% of the time, and the other is active 41% of the time. Assume the packet Inter-
Arrival Times are exponentially distributed, and the packet sizes are also exponentially distributed
with a mean size of 1170 bytes.
5a) [5] Compute the load ñ on the output line. [29.71 %]
5b) [10] Compute the average number of packets in the switch. [0.4228]
5c) [10] Compute the average time a packet spends in the switch. [35.33 msec]

Page 2 of 2