ps6sol_ee550_fall08

ps6sol_ee550_fall08 - UNIVERSITY OF SOUTHERN CALIFORNIA,...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
UNIVERSITY OF SOUTHERN CALIFORNIA, FALL 2008 1 EE 550: Problem Set # 6 Solution I. RANDOM WALK ON A FINITE CONNECTED GRAPH We guess p i = Ad i /v i , where A is a normalization constant, which can be calculated by N X i =1 p i = 1 A = 1 N i =1 d i /v i p i = d i /v i N i =1 d i /v i . Next we examine the detailed balance equations for any two node i , j on the graph. If i and j are not neighbors, then q ij = q ji = 0 and obviously the DBE holds. Otherwise, p i q ij = A d i v i v i d i = A, and similarly p j q ji = A . Thus the DBE holds. It concludes that the system is a reversible Markov chain. (The DBEs also conclude that { p i } is a steady state distribution of the random walk.) II. WAVELENGTH CONTINUITY CONSTRAINT (a) Consider the following example: (1) Session 1 arrives, using BLUE. (2) Session 2 arrives, using BLUE. (3) Session 3 arrives, using RED. (4) Session 2 departs. (5) Session 4 arrives. Then it is easy to see that session 4 will be blocked although there is a free wavelength on each link. (b) If session 4 is not ON, we can use any wavelength for S1, and use BLUE for S2 and RED for S3. If session 4 is ON, give it BLUE. Then we use RED for S1, and use RED for S2 and S3. (Note: S2, S3, and S4 can never be ON together, as this would violate the circuit switch bound at link 3.) (c)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

ps6sol_ee550_fall08 - UNIVERSITY OF SOUTHERN CALIFORNIA,...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online