A per-flow based node architecture for integrated services packet networks

Dapeng Wu, Yiwei Thomas Hou, Bo Li, H. Jonathan Chao

Research output: Contribution to journalArticle

Abstract

As the Internet transforms from the traditional best-effort service network into QoS-capable multi-service network, it is essential to have new architectural design and appropriate traffic control algorithms in place. This paper presents a network node architecture and several traffic management mechanisms that are capable of achieving QoS provisioning for the guaranteed service (GS), the controlled-load (CL) service, and the best-effort (BE) service for future integrated services networks. A key feature of our architecture is that it resolves the out-of-sequence problem associated with the traditional design. We also propose two novel packet discarding mechanisms called selective pushout (SP) and selective pushout plus (SP+). Simulation results show that, once admitted into the network, our architecture and traffic management algorithms provide, under all conditions, hard performance guarantees to GS flows and consistent (or soft) performance guarantees to CL flows, respectively; minimal negative impact to in-profile GS, CL and BE traffic should there be any out-of-profile behavior from some CL flows.

Original languageEnglish (US)
Pages (from-to)135-160
Number of pages26
JournalTelecommunication Systems
Volume17
Issue number1-2
StatePublished - 2001

Fingerprint

Packet networks
Quality of service
Architectural design
Traffic control
Network architecture
Telecommunication traffic
Internet

Keywords

  • Best-effort (BE) service
  • Call admission control (CAC)
  • Controlled-load (CL) service
  • Deficit round robin (DRR)
  • Guaranteed service (GS)
  • Integrated services (intServ) networks
  • Per-flow queueing
  • Shaped virtual clock (SVC)
  • Weighted round robin (WRR)

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

A per-flow based node architecture for integrated services packet networks. / Wu, Dapeng; Hou, Yiwei Thomas; Li, Bo; Chao, H. Jonathan.

In: Telecommunication Systems, Vol. 17, No. 1-2, 2001, p. 135-160.

Research output: Contribution to journalArticle

Wu, Dapeng ; Hou, Yiwei Thomas ; Li, Bo ; Chao, H. Jonathan. / A per-flow based node architecture for integrated services packet networks. In: Telecommunication Systems. 2001 ; Vol. 17, No. 1-2. pp. 135-160.
@article{0323ae6b0b784ef697610ec9bcb2855d,
title = "A per-flow based node architecture for integrated services packet networks",
abstract = "As the Internet transforms from the traditional best-effort service network into QoS-capable multi-service network, it is essential to have new architectural design and appropriate traffic control algorithms in place. This paper presents a network node architecture and several traffic management mechanisms that are capable of achieving QoS provisioning for the guaranteed service (GS), the controlled-load (CL) service, and the best-effort (BE) service for future integrated services networks. A key feature of our architecture is that it resolves the out-of-sequence problem associated with the traditional design. We also propose two novel packet discarding mechanisms called selective pushout (SP) and selective pushout plus (SP+). Simulation results show that, once admitted into the network, our architecture and traffic management algorithms provide, under all conditions, hard performance guarantees to GS flows and consistent (or soft) performance guarantees to CL flows, respectively; minimal negative impact to in-profile GS, CL and BE traffic should there be any out-of-profile behavior from some CL flows.",
keywords = "Best-effort (BE) service, Call admission control (CAC), Controlled-load (CL) service, Deficit round robin (DRR), Guaranteed service (GS), Integrated services (intServ) networks, Per-flow queueing, Shaped virtual clock (SVC), Weighted round robin (WRR)",
author = "Dapeng Wu and Hou, {Yiwei Thomas} and Bo Li and Chao, {H. Jonathan}",
year = "2001",
language = "English (US)",
volume = "17",
pages = "135--160",
journal = "Telecommunication Systems",
issn = "1018-4864",
publisher = "Springer Netherlands",
number = "1-2",

}

TY - JOUR

T1 - A per-flow based node architecture for integrated services packet networks

AU - Wu, Dapeng

AU - Hou, Yiwei Thomas

AU - Li, Bo

AU - Chao, H. Jonathan

PY - 2001

Y1 - 2001

N2 - As the Internet transforms from the traditional best-effort service network into QoS-capable multi-service network, it is essential to have new architectural design and appropriate traffic control algorithms in place. This paper presents a network node architecture and several traffic management mechanisms that are capable of achieving QoS provisioning for the guaranteed service (GS), the controlled-load (CL) service, and the best-effort (BE) service for future integrated services networks. A key feature of our architecture is that it resolves the out-of-sequence problem associated with the traditional design. We also propose two novel packet discarding mechanisms called selective pushout (SP) and selective pushout plus (SP+). Simulation results show that, once admitted into the network, our architecture and traffic management algorithms provide, under all conditions, hard performance guarantees to GS flows and consistent (or soft) performance guarantees to CL flows, respectively; minimal negative impact to in-profile GS, CL and BE traffic should there be any out-of-profile behavior from some CL flows.

AB - As the Internet transforms from the traditional best-effort service network into QoS-capable multi-service network, it is essential to have new architectural design and appropriate traffic control algorithms in place. This paper presents a network node architecture and several traffic management mechanisms that are capable of achieving QoS provisioning for the guaranteed service (GS), the controlled-load (CL) service, and the best-effort (BE) service for future integrated services networks. A key feature of our architecture is that it resolves the out-of-sequence problem associated with the traditional design. We also propose two novel packet discarding mechanisms called selective pushout (SP) and selective pushout plus (SP+). Simulation results show that, once admitted into the network, our architecture and traffic management algorithms provide, under all conditions, hard performance guarantees to GS flows and consistent (or soft) performance guarantees to CL flows, respectively; minimal negative impact to in-profile GS, CL and BE traffic should there be any out-of-profile behavior from some CL flows.

KW - Best-effort (BE) service

KW - Call admission control (CAC)

KW - Controlled-load (CL) service

KW - Deficit round robin (DRR)

KW - Guaranteed service (GS)

KW - Integrated services (intServ) networks

KW - Per-flow queueing

KW - Shaped virtual clock (SVC)

KW - Weighted round robin (WRR)

UR - http://www.scopus.com/inward/record.url?scp=27144442075&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27144442075&partnerID=8YFLogxK

M3 - Article

VL - 17

SP - 135

EP - 160

JO - Telecommunication Systems

JF - Telecommunication Systems

SN - 1018-4864

IS - 1-2

ER -