TY - JOUR
T1 - The Critical Network Flow Problem
T2 - Migratability and Survivability
AU - Yu, Ruozhou
AU - Xue, Guoliang
AU - Zhang, Xiang
N1 - Funding Information:
Manuscript received February 3, 2017; revised July 12, 2017; accepted August 18, 2017; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor H. Jiang. Date of publication September 18, 2017; date of current version December 15, 2017. This work was supported by the NSF under Grant 1421685, Grant 1461886, and Grant 1704092. (Corresponding author: Guoliang Xue.) The authors are with Arizona State University, Tempe, AZ 85287 USA (e-mail: ruozhouy@asu.edu; xue@asu.edu; xzhan229@asu.edu). Digital Object Identifier 10.1109/TNET.2017.2747588
Publisher Copyright:
© 2017 IEEE.
PY - 2017/12
Y1 - 2017/12
N2 - In this paper, we propose a new network abstraction, termed critical network flow, which models the bandwidth requirement of modern Internet applications and services. A critical network flow defines a conventional flow in a network with explicit requirement on its aggregate bandwidth, or the flow value as commonly termed. Unlike common bandwidth-guaranteed connections whose bandwidth is only guaranteed during normal operations, a critical network flow demands strictly enforced bandwidth guarantee during various transient network states, such as network reconfiguration or network failures. Such a demand is called the bandwidth criticality of a critical network flow, which is characterized both by its flow value and capability to satisfy bandwidth guarantee in the transient states.We study algorithmic solutions to the accommodation of critical network flows with different bandwidth criticalities, including the basic case with no transient network state considered, the case with network reconfiguration, and the case with survivability against link failures. We present a polynomial-time optimal algorithm for each case. For the survivable case, we further present a faster heuristic algorithm. We have conducted extensive experiments to evaluate our model and validate our algorithms.
AB - In this paper, we propose a new network abstraction, termed critical network flow, which models the bandwidth requirement of modern Internet applications and services. A critical network flow defines a conventional flow in a network with explicit requirement on its aggregate bandwidth, or the flow value as commonly termed. Unlike common bandwidth-guaranteed connections whose bandwidth is only guaranteed during normal operations, a critical network flow demands strictly enforced bandwidth guarantee during various transient network states, such as network reconfiguration or network failures. Such a demand is called the bandwidth criticality of a critical network flow, which is characterized both by its flow value and capability to satisfy bandwidth guarantee in the transient states.We study algorithmic solutions to the accommodation of critical network flows with different bandwidth criticalities, including the basic case with no transient network state considered, the case with network reconfiguration, and the case with survivability against link failures. We present a polynomial-time optimal algorithm for each case. For the survivable case, we further present a faster heuristic algorithm. We have conducted extensive experiments to evaluate our model and validate our algorithms.
KW - Critical network flow
KW - bandwidth guarantee
KW - flow migration
KW - survivability.
KW - traffic engineering
UR - http://www.scopus.com/inward/record.url?scp=85030639041&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85030639041&partnerID=8YFLogxK
U2 - 10.1109/TNET.2017.2747588
DO - 10.1109/TNET.2017.2747588
M3 - Article
AN - SCOPUS:85030639041
SN - 1063-6692
VL - 25
SP - 3545
EP - 3558
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 6
ER -