scholarly journals Dynamic Multiple Work Stealing Strategy for Flexible Load Balancing

2012 ◽  
Vol E95.D (6) ◽  
pp. 1565-1576 ◽  
Author(s):  
ADNAN ◽  
Mitsuhisa SATO
Author(s):  
Wouter Joosen ◽  
Stijn Bijnens ◽  
Bert Robben ◽  
Johan Van Oeyen ◽  
Pierre Verbaeten

Sensors ◽  
2018 ◽  
Vol 18 (8) ◽  
pp. 2479 ◽  
Author(s):  
Hongyu Xiao ◽  
Zhenjiang Zhang ◽  
Zhangbing Zhou

This paper firstly replaces the first-come-first-service (FCFS) mechanism with the time-sharing (TS) mechanism in fog computing nodes (FCNs). Then a collaborative load-balancing algorithm for the TS mechanism is proposed for FCNs. The algorithm is a variant of a work-stealing scheduling algorithm, and is based on the Nash bargaining solution (NBS) for a cooperative game between FCNs. Pareto optimality is achieved through the collaborative working of FCNs to improve the performance of every FCN. Lastly the simulation results demonstrate that the game-theory based work-stealing algorithm (GWS) outperforms the classical work-stealing algorithm (CWS).


PLoS ONE ◽  
2021 ◽  
Vol 16 (2) ◽  
pp. e0246293
Author(s):  
Shanshan Hao ◽  
Renjie Liu ◽  
Zhe Weng ◽  
Deliang Chang ◽  
Congxiao Bao ◽  
...  

Eliminating unnecessary exposure is a principle of server security. The huge IPv6 address space enhances security by making scanning infeasible, however, with recent advances of IPv6 scanning technologies, network scanning is again threatening server security. In this paper, we propose a new model named addressless server, which separates the server into an entrance module and a main service module, and assigns an IPv6 prefix instead of an IPv6 address to the main service module. The entrance module generates a legitimate IPv6 address under this prefix by encrypting the client address, so that the client can access the main server on a destination address that is different in each connection. In this way, the model provides isolation to the main server, prevents network scanning, and minimizes exposure. Moreover it provides a novel framework that supports flexible load balancing, high-availability, and other desirable features. The model is simple and does not require any modification to the client or the network. We implement a prototype and experiments show that our model can prevent the main server from being scanned at a slight performance cost.


Sign in / Sign up

Export Citation Format

Share Document