AN ANALYTICAL APPROACH FOR OPTIMISING THE NUMBER OF REPAIRMEN FOR LARGE SCALE, HOMOGENEOUS, MULTI-SERVER SYSTEMS

Date

2008-01-01

Author

Gemikonakli, Orhan
Sanei, Hadi
Ever, Enver
Koçyiğit, Altan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

45
views

0
downloads

Fault tolerant, large scale multi-server systems require an optimum number of repairmen for maximising performability. However, performability evaluation of such systems is difficult due to the state space explosion problem. In this paper, a simple and flexible approximate technique capable of overcoming state space explosion problem in computing the performability of large Markov models is presented. For validation of results, simulation has been used. It is shown that, this approach can handle large state space. The proposed method allows analysing the breakdown repair behaviour of large multi server systems. An optimisation study is presented together with numerical results showing the relationship of the number of servers and the number of repairmen for optimum performance.

Subject Keywords

Large scale multi-server systems, State Explosion problem, Markov process, Performability and simulation

URI

https://hdl.handle.net/11511/54486

Conference Name

Conference: 20th European Modeling and Simulation Symposium

Collections

Graduate School of Informatics, Conference / Seminar

Suggestions

OpenMETU
Core

A Computationally Efficient Topology Identifiability Analysis of Distribution Systems Eser, Fatih; Yılmaz, Uğur Can; Dursun, Erk; Cinalioglu, Mustafa Cihan; Göl, Murat (2022-07-01) © 2022 Elsevier B.V.Because of the lack of a proper real-time monitoring system at distribution power networks, topology identification can not be performed properly. While in traditional radial structures the topology is unique, in the presence of an open-ring structure, this issue constitutes a risk for the operation of the system, and the safety of the field staff in contact with the system components. Many studies in literature considers this problem in the scope of observability, however having a compl...
A conic quadratic formulation for a class of convex congestion functions in network flow problems Gürel, Sinan (Elsevier BV, 2011-06-01) In this paper we consider a multicommodity network flow problem with flow routing and discrete capacity expansion decisions. The problem involves trading off congestion and capacity assignment (or expansion) costs. In particular, we consider congestion costs involving convex, increasing power functions of flows on the arcs. We first observe that under certain conditions the congestion cost can be formulated as a convex function of the capacity level and the flow. Then, we show that the problem can be effici...
A Link delay computation method for the quality of service support in software defined networks Balo, Efe; Güran Schmidt, Ece.; Department of Electrical and Electronics Engineering (2019) Packet switched networks cannot provide tight delay bounds that are required by certain types of applications despite facilitating high throughput. Therefore, delay measurementtechniquesforpacket-switchednetworkshavealwaysgrabbedtheattention of the community to both utilize advantages of packet-switched networks and provide a realistic end to end delay prediction of packets. Software Deﬁned Networking (SDN) isa new paradigmofpacket-switchednetworkingwhichgathersmanagement functionality of network in a logic...
Parallel solution of sparse linear systems to find the shortest path in large scale graphs Arslan, Hilal; Manguoğlu, Murat (2018-06-29) Solving the shortest path problem on large scale networks is crucial for many applications. As parallelism became more common with the advent of multi-core architectures as well as large and complex networks have begun to emerge in many settings, it is inevitable to come up with algorithms that take advantage of the current architectures. One alternative to solve the shortest path problem is to use one of the classical or improved parallel variations of the Dijkstra’s algorithm. However, when the size of th...
Evaluation of Terahertz Channel in Data Centers MOLLAHASANİ, Shahram; Onur, Ertan (2016-04-29) Designing data center network topologies with the objective of minimizing cost, increasing bisection bandwidth and decreasing latency is a difficult problem. The solutions in the literature mainly concentrate on wired networks and minimizing wiring costs thereof. Only a few proposals address the benefit of employing wireless communications in data centers due to spectrum and bandwidth limitations of current wireless communication technologies. By using terahertz communication in a data center as a complemen...

Citation Formats

O. Gemikonakli, H. Sanei, E. Ever, and A. Koçyiğit, “AN ANALYTICAL APPROACH FOR OPTIMISING THE NUMBER OF REPAIRMEN FOR LARGE SCALE, HOMOGENEOUS, MULTI-SERVER SYSTEMS,” presented at the Conference: 20th European Modeling and Simulation Symposium, Amantea, ITALY, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/54486.