Search

In multi-point to multi-point (MP2MP) routing and wavelength assignment (RWA) problems, researchers usually assume the optical networks to be a single domain. However, the optical networks develop toward to multi-domain and larger scale in practice. In this context, multi-core shared tree (MST)-based MP2MP RWA are introduced problems including optimal multicast domain sequence selection, core nodes belonging in which domains and so on. In this letter, we focus on MST-based MP2MP RWA problems in multi-domain optical networks, mixed integer linear programming (MILP) formulations to optimally construct MP2MP multicast trees is presented. A heuristic algorithm base on network virtualization and weighted clustering algorithm (NV-WCA) is proposed. Simulation results show that, under different traffic patterns, the proposed algorithm achieves significant improvement on network resources occupation and multicast trees setup latency in contrast with the conventional algorithms which were proposed base on a single domain network environment. [ABSTRACT FROM AUTHOR]

In optical networks lightpath setup problems, researchers usually assume the optical networks to be a single domain. However, the optical networks develop toward to multi-domain and larger scale in practice. However, with the optical networks develop toward to complexity, conventional resource reservation protocol traffic engineering (RSVP-TE) protocol crankback schemes cannot meet the requirements of these new applications for real-time dynamic services and fast restoration with long propagation delays. In this letter, we focus on lightpath setup problems in multi-domain optical networks, mixed integer linear programming (MILP) formulations is presented. A heuristic algorithm base on network virtualization and source backtracking region re-routing (SBRR) crankback scheme is proposed. Simulation results show that, under different traffic patterns, the proposed algorithm achieves significant improvement on network resources occupation and lightpath setup latency in contrast with the conventional algorithms which were proposed base on a single domain network environment. • In this letter, we focus on ligthpath setup problems in multi-domain optical networks, mixed integer linear programming (MILP) formulations is presented. • A heuristic algorithm base on network virtualization and source backtracking region re-routing (SBRR) crankback scheme is proposed. [ABSTRACT FROM AUTHOR]

This paper presents a global paths planning in IP over OTN uniform control inter-datacenter network and designs algorithm based on fairness, in order to due with big traffic flow paths planning problem. By this algorithm, apps are allocated bandwidth in a fair way on the premise of trying to meet the bandwidth demand. Simulation results reveal that, compared with algorithm based on priority, global paths planning improves fairness by up to 0.2 on premise of not reducing satisfaction degree. Compared with algorithm in IP controlled network, number of router ports is saved by up to more than 65% in IP over OTN uniform controlled network. • This paper proposes to implement the global bandwidth scheduling algorithm under the IP over OTN unified control architecture. • Multi-layer unified control mechanism can be utilized to improve fairness and save router port overhead while ensuring application satisfaction. • This paper presents a global paths planning in IP over OTN uniform control inter-datacenter network and designs algorithm based on fairness, in order to due with big traffic flow paths planning problem. [ABSTRACT FROM AUTHOR]