Revision as of 13:23, 21 January 2021

Abstract

The Call Admission Control (CAC) method presented in this paper is based on the statistical properties of the network’s traffic variables. It probabilistically estimates the time until the release of a seized channel: the admission control depends on the computed mean remaining time averaged along all channels at a specific instant and on a time threshold. The policy produces a smooth transition between the QoS metrics, giving the operator the freedom to design the network at the desired QoS point. Another valuable property is that the algorithm is straightforward and fed only by simple teletraffic metrics: distribution and the first and second moments of Channel Holding Time (CHT). Simplicity is important for a CAC method because decisions for accepting or rejecting calls must be computed quickly and frequently.

Original document

The different versions of the original document can be found in:

• http://hdl.handle.net/2117/2146

• http://upcommons.upc.edu/bitstream/handle/2117/2146/aaa1aa.pdf%3Bjsessionid%3DAE3362414F1F482A52A688E64671A365?sequence%3D3

• http://www.springerlink.com/index/pdf/10.1007/978-3-540-68807-5_1,

http://dx.doi.org/10.1007/978-3-540-68807-5_1

• https://link.springer.com/chapter/10.1007/978-3-540-68807-5_1,

http://upcommons.upc.edu/bitstream/handle/2117/2146/aaa1aa.pdf;sequence=3,

https://dblp.uni-trier.de/db/conf/wwic/wwic2008.html#VassilevaB08,

https://rd.springer.com/chapter/10.1007%2F978-3-540-68807-5_1,

https://academic.microsoft.com/#/detail/1583406194