SHORTEST PATH IN NETWORKS OF QUEUES IN STEADY-STATE

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.

AZARON A.; KIANFAR F.

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

Journal Paper

Paper Information

Journal: Year:2001 | Volume:35 | Issue:2 (72) Page(s): 181-190

Download Full-Text

Persian Verion

View:

1,216

Download:

Cites:

Information Journal Paper

Title

SHORTEST PATH IN NETWORKS OF QUEUES IN STEADY-STATE

Author(s)

AZARON A. | KIANFAR F. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

This paper considers the problem of finding the shortest path from the source node to the sink node in networks of queues in steady conditions. Some nodes in the network contain service stations with either one or infinite number of servers. The arrival process is assumed to be Poisson and also the arc lengths are assumed to be mutually independent random variables. The paper introduces a method, which transforms each node that contains a service station to a stochastic arc corresponding to the waiting time in that node. The stochastic network is then transformed to a bicriteria network by computing the expected value and the variance of the waiting times and augmenting those to the new arc. Finally, by defining the proper utility function, dynamic programming is used to obtain the shortest path.

Cites

No record.

References

No record.

Cite

APA: Copy

AZARON, A., & KIANFAR, F.. (2001). SHORTEST PATH IN NETWORKS OF QUEUES IN STEADY-STATE. JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN), 35(2 (72)), 181-190. SID. https://sid.ir/paper/14132/en

Vancouver: Copy

AZARON A., KIANFAR F.. SHORTEST PATH IN NETWORKS OF QUEUES IN STEADY-STATE. JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN)[Internet]. 2001;35(2 (72)):181-190. Available from: https://sid.ir/paper/14132/en

IEEE: Copy

A. AZARON, and F. KIANFAR, “SHORTEST PATH IN NETWORKS OF QUEUES IN STEADY-STATE,” JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN), vol. 35, no. 2 (72), pp. 181–190, 2001, [Online]. Available: https://sid.ir/paper/14132/en

Related Journal Papers