This preview shows pages 1–2. Sign up to view the full content.
1
EE555: "Broadband Networks Architecture"
Professor A. Zahid, Fall Semester 2007
HW#3: Due Friday, October 5
1.
Consider the 3stage space switch with N = 16, n = 4 and k = 2
a) What is the maximum number of connections that can be supported at any
given time?
b) For a given set of inputoutput pairs, Is there more than one way to arrange
the connections over the this switch
c) Now assume that N = 32. Compare the number of crosspoints required by a
nonblocking
switch with n = 16, n = 8, n = 4, and n = 2 cases
2.
Consider the 3stage space switch. An input line is busy 10% of the time.
a) Estimate the percent of time "p" that a line between the first and the
second stage is busy. How do "n" and "k" affect "p"? How does this "p"
affect the blocking performance of the intermediate crossbar switch?
b) For a given input and output line, what is the probability that none of the
N/n paths between the input and output lines are available?
3. Design a shared memory switching system that supports a timemultiplexed
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
 Spring '08
 Silvester

Click to edit the document details