End-to-End Bandwidth Allocation and Reservation for Grid applications

2006 ◽  
Author(s):  
Charaka Palansuriya ◽  
Maarten Buchli ◽  
Kostas Kavoussanakis ◽  
Anand Patil ◽  
Chrysostomos Tziouvaras ◽  
...  
Keyword(s):  
Bandwidth Allocation ◽  
Grid Applications ◽  
End To End

scholarly journals Distributed Channel Ranking Scheduling Function for Dense Industrial 6TiSCH Networks

Sensors ◽  
2021 ◽  
Vol 21 (5) ◽  
pp. 1593
Author(s):  
Ismael Amezcua Valdovinos ◽  
Patricia Elizabeth Figueroa Millán ◽  
Jesús Arturo Pérez-Díaz ◽  
Cesar Vargas-Rosales
Keyword(s):  
Kalman Filtering ◽  
Bandwidth Allocation ◽  
Communication Systems ◽  
High Reliability ◽  
Allocation Mechanism ◽  
Elapsed Time ◽  
Packet Arrival ◽  
End To End ◽  
Ieee 802.15.4E ◽  
Number Of Cells

The Industrial Internet of Things (IIoT) is considered a key enabler for Industry 4.0. Modern wireless industrial protocols such as the IEEE 802.15.4e Time-Slotted Channel Hopping (TSCH) deliver high reliability to fulfill the requirements in IIoT by following strict schedules computed in a Scheduling Function (SF) to avoid collisions and to provide determinism. The standard does not define how such schedules are built. The SF plays an essential role in 6TiSCH networks since it dictates when and where the nodes are communicating according to the application requirements, thus directly influencing the reliability of the network. Moreover, typical industrial environments consist of heavy machinery and complementary wireless communication systems that can create interference. Hence, we propose a distributed SF, namely the Channel Ranking Scheduling Function (CRSF), for IIoT networks supporting IPv6 over the IEEE 802.15.4e TSCH mode. CRSF computes the number of cells required for each node using a buffer-based bandwidth allocation mechanism with a Kalman filtering technique to avoid sudden allocation/deallocation of cells. CRSF also ranks channel quality using Exponential Weighted Moving Averages (EWMAs) based on the Received Signal Strength Indicator (RSSI), Background Noise (BN) level measurements, and the Packet Delivery Rate (PDR) metrics to select the best available channel to communicate. We compare the performance of CRSF with Orchestra and the Minimal Scheduling Function (MSF), in scenarios resembling industrial environmental characteristics. Performance is evaluated in terms of PDR, end-to-end latency, Radio Duty Cycle (RDC), and the elapsed time of first packet arrival. Results show that CRSF achieves high PDR and low RDC across all scenarios with periodic and burst traffic patterns at the cost of increased end-to-end latency. Moreover, CRSF delivers the first packet earlier than Orchestra and MSF in all scenarios. We conclude that CRSF is a viable option for IIoT networks with a large number of nodes and interference. The main contributions of our paper are threefold: (i) a bandwidth allocation mechanism that uses Kalman filtering techniques to effectively calculate the number of cells required for a given time, (ii) a channel ranking mechanism that combines metrics such as the PDR, RSSI, and BN to select channels with the best performance, and (iii) a new Key Performance Indicator (KPI) that measures the elapsed time from network formation until the first packet reception at the root.

End-to-end bandwidth allocation scheme for voice traffic support over MANETs

2010 ◽  
Vol 48 (3-4) ◽  
pp. 261-276 ◽  
Author(s):  
Ghalem Boudour ◽  
Zoubir Mammeri ◽  
Cédric Teyssié
Keyword(s):  
Bandwidth Allocation ◽  
Allocation Scheme ◽  
Voice Traffic ◽  
End To End

scholarly journals Bandwidth allocation under end-to-end percentile delay bounds

2011 ◽  
Vol 21 (6) ◽  
pp. 536-547 ◽  
Author(s):  
Bushra Anjum ◽  
Harry Perros ◽  
Xenia Mountrouidou ◽  
Kimon Kontovasilis
Keyword(s):  
Bandwidth Allocation ◽  
Delay Bounds ◽  
End To End
Sign in / Sign up

Export Citation Format

Share Document