Therefore no studies on the time-slot allocation problem consider both multi-time-slot bonding and asynchronous time-slot phase without adjustment of fiber length. In this section, we show simulation setup and results. Using the shortest path based on Dijkstra’s algorithm with its metric being hop count, we performed routing of the traffic from node to node.