Abstract
Bandwidth reservation has been increasingly used to provide QoS for various network applications. To accommodate a high-priority bandwidth reservation request (BRR), the bandwidth scheduler sometimes needs to preempt existing bandwidth reservations that have been made for BRRs with a lower priority, which is traditionally known as connection preemption. When such preemption is unavoidable, one primary goal of bandwidth scheduling is to minimize the disruption to existing reservations. In this paper, we study the problem of bandwidth reservation preemption for two types of BRRs, bandwidth- and data transfer- oriented, respectively, on one given link of the scheduling network with two different objectives: (i) minimize the number and then the total bandwidth of existing bandwidth reservations to be preempted, and (ii) minimize the total bandwidth and then the number of existing bandwidth reservations to be preempted. We prove these four problems to be NP-complete and propose a heuristic algorithm for each. We also design baseline heuristic algorithms for performance comparison. Extensive simulation results show that the proposed heuristic algorithms outperform those in comparison.
| Original language | English (US) |
|---|---|
| Title of host publication | ICCCN 2018 - 27th International Conference on Computer Communications and Networks |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| ISBN (Electronic) | 9781538651568 |
| DOIs | |
| State | Published - Oct 9 2018 |
| Event | 27th International Conference on Computer Communications and Networks, ICCCN 2018 - Hangzhou City, Zhejiang Province, China Duration: Jul 30 2018 → Aug 2 2018 |
Publication series
| Name | Proceedings - International Conference on Computer Communications and Networks, ICCCN |
|---|---|
| Volume | 2018-July |
Other
| Other | 27th International Conference on Computer Communications and Networks, ICCCN 2018 |
|---|---|
| Country | China |
| City | Hangzhou City, Zhejiang Province |
| Period | 7/30/18 → 8/2/18 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Hardware and Architecture
- Computer Networks and Communications
Keywords
- Bandwidth reservation
- bandwidth preemption
- data transfer
- dynamic provisioning
Cite this
}
Bandwidth preemption for high-priority data transfer on dedicated channels. / Zuo, Liudong; Wu, Chase; Rao, Nageswara S.V.; Hou, Aiqin; Chang, Chia Han.
ICCCN 2018 - 27th International Conference on Computer Communications and Networks. Institute of Electrical and Electronics Engineers Inc., 2018. 8487395 (Proceedings - International Conference on Computer Communications and Networks, ICCCN; Vol. 2018-July).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Bandwidth preemption for high-priority data transfer on dedicated channels
AU - Zuo, Liudong
AU - Wu, Chase
AU - Rao, Nageswara S.V.
AU - Hou, Aiqin
AU - Chang, Chia Han
PY - 2018/10/9
Y1 - 2018/10/9
N2 - Bandwidth reservation has been increasingly used to provide QoS for various network applications. To accommodate a high-priority bandwidth reservation request (BRR), the bandwidth scheduler sometimes needs to preempt existing bandwidth reservations that have been made for BRRs with a lower priority, which is traditionally known as connection preemption. When such preemption is unavoidable, one primary goal of bandwidth scheduling is to minimize the disruption to existing reservations. In this paper, we study the problem of bandwidth reservation preemption for two types of BRRs, bandwidth- and data transfer- oriented, respectively, on one given link of the scheduling network with two different objectives: (i) minimize the number and then the total bandwidth of existing bandwidth reservations to be preempted, and (ii) minimize the total bandwidth and then the number of existing bandwidth reservations to be preempted. We prove these four problems to be NP-complete and propose a heuristic algorithm for each. We also design baseline heuristic algorithms for performance comparison. Extensive simulation results show that the proposed heuristic algorithms outperform those in comparison.
AB - Bandwidth reservation has been increasingly used to provide QoS for various network applications. To accommodate a high-priority bandwidth reservation request (BRR), the bandwidth scheduler sometimes needs to preempt existing bandwidth reservations that have been made for BRRs with a lower priority, which is traditionally known as connection preemption. When such preemption is unavoidable, one primary goal of bandwidth scheduling is to minimize the disruption to existing reservations. In this paper, we study the problem of bandwidth reservation preemption for two types of BRRs, bandwidth- and data transfer- oriented, respectively, on one given link of the scheduling network with two different objectives: (i) minimize the number and then the total bandwidth of existing bandwidth reservations to be preempted, and (ii) minimize the total bandwidth and then the number of existing bandwidth reservations to be preempted. We prove these four problems to be NP-complete and propose a heuristic algorithm for each. We also design baseline heuristic algorithms for performance comparison. Extensive simulation results show that the proposed heuristic algorithms outperform those in comparison.
KW - Bandwidth reservation
KW - bandwidth preemption
KW - data transfer
KW - dynamic provisioning
UR - http://www.scopus.com/inward/record.url?scp=85060440104&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85060440104&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/ICCCN.2018.8487395
DO - https://doi.org/10.1109/ICCCN.2018.8487395
M3 - Conference contribution
T3 - Proceedings - International Conference on Computer Communications and Networks, ICCCN
BT - ICCCN 2018 - 27th International Conference on Computer Communications and Networks
PB - Institute of Electrical and Electronics Engineers Inc.
ER -