Scaling up scheduling in SnF OCS networks – An adjacency list based solution

Xiao Lin, 2016, Time-Shifted multilayer graph: a routing framework for bulk data transfer in optical circuit-switched networks with assistive storage, J. Opt. Commun. Netw., 8, 162, 10.1364/JOCN.8.000162 Thomas, 2013, Introduction to algorithms, 3, 593 Harmanjit Singh, 2012, Role of adjacency matrix & adjacency list in graph theory, Int. J. Comput. Technol., 3, 179, 10.24297/ijct.v3i1c.2775 Ferozuddin Riaz, 2011, Applications of graph theory in computer science, 142 Patel, 2008, Time-shift circuit switching, OThI6 Phuong-Hanh Du, 2016, Optimizing the shortest path query on large-scale dynamic directed graph, 210 Yang, 1994, The replicated data algorithm for solving the single source shortest path problem, 714 Fabio Checconi, 2014, Traversing trillions of edges in real time: graph exploration on large-scale parallel machines, 425 Dip Sankar Banerjee, 2013, Work efficient parallel algorithms for large graph exploration, 433 Sungpack Hong, 2011, Efficient parallel graph exploration on multi-core CPU and GPU, 78 Laoutaris, 2013, Delay-tolerant bulk data transfers on the Internet, IEEE/ACM Trans. Netw., 21, 1852, 10.1109/TNET.2012.2237555 Iosifidis, 2017, Distributed storage control algorithms for dynamic networks, IEEE/ACM Trans. Netw., 25, 1359, 10.1109/TNET.2016.2633370 Wu, 2017, Orchestrating bulk data transfers across geo-distributed datacenters, IEEE Trans. Parallel Distr. Syst., 5, 112 Zang, 2000, A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks, Opt. Network Mag., 1, 47