MAXIMUM ENTROPY ANALYSIS FOR G/G/1 QUEUING SYSTEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

JAIN M.; DHAKAD M.R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF ENGINEERING Year:2003 | Volume:16 | Issue:2 (TRANSACTIONS A: BASICS) Page(s): 163-170

Download Full-Text

View:

989

Download:

Cites:

Information Journal Paper

Title

MAXIMUM ENTROPY ANALYSIS FOR G/G/1 QUEUING SYSTEM

Author(s)

JAIN M. | DHAKAD M.R. | Issue Writer Certificate

Keywords

QUEUE

G/G/1

MAXIMUM ENTROPY

QUEUE LENGTH

LAGRANGES PRINCIPLE

INFORMATION THEORY

Abstract

This paper provides steady state QUEUE-size distribution for a G/G/1 QUEUE by using principle of MAXIMUM ENTROPY. For this purpose we have used average QUEUE length and normalizing condition as constraints to drive QUEUE-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arrival time is equal to one, the average QUEUE length provided tallies with the results for M/G/1 model. Other particulars cases have also been deduced which match with already existing results. این مقاله توزیع طول صف را در حالت پایدار برای مدل صف G/G/1 با استفاده از اصول ماکزیمم انتروپی پیدا میکند. برای انجام این منظور از میانگین طول صف و شرط نرمالیزه کردن به عنوان محدودیت استفاده میشود. مقاله به کمک مثالهای عددی نتایج خوبی را عاید میسازد. در حالت خاص, برای مواردی که مربع ضریب تغییرات زمان مابین دو ورود برابر یک است میانگین طول صف با نتایج مدل صف M/G/1 توافق دارد. حالات خاص دیگری که در حال حاضر وجود دارند نیز استخراج شده و با نتایج این مقاله مطابقت دارد.

Cites

No record.

References

No record.

Cite

APA: Copy

JAIN, M., & DHAKAD, M.R.. (2003). MAXIMUM ENTROPY ANALYSIS FOR G/G/1 QUEUING SYSTEM. INTERNATIONAL JOURNAL OF ENGINEERING, 16(2 (TRANSACTIONS A: BASICS)), 163-170. SID. https://sid.ir/paper/355259/en

Vancouver: Copy

JAIN M., DHAKAD M.R.. MAXIMUM ENTROPY ANALYSIS FOR G/G/1 QUEUING SYSTEM. INTERNATIONAL JOURNAL OF ENGINEERING[Internet]. 2003;16(2 (TRANSACTIONS A: BASICS)):163-170. Available from: https://sid.ir/paper/355259/en

IEEE: Copy

M. JAIN, and M.R. DHAKAD, “MAXIMUM ENTROPY ANALYSIS FOR G/G/1 QUEUING SYSTEM,” INTERNATIONAL JOURNAL OF ENGINEERING, vol. 16, no. 2 (TRANSACTIONS A: BASICS), pp. 163–170, 2003, [Online]. Available: https://sid.ir/paper/355259/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops