30 April 2018 in IEEE Transactions on Communications
Deploying a radio frequency (RF) access point (AP) to the visible light communication (VLC) system is a promising strategy to overcome the VLC’s limitations, such as limited coverage, strictly line-of-sight transmission and mobility robustness, etc. In this paper, we focus on the energy-aware design of network selection and resource allocation for a heterogeneous network combining with RF and VLC APs. For adapting to different timescale network states and stochastic data arrival, we propose an on-line two-timescale adaptive network resource optimization (ANRO) framework by employing the Lyapunov optimization technique. At the large timescale, we first develop a closedform solution for the subproblem of network selection for user equipment. Second, we design a cost-effective and easy-to-realize algorithm for VLC’s joint transmission scheduling and power control subproblem, which is a nonconvex optimization. While, at the small timescale, we obtain the optimal solution for RF’s joint resource block and power allocation subproblem, which is proven a mixed integer nonlinear optimization. Simulation results demonstrate that the ANRO can achieve a tradeoff between network power consumption and delay. Furthermore, it not only can stabilize the network but also can significantly reduce the energy consumption compared with other existing schemes.
17 June 2021 in IEEE Transactions on Network and Service Management
Natural disasters have challenged the survivability of Elastic Optical Inter-DataCenter Networks (EO-DCNs), and it is urgent to establish efficient disaster protection schemes. In this paper, we investigate the disaster-resilient service provisioning problem leveraging cooperative storage system (CSS). Instead of mirrored content backup on a single DC, our proposed CSS partitions a required content into no less than three fragments if possible, each of which is then stored on a DC located in different disaster zones. Accordingly, multi-path routing with the adaptive number of working paths to distinct DCs is employed to serve each request, while a protection path is computed to protect against a disaster failure. Our main objective is to jointly minimize the spectrum usage and maximal occupied frequency slot index (MOFI) subject to disaster resilience. Besides, we also expect to cut the content storage space. To this end, we propose for the first time a CSS-based dedicated end-to-content path protection (CDP), which allows service provisioning through multiple paths with the adaptive number of paths rather than a single path. This consequently reduces at least half of the reserved spectrum on the protection path. To find the optimal CDP strategy, we formulate the studied problem as an integer linear program (ILP) and then propose a fast heuristic algorithm. Observing the trade-off between the spectrum usage and content storage space, we further design a maximum-CDP (M-CDP), which generates the maximum number of working paths to reduce the content storage space. Simulations are conducted to compare the proposed schemes with the traditional protection strategy using mirrored storage and single-path routing. Numerical results demonstrate that the proposed CSS-based protection schemes enable to cut up to 21.6% of the spectrum usage and 15% of the content storage space.
13 September 2016 in IEEE Sensors Journal
We study the problem of maximizing the network lifetime of a data-gathering tree in a wireless sensor network (WSN). Both data routing and data aggregation are considered at the same time to improve the energy efficiency for data collection in WSNs. With different data-aggregation methods, three aggregation modes are studied: full aggregation, non-aggregation, and a hybrid partial-aggregation using compressive sensing. The full aggregation means that an intermediate sensor node will aggregate all the received data from its children and its own generated data into one data unit and then send it to its parent. If no aggregation is used, an intermediate sensor node will forward all the received data units plus its own data separately. For the hybrid partial-aggregation, once the number of incoming data units is bigger than a compression threshold, they will be compressed into a constant size for transmission. For each mode, an exact solution based on mixed-integer linear programming (MIP) is proposed to find the optimal data-gathering tree with the maximum network lifetime. Although non-linear relations exist between the lifetime of a sensor node and the number of data units received or transmitted, we succeed to express it by a set of linear equations. The correctness of the MIP models is proven formally. Simulation results demonstrate that the network lifetime can be increased tenfold by changing the compression threshold from five to one, which is, however, at the expense of bigger end-to-end delay and lower data accuracy. Thus, this compression threshold should be properly chosen for real applications.
7 March 2022 in Journal of Lightwave Technology
Nowadays, large-scale failures in elastic optical inter-data center networks (EO-DCNs) are critical issues for network survivability. Once the original connection or the primary DC fails, an alternative data center (DC) can serve the cloud services with replicated content. In this paper, we study disaster-resilient cloud services provisioning with distance-adaptive modulation formats, considering content placement, routing with modulation format adaption, protection of path and content, and spectrum allocation simultaneously. Both dedicated end-to-content backup path protection (DEBPP) and shared end-to-content backup path protection (SEBPP) are studied. First, integer linear program (ILP) models are formulated with the objective of minimum spectrum usage. For the sake of scalability, a column generation (CG) approach is developed to decompose the ILP model into a master problem and a pricing problem. The CG approach is shown to achieve comparable results to ILP models. Numerical simulations are conducted to investigate the spectrum usage of DEBPP and SEBPP with different traffic parameters and different network topologies.
12 December 2018 in Journal of Lightwave Technology
With flexibility in optical layer, elastic optical network (EON) has been considered as a competitive candidate to architect next-generation backbone networks. Routing and spectrum assignment (RSA) is a key problem for the service provisioning in EONs. The RSA problem is NP-hard even in elastic optical rings. Numerous heuristics have been proposed, and they can generally be categorized into two types: Route-First (RF) and Spectrum-First (SF). Although most previous work demonstrated by numerical simulations that the SF algorithms always outperform the RF ones, there is a lack of theoretical analysis on the reasons causing the performance difference between the two types of RSA algorithms. In this paper, we aim at proposing a unified theoretical framework for the performance analysis of RSA algorithms by leveraging conflict graphs, which offers a new perception on the optimality of RSA algorithms. To validate the proposed framework, we apply it in elastic optical rings (with cycle topology), and theoretically analyze the number of edges of the conflict graphs for RF and SF algorithms. Different from the literature, we obtain an interesting observation that neither the RF nor the SF can surpass the other in elastic optical rings under different traffic distributions, and their performances have a strong correlation to the edge count of their conflict graph. This observation provides a new perspective, i.e., conflict graph, to explore the property of RSA algorithms.
6 December 2017 in Journal of Lightwave Technology
Mixed-Line-Rate (MLR) optical networks (e.g., $10/40/100 {\mathbf {Gbps}}$) offer a new paradigm in backbone networks to meet the increasing traffic demands. They are considered as a transitional solution for future flexible and dynamic optical networks. In order to provision multicast in MLR optical networks, we need to address multicast routing, line rate selection, and wavelength assignment subproblems while still respecting the maximum transmission reach constraint. In this paper, we investigate the multicast provisioning problem, which aims at minimizing the total cost on transponder, wavelength channel and wavelength usage. First, a lightpath-based joint Integer Linear Programming (ILP) model is formulated to minimize the total cost by solving simultaneously the three subproblems aforementioned. To overcome the scalability of this joint ILP model, a decomposition approach based on Column Generation (CG) is proposed, which achieves comparable results within an extremely short period of time. Extensive simulations are performed to study the impact on the total cost of multicast provisioning with MLR regarding the number of multicast sessions, destinations, traffic amount, and network topologies. It is observed that the multicast provisioning with MLR has significant total cost savings over Single Line Rate (SLR), especially in the scenarios of a large number of multicast sessions and in optical networks with small average nodal degree.