Combinatorial double auction-based allocation of retrieval tasks in Internet of Things by Zhi-kai XU, Hong-li ZHANG, Xiang-zhan YU, Zhi-gang ZHOU

“…Task allocation mechanism was greatly important to the success of the search service in Internet of Things (IoT).On basis of analyzing the real time characteristics of the IoT data,and the dynamic characteristics of the users,a combinatorial double auction-based retrieval tasks allocation model was introduced,which described the relationships between the workers,the requesters and the system from the perspective of supply and demand.Firstly,a novel metric to evaluate the value of the users’ queries was introduced and a greedy heuristic algorithm to determine the winning requesters and workers was proposed.Then,a critical payment scheme was proposed,which guaranteed that submitted bids of the users reflect their real value.Finally,both the rigid theoretical analysis and simulation result show that the proposed mechanism achieves truthfulness,individual rationality and the efficiency of the service provider is improved.…”
Get full text

Software-defined networking QoS optimization based on deep reinforcement learning by Julong LAN, Xueshuai ZHANG, Yuxiang HU, Penghao SUN

“…To solve the problem that the QoS optimization schemes which based on heuristic algorithm degraded often due to the mismatch between parameters and network characteristics in software-defined networking scenarios,a software-defined networking QoS optimization algorithm based on deep reinforcement learning was proposed.Firstly,the network resources and state information were integrated into the network model,and then the flow perception capability was improved by the long short-term memory,and finally the dynamic flow scheduling strategy,which satisfied the specific QoS objectives,were generated in combination with deep reinforcement learning.The experimental results show that,compared with the existing algorithms,the proposed algorithm not only ensures the end-to-end delay and packet loss rate,but also improves the network load balancing by 22.7% and increases the throughput by 8.2%.…”
Get full text

A hybrid traffic scheduling mechanism applied to large scale time-sensitive networking by Yanjue LI, Wenxuan HAN, Hailong ZHU, Changchuan YIN

“…Aiming at large-scale time-sensitive networking (TSN) scenarios that can only ensure frequency synchronization between devices, a hybrid traffic scheduling mechanism was proposed based on time-aware shaper (TAS) combined with cycle specified queuing and forwarding (CSQF).Firstly, a scheme was investigated for achieving periodic cyclic mapping alignment between two adjacent nodes located in different time domains.Secondly, combining segment routing technology, a heuristic algorithm based on CSQF mechanism for joint routing and scheduling was proposed to complete resource allocation for large bandwidth traffic.The experimental results show that the proposed scheme significantly improves the system resource utilization and scheduling success rate compared to existing research results, achieving efficient TSN traffic scheduling in wide area network scenarios.…”
Get full text

Dynamic Combined-Mode Traffic Network Model considering Transfer Behaviors by ShuGuang Li, QingHua Zhou

“…Finally, a numerical example is given to illustrate the effectiveness of the proposed heuristic algorithm and model.…”
Get full text

Optimal Route Selection Decision-Making Based on Intelligent Network by Mengshu Zhao, Zhaohui Zhang

“…We construct some dynamic multiobjective network problems and use heuristic algorithm to solve the two problems in four levels in the paper. …”
Get full text

Node-link simultaneous mapping based multi-type service resource orchestration algorithm by FENG Chuan, ZHANG Xu, MA Tianchun, GUO Lei

“…To tackle the issues of a high blocking rate of virtual requests and underutilization of physical network resources, a heuristic algorithm for orchestrating multi-type service resources was proposed by simultaneously mapping nodes and links. …”
Get full text

Virtual reality compressing and transmitting system based on mobile edge computing by Bin TAN, Songyuan ZHAO, Jun WU, Wenru ZHANG

“…In order to solve the problem of the high requirements of data transmission rate and sensitivity to transmission delay in virtual reality (VR) based on cloud services,a Cloud VR system with MEC (mobile edge computing) was proposed,mainly including viewpoint-based VR processing and HDA (hybrid digital-analog) transmission optimization.Firstly,a dynamic streaming method based on user viewpoint and pyramid projection was used to implement a complete edge cloud VR system.Then,HDA transmission was introduced to optimize the transmission,and a heuristic algorithm for resource allocation was given.Finally,the base station protocol stack was transformed,and the MEC was integrated into the LTE (long term evolution) system to implement a complete mobile edge cloud VR system.Experimental results demonstrate that the proposed scheme has good robustness and efficient transmission by comparing with the existing schemes.…”
Get full text

