Determining efficient facility locations on a tree network operating as a FIFO  M /G/1 queue | Zendy

Prasad Srinivas Y. | Zendy; Batta Rajan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Determining efficient facility locations on a tree network operating as a FIFO M /G/1 queue

Author(s) -

Prasad Srinivas Y.,

Batta Rajan

Publication year - 1993

Publication title -

networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.977

H-Index - 64

eISSN - 1097-0037

pISSN - 0028-3045

DOI - 10.1002/net.3230230703

Subject(s) - queue , computer science , fifo (computing and electronics) , tree (set theory) , priority queue , facility location problem , fifo and lifo accounting , queueing theory , computer network , operations research , mathematical optimization , real time computing , mathematics , operating system , combinatorics

In this article, we study the problem of locating a server on a tree network that operates as a FIFO M/G/1 queue. The goal is to identify sets of efficient facility locations with respect to moments of the response time. The results are illustrated via an example. © 1993 by John Wiley & Sons, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research