Survivable Multipath Provisioning with Differential Delay Constraint in Telecom Mesh Networks

2008 ◽  
Author(s):  
S. Huang ◽  
B. Mukherjee ◽  
C. Martel
Keyword(s):  
Mesh Networks ◽  
Delay Constraint ◽  
Differential Delay ◽  
Telecom Mesh Networks ◽  
Multipath Provisioning

A Multistate Multipath Provisioning Scheme for Differentiated Failures in Telecom Mesh Networks

2010 ◽  
Vol 28 (11) ◽  
pp. 1585-1596 ◽  
Author(s):  
Sheng Huang ◽  
Ming Xia ◽  
Charles U. Martel ◽  
Biswanath Mukherjee
Keyword(s):  
Mesh Networks ◽  
Telecom Mesh Networks ◽  
Multipath Provisioning

Fairness-Aware Degradation Based Multipath Re-provisioning Strategy for Post-Disaster Telecom Mesh Networks

2016 ◽  
Vol 8 (6) ◽  
pp. 441 ◽  
Author(s):  
Ning-Hai Bao ◽  
Massimo Tornatore ◽  
Charles U. Martel ◽  
Biswanath Mukherjee
Keyword(s):  
Mesh Networks ◽  
Telecom Mesh Networks ◽  
Post Disaster

scholarly journals Distributed Rate-Control and Delay-Guaranteed Scheduling in MR-MC Wireless Mesh Networks

Sensors ◽  
2019 ◽  
Vol 19 (22) ◽  
pp. 5005
Author(s):  
Li ◽  
Zhao ◽  
Geng ◽  
Zhang
Keyword(s):  
Wireless Mesh Networks ◽  
Rate Control ◽  
Mesh Networks ◽  
Scheduling Algorithm ◽  
Arrival Rate ◽  
Optimization Method ◽  
Conflict Graph ◽  
Delay Constraint ◽  
Wireless Mesh ◽  
The Stability

Wireless mesh networks (WMNs) can provide flexible wireless connections in smart city, Internet of Things (IoT), and device-to-device (D2D) communications. The performance of WMNs can be greatly enhanced by adopting the multi-radio multi-channel (MR-MC) technique, which enables a node to communicate with more nodes simultaneously. However, increasing the number of data flows will result in network congestion and longer end-to-end delays. In this paper, a distributed rate-control and delay-aware (DRDA) scheduling algorithm is proposed based on a multidimensional conflict graph. To satisfy the arrival rate and delay constraints of a flow, two virtual queues are constructed. All the actual and virtual queues are stabilized by the Lyapunov drift optimization method. The scheduling policy of each flow is optimized only based on the local information. The simulation results show that our proposed algorithm can maintain the stability of all the queues and strictly satisfy the arrival rate and delay constraint of each flow in the network as well.

Sign in / Sign up

Export Citation Format

Share Document