Brown-Field Migration Aware Routing and Spectrum Assignment in Backbone Optical Networks

With the development of optical networks technology, broad attention has been paid to flexible grid technology in optical networks due to its ability to carry large-capacity information as well as provide flexible and fine-grained services through on-demand spectrum resource allocation. However, a one-time green-field deployment of a flexible grid network may not be practical. The transition technology called the fixed/flex-grid optical networks is more applicable and highly pragmatic. In such network, many nodes would likely be upgraded from a fixed-grid to flex-grid. In fact, dynamic service provisioning during the process of a node upgrade in fixed/flex-grid optical networks have become a challenge because the service connection can be easily interrupted, which leads to considerable data loss because of node upgrade. To overcome this challenge, we propose a brown-field migration aware routing and spectrum assignment (BMA-RSA) algorithm in fixed/flex-grid optical networks. The aim is to construct a probabilistic migration label (PML) model. The well-designed label setting of PML can balance the relationship between distance and node-upgrade probability. Dynamic service provisioning operations are undertaken based on the PML model to achieve a migration-aware dynamic connection before network migration occurs. We also evaluate the performance of different service provisioning strategies under different traffic models. The simulation results show that the BMA-RSA algorithm can achieve: (1) the tradeoff between distance and node upgrade probability during the process of service provisioning; (2) lower service interruption compared with the traditional non-migration aware K-shortest-path routing and spectrum assignment algorithm.

Task Assignment and Personality

An open call format of crowdsourcing software development (CSD) is harnessing potential, diverse, and unlimited people. But, several thousand solutions are being submitted at platform against each call. To select and match the submitted task with the appropriate worker and vice versa is still a complicated problem. Focusing the issue, this study proposes a task assignment algorithm (TAA) that will behave as an intermediate facilitator (at platform) between task (from requester) and solution (from worker). The algorithm will divide the tasks' list based on the developer's personality. In this way, we can save the time of both developers and platform by reducing the searching time.

Delay and Energy Consumption Optimization Oriented Multi-service Cloud Edge Collaborative Computing Mechanism in IoT

The rapid development of the Internet of Things has put forward higher requirements for the processing capacity of the network. The adoption of cloud edge collaboration technology can make full use of computing resources and improve the processing capacity of the network. However, in the cloud edge collaboration technology, how to design a collaborative assignment strategy among different devices to minimize the system cost is still a challenging work. In this paper, a task collaborative assignment algorithm based on genetic algorithm and simulated annealing algorithm is proposed. Firstly, the task collaborative assignment framework of cloud edge collaboration is constructed. Secondly, the problem of task assignment strategy was transformed into a function optimization problem with the objective of minimizing the time delay and energy consumption cost. To solve this problem, a task assignment algorithm combining the improved genetic algorithm and simulated annealing algorithm was proposed, and the optimal task assignment strategy was obtained. Finally, the simulation results show that compared with the traditional cloud computing, the proposed method can improve the system efficiency by more than 25%.