Similar presentations

2
Wavelength Converters A wavelength converter is modeled by a bipartite graph. For any two adjacent edges x,y, we define the corresponding conversion graph G xy =(V x,V y,E xy ) where: V x ={x 0,x 1,…x W-1 } V y ={y 0,y 1,…y W-1 } if and only if wavelength i on endpoint x can be converted to wavelength j on endpoint y (i is compatible with j on x-y ).

3
Wavelength Converters A wavelength converter is symmetric if: A full wavelength converter corresponds to a complete bipartite graph. The degree of a wavelength converter is the maximum degree of a node in the bipartite graph.

4
Full Wavelength Converters Any instance can be colored using W=L wavelengths. (In fact we need only d>=L) Proof: –Given a path, we can color its edges independently of each other, because the full conversion capability. – Consider any edge : There are at most L-1 paths other than p traversing this edge. They use at most L-1=W-1 colors. We can use any one from the remaining colors for p.

6
Expander Graphs Lemma: There is a triple ( , ,d), such that: for every sufficiently large n, there is an ( , ,d)-expander with n nodes.

7
Limited Wavelength Converters (Any Graph) Theorem: There exists two constants k>1 and d>1, such that every instance can be colored with –W=kL colors –Using wavelength converters with degree d. Proof: Between each two adjacent edges we use the converter which correspond to the ( , ,d)- expander whose existence is guaranteed by the previous lemma. Let k=1/min{  (  -1),1-  } We will prove that as long as L <= W min{  (  - 1),1-  }, any path can be colored.

8
Limited Wavelength Converters (Any Graph) Assume L <= W  (  -1) and L<=W(1-  ) Consider a path p=(e 1, e 2, …, e l ) to be colored. For any edge e 1, e 2, …, e l a color is said to be busy if it is used by another path. For any edge e i, (i>1) a color c is said to be busy also if all the colors compatible with c are busy in e i-1

9
Limited Wavelength Converters (Any Graph) Claim:There are  W colors which are not busy (idle) in e i. (By induction on i) –i=1:L<=W(1-  ), therefore there are  W colors idle in e 1. –i > 1: In edge e i+1 there are at least  W colors compatible with the idle colors of e i At most L

17
Incremental WLA in Rings Assume, therefore The algorithm would place p y in SHELF(j) for some j>i.

18
Incremental WLA in Rings The maximum load induced by the paths of SHELF(0) is d. By code inspection. The maximum load induced by the paths of SHELF(i) (i>0) is 2. –Assume otherwise. There is an edge with three paths traversing it. By previous lemma, none of them contains the other. W.l.o.g assume they are sorted by their starting points:

19
Incremental WLA in Rings By the above picture, for any set S of paths: By the first lemma: Load is non decreasing: Combining, we get: The algorithm would place p y in SHELF(j) for some j