Dynamic Routing and Admission Control for Virtual Circuit Networks
A. A. Economides
University of Macedonia
Email: economid_AT_macedonia.uom.gr
P. A. Ioannou
University of Southern California
Email: ioannou_AT_bode.usc.edu
J. A. Silvester
University of Southern California
Email: silveste_AT_usc.edu
Abstract
The dynamic joint routing and admission control problem in
multiple class multiple source-destination virtual circuit networks
is considered. A nonlinear dynamic queueing model for virtual circuit
networks that considers the dynamic interaction among the virtual
circuit and packet processes is introduced. Then a multi-objective
cost function of rejecting and maintaining virtual circuits, as well
as of delaying and servicing packets is defined. The combined problem
is formulated as an optimal control problem. Necessary optimality
conditions are provided by Pontryagin's maximum principle. Sufficient
optimality conditions based on the convexity of the Hamiltonian
function are also given. For the finite horizon, the optimal controls
can be found after numerically solving a Two-Point Boundary-Value
Problem. For the long-run stationary equilibrium, the state-dependent
routing and admission controls are derived.
Keywords: dynamic admission control; dynamic routing; multi-objective;
optimal control; virtual circuit; networks;
JNSM: Vol. 3, No. 2, 1995
Dynamic Routing and Admission Control for Virtual Circuit [Vol. 3, No. 2, 1995]
NOTE: only abstract of paper available on-line
Back to JNSM main page