A New Traffic Model for Core-stateless Scheduling

Gang Cheng, Li Zhu, Nirwan Ansari

Research output: Contribution to conferencePaperpeer-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 languageEnglish (US)
Pages3206-3210
Number of pages5
StatePublished - Dec 1 2003
EventIEEE Global Telecommunications Conference GLOBECOM'03 - San Francisco, CA, United States
Duration: Dec 1 2003Dec 5 2003

Other

OtherIEEE Global Telecommunications Conference GLOBECOM'03
Country/TerritoryUnited States
CitySan Francisco, CA
Period12/1/0312/5/03

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Fingerprint

Dive into the research topics of 'A New Traffic Model for Core-stateless Scheduling'. Together they form a unique fingerprint.

Cite this