Optical Switching Networks. Presentation by Joaquin Carbonara. References. Work by Ngo,Qiao,Pan, Anand, Yang Chu/Liu/Zhang Pippinger/Feldman/Friedman Winkler/Haxell/Rasala/Wilfong. Introduction. Statement of the Problem. About Optical Networks.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Statement of the Problem
von Neumann, Johann (1903 - 1957)
Goethe (German writer), Maxims and Reflexions, (1829)
Definitions, Examples and Theoretical Results
f demultx, fbn LWC(Bi,[n]), fbn n-AWG,
fbn LWC([n],[bc,b(f+c)]), n multx,
nb nb-AWG, and f multx.
where i = qb+ p/n
1. [request (p, Fq, Fj)] [edge (ui,vj)] [color (c,d)]
2. Then Route p so that it ends up in the cthoutput line of its stage-1 AWGR.
3. Working from the other end, we want the request to end in Fj. There are b fibers demuxing to it. We can see that if the stage-2 LWC routes the wavelength to its dth line of its demuxer, the desired output is obtained.
4. The properties of the coloring inherited from Konig’s theorem guaranteed non-blockiness.
WXC-SNB-1 if and only if WXC-SNB-2
Graph Theoretical representations, Bounds, minimizing the number of components. Examples and theoretical results.
V=vertices, E=edges, A=inputs, B=outputs,
n1= |A|, n2=|B|.
V=vertices, E=edges, A=inputs, B=outputs
|A|=|B|=wf and B=B1 B2 ... Bf