The file allocation problem--A queueing network optimization approach
dc.contributor.author | Srinivasan, Mandyam M. | en_US |
dc.contributor.author | Kant, Krishna | en_US |
dc.date.accessioned | 2006-04-07T20:02:15Z | |
dc.date.available | 2006-04-07T20:02:15Z | |
dc.date.issued | 1987 | en_US |
dc.identifier.citation | Srinivasan, M. M., Kant, K. (1987)."The file allocation problem--A queueing network optimization approach." Computers & Operations Research 14(5): 349-361. <http://hdl.handle.net/2027.42/26948> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6VC5-48M3022-7J/2/93fc4d11c9b81a316fe27ac2baa3b659 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/26948 | |
dc.description.abstract | A set of customers use a connected network of computer installations, each accessing the network from a particular node. These customers share information contained in a set of data files. A typical customer's need is characterized by a request requiring a subset of these files being accessed in a Markovian sequence. The cycle time for this customer is the total time taken on the average to complete his request sequence. The objective is to locate a single copy of each of the files in such a way that a weighted sum of these response times is minimized. The problem is modelled as a Closed Queueing Network optimization problem. Models are developed for both single and multiple chain cases. An incremental analysis approach is used to solve the single chain case. For the multiple chain case, it is shown how this model approximates to a set partitioning problem under certain conditions. Efficient heuristics are developed to solve this partitioning problem. With certain simplifying assumptions, the associated communication problem is then included in the model. | en_US |
dc.format.extent | 1227962 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | The file allocation problem--A queueing network optimization approach | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Management | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbsecondlevel | Economics | en_US |
dc.subject.hlbtoplevel | Business | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109-2117, U.S.A. | en_US |
dc.contributor.affiliationother | Department of Computer Science, The Pennsylvania State University, University Park, PA 16802, U.S.A. | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/26948/1/0000514.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0305-0548(87)90032-3 | en_US |
dc.identifier.source | Computers & Operations Research | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.