Abstract
Connection admission control (CAC) is usually modeled by superimposing the existing traffic and the new connection on each asynchronous transfer mode (ATM) link. Correlation in the single streams can affect the loss probabilities and waiting times of both streams. In order to investigate this influence, an exact solution of the discrete Markovian arrival process (DMAP)/sub 1/ + DMAP/sub 2//D/1/s finite buffer queue is presented. The analysis is done by means of the semi-Markov process (SMP)/D/1/s finite buffer queue. The input process is a discrete-time SMP with extra states representing batches of two cells. Any superposition of two DMAPs is shown to result in an SMP. Numerical results showing that correlation of a single stream can have a significant influence on loss probabilities and waiting times of both input streams are presented. >
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.
