Académique Documents
Professionnel Documents
Culture Documents
Problem 1
Consider a broadcasting bus system as shown in Figure 1. Attaching to the bus
are N stations, and they share the channel under pure ALOHA scheme. Suppose that
the transmission rate is R (bits/sec), and the message size is M data bits. Neglect
the effect of propagation delay. Let Ti denote the idle time for station i. Suppose
that Ti is exponentially distributed with parameter i , and {Ti | i = 1, 2, . . . , N} is a
set of independent random variables.
Statin i
1
i+1
Broadcasting Bus
Problem 2
Consider a slotted token ring system with N stations. The token travels in the
counter clockwise direction as shown in Figure 2. In this polling system, a busy
station will capture the token and hold it for the duration of its frame transmission.
It then releases the token and makes it available for capture by the neighboring
station along the ring network. Assume for our analysis that each station holds
the token for a random period of time. Let Hi denote the token holding time of
station i (measured in units of slots). Assume that {Hi | i = 1, 2, . . . , N} is a set
of independent and identically distributed (i.i.d.) random variables. We also assume
1
EE132B-HW Set #3
Station
1
2
3
Token ring
direction
H1
H2
H3
Station N
Station 2
Station j
Station 3
HN
Figure 2: The slotted token ring network with example of four stations
(a) Neglect the propagation delay in the system. Suppose that station 1 receives
the token at the start of time slot 0. Calculate the probability that station 3
receives the token at the start of slot k. Note that k can be equal to 0, since
we neglect the propagation delay as well as assume (as an approximation) that
a non-busy station will hold the token for negligible period of time that is set
here equal to 0.
(b) The probability that station 1 will receive the token again at the start of slot
k. (Hint: The sum of r i.i.d. Geometric random variables with parameter p
follows a negative binomial distribution with parameter (r, p).)
(c) Suppose that the propagation delay from any station to its adjacent station is
slots. What is the throughput rate of this system? (HINT: Consider a cycle
period (occurring between successive visits of the token to the same station).
Calculate the throughput rate as the ratio between the average amount of "work"
performed by stations during a cycle to the average duration of the cycle. A
station is said to perform "work" when it holds the token; its amount of "work"
is set equal to the time that it holds the token.)
Problem 3
(a) In a few words, describe the most significant difference between circuit-switching
and packet-switching systems. Is email system a circuit-switching or a packetswitching system?
(b) Outline the key differences between datagram and virtual-circuit switching systems.
(c) Consider the following situations in conjunction with multiple access schemes.
Which multiple access scheme is typically employed in each situation?
2
EE132B-HW Set #3
Problem 4
A
C
D
E
1
2
3
4
4 by 4
switch
1
2
3
4
K
L
M
Time-division multiplexer
EE132B-HW Set #3
Input Port
Line NO.
2
4
3
1
1
3
2
4
Slot NO.
1
2
2
2
1
1
2
1
Output Port
Line NO.
1
3
2
4
2
3
4
1
Slot NO.
1
1
1
2
2
2
1
2