By Topic

Queue length distribution of network packet traffic: Tsallis entropy maximization with fractional moments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Karmeshu ; Sch. of Comput. & Syst. Sci., Jawaharlal Nehru Univ., New Delhi, India ; Sharma, S.

A framework based on maximization of Tsallis entropy constrained by fractional moments is proposed to model queue length distribution of number of packets in network traffic exhibiting long-range behavior. For appropriate range of the Tsallis entropy parameter q, it is found that the first moment of number of packets may not exist Based on Euler summation formula, explicit expressions for mean queue length and buffer overflow probability exhibiting power law behavior are obtained. It is shown that in the limiting case as q tends to 1, one recovers the asymptotic results for buffer overflow probability depicting Weibull-like tail.

Published in:

Communications Letters, IEEE  (Volume:10 ,  Issue: 1 )