Orchestration mechanism for VNF hardware acceleration resources in SDN/NFV architecture by Tong DUAN, Julong LAN, Yuxiang HU, Hongwei FAN

“…The hardware acceleration mechanism for VNF (virtual network function) is recently a hot research topic in SDN/NFV architecture because of the low processing performance of VNF.Once hardware acceleration resources have been plugged into the network,how to optimally mange and orchestrate these resources under service requirements remains a question to be solved.Firstly,a unified management architecture based on separated control for hardware acceleration resources was proposed.Then,traditional network topology together with hardware acceleration resources were modeled into a unified network model and then the hardware acceleration resource orchestration problem was transferred into a multi-objective linear programming problem.Finally,a hardware-accelerator-card-prior’ heuristic algorithm was designed.Experimental results show that compared with existing methods,the proposed orchestration mechanism can efficiently manage hardware acceleration resources and reduce the processing latency by 30%.…”
Get full text

A New Model for Reassignment of Tasks to Available Employees in Iraq’s Firms by Dhurgam Kalel Ibrahim Alsaad, Reza Ghanbari, Ali Akbar Sohrabi, Khatere Ghorbani Moghadam

“…Likewise, the returning workers from long holidays assumption are incorporated. Finally, a heuristic algorithm for solving reassignment tasks on laborers is introduced.…”
Get full text

Functional composition in software-defined network based on atomic capacity by UANTong D, ANJu-long L, HENGGuo-zhen C, UYu-xiang H

“…Software-defined network (SDN) enables frequent network functional innovation and evolution,making the control function modularity one of the most hot research fields on SDN.Aiming at network-wide functional composition based on unified module definition and function division,firstly,atomic capacity (AC) is introduced as atomic elements of module function division and an AC-based resource description method is proposed; secondly,functional composition module based on two-level mapping is put forward and a heuristic algorithm to calculate the composition is proposed; fi-nally,an AC-orchestrating layer as extended structure of SDN application layer is devised and then a NetFPGA-10G pro-totype implementation is given.Experimental results show that the method can combine functional instances more effec-tively with better resource utilization.…”
Get full text

Dynamic Weighted Symbiotic Organisms Search Algorithm for Global Optimization Problems by Pengjun Zhao, Sanyang Liu

“…The symbiotic organisms search (SOS) algorithm is a current effective meta-heuristic algorithm, which is been applied to solve various types of optimization problems. …”
Get full text

Novel node upgradation strategy for migration to elastic optical networks by Xiaodong FU, Yongcheng LI, Gangxiang SHEN

“…For migration from dense wavelength division multiplexing (DWDM) networks to elastic optical networks (EON),it is required to upgrade the traditional reconfigurable optical add-drop multiplexer (ROADM) to the new-generation ROADM that supports flexible grids.However,for a large-scale optical network,it is generally impossible to upgrade the ROADM nodes all in once; rather,they would be upgraded gradually.For this,it is critical to study different strategies for selecting the ROADM nodes to be upgraded.Also,for the interconnection between different generations of ROADM,the sub-band virtual concatenation (VCAT) technique was employed to enable an optical channel to be established via traversing different types of nodes.An integer liner programming (ILP) model and an efficient heuristic algorithm were developed to jointly select the ROADM nodes to upgraded and assign spectrum resources.Simulation studies show that the proposed strategy for the upgraded node selection is efficient to perform close to the ILP model in terms of the maximum number of FS used in the whole network.…”
Get full text

Improving energy efficiency and network performance in IaaS cloud with virtual machine placement by Jian-kang DONG, Hong-bo WANG, Yang-yang LI, Shi-duan CHENG

“…The existing virtual machine(VM) placement schemes mostly reduce energy consumption by optimizing utilization of physical server or network element.However,the aggressive consolidation of these resources may lead to network performance degradation.In view of this,a VM placement scheme was proposed to achieve two objectives.One is to minimize the number of activating physical machines and network elements to reduce the energy consumption,and the other is to minimize the maximum link utilization to improve the network performance.This scheme is able to reduce the energy consumption caused by physical servers and network equipment while optimizing the network performance,making a trade off between energy efficiency and network performance.A novel two-stage heuristic algorithm for a solution was designed.Firstly,the hierarchical clustering algorithm based on minimum cut and best fit algorithm was used to optimize energy efficiency,and then,local search algorithm was used to minimize the maximum link utilization.The simulations show that this solution achieves good results.…”
Get full text

