Capacity Assignment for Delay Bounded Packet Traffic

Author

Liu, Xian

Author_Institution

Univ. of Arkansas at Little Rock, Little Rock

fYear

2007

fDate

26-30 Nov. 2007

Firstpage

492

Lastpage

496

Abstract

The capacity assignment (CA) problem is one of the most essential yet important topics in packet communication networks. However, most reported CA models were established under the framework of Markovian queuing processes or, in general, renewal processes. The crucial properties such as self- similarity and correlations have usually been ignored. In the present work, we establish the CA model with the packetized generalized processor sharing (PGPS) discipline. The non-Markovian traffic is taken into account. The models is solved by the stochastic programming (SP) methodology.

Keywords

packet switching; quality of service; stochastic programming; telecommunication network management; telecommunication network planning; telecommunication traffic; capacity assignment problem; communication Network management; communication network design; communication network planning; delay bounded packet traffic; nonMarkovian traffic; packet communication networks; packet switching networks; packetized generalized processor sharing discipline; quality of service; stochastic programming methodology; Capacity planning; Communication networks; Delay; Packet switching; Quality of service; Regulators; Stochastic processes; Systems engineering and theory; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE

Conference_Location

Washington, DC

Print_ISBN

978-1-4244-1042-2

Electronic_ISBN

978-1-4244-1043-9

Type

conf

DOI

10.1109/GLOCOM.2007.98

Filename

4411008