A New Traffic Model for Core-stateless Scheduling

Gang Cheng; Li Zhu; Nirwan Ansari

A New Traffic Model for Core-stateless Scheduling

Gang Cheng, Li Zhu, Nirwan Ansari

Electrical and Computer Engineering

Research output: Contribution to conference › Paper › peer-review

Abstract

Core-stateless scheduling algorithms can provide a similar level of guaranteed services as the stateful approach, while they do not need per-flow management. They hence possess both the properties of Quality-of-Service (QoS) provisioning and high scalability. In this paper, by showing the current existing traffic models are not applicable to core-stateless networks, a new and efficient traffic model for characterizing traffic in a core-stateless network is proposed, and its properties are presented.

Original language	English (US)
Pages	3206-3210
Number of pages	5
State	Published - 2003
Event	IEEE Global Telecommunications Conference GLOBECOM'03 - San Francisco, CA, United States Duration: Dec 1 2003 → Dec 5 2003

Other

Other	IEEE Global Telecommunications Conference GLOBECOM'03
Country/Territory	United States
City	San Francisco, CA
Period	12/1/03 → 12/5/03

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering
Global and Planetary Change

Keywords

Core-stateless network
QoS
Traffic scheduling

Cite this

@conference{172cfaeaa15342ff821433639cccc0e6,

title = "A New Traffic Model for Core-stateless Scheduling",

abstract = "Core-stateless scheduling algorithms can provide a similar level of guaranteed services as the stateful approach, while they do not need per-flow management. They hence possess both the properties of Quality-of-Service (QoS) provisioning and high scalability. In this paper, by showing the current existing traffic models are not applicable to core-stateless networks, a new and efficient traffic model for characterizing traffic in a core-stateless network is proposed, and its properties are presented.",

keywords = "Core-stateless network, QoS, Traffic scheduling",

author = "Gang Cheng and Li Zhu and Nirwan Ansari",

year = "2003",

language = "English (US)",

pages = "3206--3210",

note = "IEEE Global Telecommunications Conference GLOBECOM'03 ; Conference date: 01-12-2003 Through 05-12-2003",

}

TY - CONF

T1 - A New Traffic Model for Core-stateless Scheduling

AU - Cheng, Gang

AU - Zhu, Li

AU - Ansari, Nirwan

PY - 2003

Y1 - 2003

N2 - Core-stateless scheduling algorithms can provide a similar level of guaranteed services as the stateful approach, while they do not need per-flow management. They hence possess both the properties of Quality-of-Service (QoS) provisioning and high scalability. In this paper, by showing the current existing traffic models are not applicable to core-stateless networks, a new and efficient traffic model for characterizing traffic in a core-stateless network is proposed, and its properties are presented.

AB - Core-stateless scheduling algorithms can provide a similar level of guaranteed services as the stateful approach, while they do not need per-flow management. They hence possess both the properties of Quality-of-Service (QoS) provisioning and high scalability. In this paper, by showing the current existing traffic models are not applicable to core-stateless networks, a new and efficient traffic model for characterizing traffic in a core-stateless network is proposed, and its properties are presented.

KW - Core-stateless network

KW - QoS

KW - Traffic scheduling

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

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

M3 - Paper

AN - SCOPUS:0842310753

SP - 3206

EP - 3210

T2 - IEEE Global Telecommunications Conference GLOBECOM'03

Y2 - 1 December 2003 through 5 December 2003

ER -

A New Traffic Model for Core-stateless Scheduling

Abstract

Other

All Science Journal Classification (ASJC) codes

Keywords

Other files and links

Fingerprint

Cite this