A priority-based weighted fair queueing scheduler for real-time network

2003 ◽  
Author(s):  
Song Wang ◽  
Yu-Chung Wang ◽  
Kwei-Jay Lin
Keyword(s):  
Real Time ◽  
Fair Queueing ◽  
A Priority

scholarly journals Accident sites management using drones

2020 ◽  
Vol 305 ◽  
pp. 00004
Author(s):  
Oliviu Mihnea Gamulescu ◽  
Sebastian Daniel Rosca ◽  
Fabian Panaite ◽  
Alin Costandoiu ◽  
Simona Riurean
Keyword(s):  
Control System ◽  
Real Time ◽  
Environmental Conditions ◽  
Petrochemical Industry ◽  
Rapid Identification ◽  
Industrial Accidents ◽  
Human Errors ◽  
Image Identification ◽  
A Priority ◽  
Command Center

Nowadays, finding a way to quickly respond to industrial accidents due to human errors or unforeseen situation is high, for example in the petrochemical industry where are handled with toxic and flammable substances, is a priority for the safe coordination of rescue teams based on-real time knowledge of the situation on the ground. Thus, the rapid identification of potential victims, the prevision of post-deflagration work space and the prevention of the new emergencies to limit damage should become a priority. In this paper we propose a quickly solution for rescue intervention based on use of the drone equipped with camera and sensors network capable of transmitting data in real time over the post-explosive environmental conditions to command center for the rapid identification of victims both in open and closed spaces. The paper presents the methods of using drones to explore and identify accident sites. There are modelled and simulated the control system and the image identification unit.

Sliding weighted fair queueing scheme for real-time applications

2005 ◽  
Vol 152 (3) ◽  
pp. 320 ◽  
Author(s):  
Y.-S. Yen ◽  
W. Chen ◽  
J.-C. Zhhuang ◽  
H.-C. Chao
Keyword(s):  
Real Time ◽  
Fair Queueing ◽  
Real Time Applications

scholarly journals A New Method of Priority Assignment for Real-Time Flows in the WirelessHART Network by the TDMA Protocol

Sensors ◽  
2018 ◽  
Vol 18 (12) ◽  
pp. 4242 ◽  
Author(s):  
Yulong Wu ◽  
Weizhe Zhang ◽  
Hui He ◽  
Yawei Liu
Keyword(s):  
Real Time ◽  
Network Flows ◽  
Heuristic Algorithms ◽  
Optimal Algorithm ◽  
Time Data ◽  
Priority Assignment ◽  
Calculation Time ◽  
Greedy Strategy ◽  
Assignment Algorithm ◽  
A Priority

WirelessHART is a wireless sensor network that is widely used in real-time demand analyses. A key challenge faced by WirelessHART is to ensure the character of real-time data transmission in the network. Identifying a priority assignment strategy that reduces the delay in flow transmission is crucial in ensuring real-time network performance and the schedulability of real-time network flows. We study the priority assignment of real-time flows in WirelessHART on the basis of the multi-channel time division multiple access (TDMA) protocol to reduce the delay and improve the ratio of scheduled. We provide three kinds of methods: (1) worst fit, (2) best fit, and (3) first fit and choose the most suitable one, namely the worst-fit method for allocating flows to each channel. More importantly, we propose two heuristic algorithms—a priority assignment algorithm based on the greedy strategy for C (WF-C) and a priority assignment algorithm based on the greedy strategy for U(WF-U)—for assigning priorities to the flows in each channel, whose time complexity is O ( m a x ( N ∗ m ∗ l o g ( m ) , ( N − m ) 2 ) ) . We then build a new simulation model to simulate the transmission of real-time flows in WirelessHART. Finally, we compare our two algorithms with WF-D and HLS algorithms in terms of the average value of the total end-to-end delay of flow sets, the ratio of schedulable flow sets, and the calculation time of the schedulability analysis. The optimal algorithm WF-C reduces the delay by up to 44.18 % and increases the schedulability ratio by up to 70.7 % , and it reduces the calculation time compared with the HLS algorithm.

Sign in / Sign up

Export Citation Format

Share Document