Green virtual topology design algorithm based on constraint-based routing by Yuan-sheng WU, Bing GUO, Yan SHEN, Ji-he WANG, Xiao-bin LIU

“…To reduce the energy consumption of Internet core network, a formulation model for green virtual topology design (GVTD) problem was developed, which employs the following measures: traffic aggregation, network resources allocation on demand, virtual topology design dynamically and multi-granularity sleeping. A heuristic algorithm base on constraint-based routing, namely CBR-GVTD, was proposed, which combines the single-hop and multi-hop routing to establish virtual topology, and makes trade-offs between the network power consumption and routing performance via the constraint-based routing mechanism. …”
Get full text

Research on seed node mining algorithm in large-scale temporal graph by Xiaohong ZOU, Chengwei XU, Jing CHEN, Biao SONG, Mingyue WANG

“…Most of the existing maximizing influence algorithms based on temporal graph were not applicable for large-scale networks due to the low time efficiency or narrow influence range.Therefore, the seed node mining algorithm named CHG combining heuristic algorithm and greedy strategy was proposed.Firstly, based on the time sequence characteristics of information diffusion in temporal graph, the concept of two-order degree of nodes was given, and the influence of nodes was heuristically evaluated.Secondly, the nodes were filtered according to the influence evaluation results, and the candidate seed node set was constructed.Finally, the marginal effect of candidate seed nodes was calculated to solve the overlap of influence ranges between nodes to ensure the optimal combination of seed nodes.The experiments were carried out on three different scale data sets, and the results show that the proposed algorithm can ensure the high influence of the seed node set even though its running time is relatively shorter.And it can achieve a better trade-off between the time efficiency and the influence range of the seed node set.…”
Get full text

A New Optimization via Simulation Approach for Dynamic Facility Layout Problem with Budget Constraints by Parham Azimi, Hamid Reza Charmchi

“…A new efficient heuristic algorithm has been developed for the dynamic facility layout problem with budget constraint (DFLPB) using optimization via simulation technique. …”
Get full text

An algorithm for joint optimization of dynamic routing and scheduling in time-sensitive networking by Yang ZHOU, Honglong CHEN, Lei ZHANG

“…Time-sensitive networking (TSN) is a set of protocols developed by the IEEE TSN task group, aiming at achieving deterministic communications over Ethernet.As the implementation method of TSN traffic scheduling is not specified in the protocols, the routing and scheduling algorithm for TSN remains an open issue.The joint optimization problem of routing and scheduling in TSN for industrial applications was modeled, and then an online heuristic algorithm was proposed to deliver the routing and scheduling solution for dynamic traffics.The routing path was determined by optimizing both the transmission delay and network load factors, and the scheduling time was quickly conducted by twice clipping operations.Finally, a simulated TSN testbed was developed with NeSTiNg framework based on OMNeT.The simulation results show that the execution time of the proposed algorithm outperforms the baseline algorithms even with large scale of network size and network traffics.It shows that the proposed algorithm guarantees the real-time performance even in dynamically changing networks.…”
Get full text

METHOD OF SIMULTANEOUS OPTIMIZATION OF RADIO DEVICES PERFORMANCE IN FREQUENCY AND TIME DOMAINS by A. V. Smirnov

“…The searching was performed in the coordinatespace of transfer function poles and zeros. The heuristic algorithm of multistart local search type was applied. …”
Get full text

A Game-Theoretic Approach for the Robust Daily Aircraft Routing Problem by Bin Deng, Hao Guo, Jingfeng Li, Junfeng Huang, Kaiyi Tang, Weidong Li

“…Then, in order to find the suboptimal solution to a large-scale integer programming problem in a limited amount of time, a heuristic algorithm integrating a column generation algorithm and variable domain search is introduced. …”
Get full text

Considering the Carbon Penalty Rates to Optimize the Urban Distribution Model in Time-Varying Network by Yuanyuan Ji, Shoufeng Ji, Tingting Ji

“…An improved variable neighborhood search (VNS) heuristic algorithm is designed to solve the model. The numerical example demonstrates that the higher the carbon emission cost, the greater the carbon penalty rate. …”
Get full text