The Critical Network Flow Problem

Migratability and Survivability

Ruozhou Yu, Guoliang Xue, Xiang Zhang

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
JournalIEEE/ACM Transactions on Networking
DOIs
StateAccepted/In press - Sep 16 2017

Fingerprint

Bandwidth
Heuristic algorithms
Polynomials
Internet
Experiments

Keywords

  • bandwidth guarantee
  • Critical network flow
  • flow migration
  • survivability.
  • traffic engineering

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

The Critical Network Flow Problem : Migratability and Survivability. / Yu, Ruozhou; Xue, Guoliang; Zhang, Xiang.

In: IEEE/ACM Transactions on Networking, 16.09.2017.

Research output: Contribution to journalArticle

@article{4f453c25e1774f42b52881021b1cbd06,
title = "The Critical Network Flow Problem: Migratability and Survivability",
abstract = "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.",
keywords = "bandwidth guarantee, Critical network flow, flow migration, survivability., traffic engineering",
author = "Ruozhou Yu and Guoliang Xue and Xiang Zhang",
year = "2017",
month = "9",
day = "16",
doi = "10.1109/TNET.2017.2747588",
language = "English (US)",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - The Critical Network Flow Problem

T2 - Migratability and Survivability

AU - Yu, Ruozhou

AU - Xue, Guoliang

AU - Zhang, Xiang

PY - 2017/9/16

Y1 - 2017/9/16

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 - bandwidth guarantee

KW - Critical network flow

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

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

ER -