About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE Communications Letters
Paper
Power law characteristics and loss probability: Finite buffer queueing systems
Abstract
Analytical framework based on maximum Tsallis entropy is proposed for studying finite buffer queueing system when information about fractional moment of queue size and utilization is available. The framework enables us to obtain closed form expressions for queue length distribution and loss probability for generalized M/M/1/N system when input to the system possesses power law characteristics. It is shown that queue length distribution depicts power law as the number of units in the system becomes large. A new result for asymptotic loss probability exhibiting power law behavior is derived. © 2006 IEEE.