Alternative Approaches of Capacity Assignment for Delay Bounded Traffic
Xian Liu · 2008
The capacity assignment (CA) problem is one of the most fundamental topics in packet communication networks. In a previous work, we established the CA model with the packetized generalized processor sharing (PGPS) discipline, took the non-Markovian traffic into account, and introduced the stochastic programming (SP) methodology to solve the problem. In the present work, we address three new issues: the dual model, the multi-session model, and the wait-and-see method.