Capacity sharing in an integrated voice/data packet-switched multiplexer: optimal and sequential solutions
- Resource Type
- Conference
- Authors
- Bui, B.N.; Korezlioglu, H.
- Source
- 1989 IEEE Global Telecommunications Conference and Exhibition 'Communications Technology for the 1990s and Beyond' Global Telecommunications Conference and Exhibition 'Communications Technology for the 1990s and Beyond' (GLOBECOM), 1989. IEEE. :543-547 vol.1 1989
- Subject
- Communication, Networking and Broadcast Technologies
Computing and Processing
Components, Circuits, Devices and Systems
Aerospace
Multiplexing
Traffic control
Computational modeling
Telecommunication traffic
Channel capacity
Cost function
Lagrangian functions
Heuristic algorithms
Dynamic programming
Bandwidth
- Language
The authors consider an integrated packet-switched system performing voice/data multiplexing with a fixed frame duration. The optimal allocation of the channel capacity is formulated as a Markovian decision process problem with a long-run average cost to minimize subject to a hard constraint. A Lagrange multiplier method was used to develop an algorithm, based on dynamic programming, for the computation of the optimal policy. The authors also propose an easily implementable but suboptimal policy and compare the performances of these policies by simulation. Numerical results show the feasibility and the reliability of the dynamic programming procedure.ETX