Abstract
Two communication traffic streams with Poisson statistics arrive at a network node. These are to be transmitted across a channel with a total bandwidth capacity of C frequency slots. Messages not accepted at the node are assumed to be lost. Under the assumption of exponential service time distributions, we study the problem of dynamic allocation of available channel bandwidth among the two traffic types so as to minimize a weighted sum of blocking probabilities. Modeling the system as a two-dimensional Markov chain, we show by an application of dynamic programming principles that the optimal policy has the form of a switching curve.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
