Supporting data of graph representations for programmable photonic circuits

Supporting data of graph representations for programmable photonic circuits

Abstract: 

This DataPort contains supporting data of paper entitled Graph Representations for programmable photonic circuits for the Journal of Lightwave Technology. All unreachable nodes for the first graph are tested in the undirected graph with arbitrary negative weight. Unphysical paths are found on all 21 nodes. These same terminal nodes are validated in a directed graph with and without artificial nodes representing the same optical port overlapping each other. An example congestion negotiation is built on top of the single input-output pair case for 6 pair edge-disjointed shortest paths with constraints specifically for programmable photonic circuits. After several iterations with user-defined violation cost, it finds a valid solution. An animation is made based on real-time algorithm visualization on these iterations. 

Instructions: 

Folders in multipair_congestion_cost_iterations.zip:

 

1.edgeweight10541: graph with arbitrary edge weigh: bar 10, cross 5, phaseshifter 4, waveguide 1 (penalty 1 vs 2 comparison: 92 iterations vs 18 iterations, all paths total loss 550 vs 565)

 

2.edgeweight100504010: graph with arbitrary edge weigh: bar 100, cross 50, phaseshifter 40, waveguide 10 (penalty 10 vs 20 comparison: 93 iterations vs 18 iterations, all paths total loss 5500 vs 5650 ) 

 

 

Folder 1 is to support multipair inputs and outputs case in the paper. Folder 2. is further stored in Folder 4 of the next zip fie for movie demonstration. Further data for more variations are possible to demo how to design smart congestion penalties.

 

Folders in  supporting data of graph representations for programmable photonic circuits.zip:

 

1.Negative_weights_unreachable: Tested unphysical paths are found on all 21 nodes in the undirected graph with arbitrary negative weight. 

 

2.4AG_unreachable_seperated: These same terminal nodes with different light flow directions are validated in a directed graph without artificial nodes representing the same optical port overlapping each other.

 

3.4AG_unreachable_overlapped: These same terminal nodes with different light flow directions are validated in a directed graph with artificial nodes representing the same optical port overlapping each other.

 

4.movie2_6_pair_congestion_negotiation: An example congestion negotiation is built on top of the single input-output pair case for 6 pair edge-disjointed shortest paths with constraints specifically for programmable photonic circuits. After several iterations with a violation cost of 10(graph with arbitrary edge weigh: bar 100, cross 50, phaseshifter 40, waveguide 10), it finds a valid solution.  

 

5.7cells_12chose6ports_animation2: An animation is made based on real-time algorithm visualization. (red edges are congested edge pairs) 

 

 

Dataset Files

You must be an IEEE Dataport Subscriber to access these files. Login or subscribe now. Sign up to be a Beta Tester and receive a coupon code for a free subscription to IEEE DataPort!

Thank you for rating this dataset!

Please share additional details of your rating with the IEEE DataPort community by adding a comment.

Embed this dataset on another website

Copy and paste the HTML code below to embed your dataset:

Share via email or social media

Click the buttons below:

facebooktwittermailshare
[1] Xiangfeng Chen, "Supporting data of graph representations for programmable photonic circuits", IEEE Dataport, 2020. [Online]. Available: http://dx.doi.org/10.21227/t001-kr39. Accessed: Apr. 05, 2020.
@data{t001-kr39-20,
doi = {10.21227/t001-kr39},
url = {http://dx.doi.org/10.21227/t001-kr39},
author = {Xiangfeng Chen },
publisher = {IEEE Dataport},
title = {Supporting data of graph representations for programmable photonic circuits},
year = {2020} }
TY - DATA
T1 - Supporting data of graph representations for programmable photonic circuits
AU - Xiangfeng Chen
PY - 2020
PB - IEEE Dataport
UR - 10.21227/t001-kr39
ER -
Xiangfeng Chen. (2020). Supporting data of graph representations for programmable photonic circuits. IEEE Dataport. http://dx.doi.org/10.21227/t001-kr39
Xiangfeng Chen, 2020. Supporting data of graph representations for programmable photonic circuits. Available at: http://dx.doi.org/10.21227/t001-kr39.
Xiangfeng Chen. (2020). "Supporting data of graph representations for programmable photonic circuits." Web.
1. Xiangfeng Chen. Supporting data of graph representations for programmable photonic circuits [Internet]. IEEE Dataport; 2020. Available from : http://dx.doi.org/10.21227/t001-kr39
Xiangfeng Chen. "Supporting data of graph representations for programmable photonic circuits." doi: 10.21227/t001-kr39