A New Traffic Model for Core-stateless Scheduling

Document Type

Conference Proceeding

Publication Date

1-1-2003

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.

Identifier

0842310753 (Scopus)

Publication Title

Globecom IEEE Global Telecommunications Conference

First Page

3206

Last Page

3210

Volume

6

This document is currently not available here.

Share

COinS