Network location of a reliable center using the most reliable route policy

Authors:
José Santiváñez;Emanuel Melachrinoudis;Mary E. Helander
Affiliations:
Department of Industrial and Management Engineering, School of Engineering, Universidad del Turabo, P.O. Box 3030, Gurabo, PR 00778, USA;Department of Mechanical and Industrial Engineering, Northeastern University, 339 Snell Engineering Building, 360 Huntington Avenue, Boston, MA 02115, USA;Mathematical Sciences, IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA
Venue:
Computers and Operations Research
Year:
2009

Citing 10
Cited 0

The maximum reliability location problem and x&agr;-reliable &rgr;-center problem: derivatives of the probabilistic location set covering problem

Annals of Operations Research
Network reliability and algebraic structures

Network reliability and algebraic structures
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Optimal location of facilities on a network with an unreliable node or link

Information Processing Letters
A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges

Theoretical Computer Science
An O(mn) algorithm for the 1-maximin problem on a network

Computers and Operations Research
On solving unreliable planar location problems

Computers and Operations Research
The Combinatorics of Network Reliability

The Combinatorics of Network Reliability
Towards unified formulations and extensions of two classical probabilistic location models

Computers and Operations Research
Reliability Models for Facility Location: The Expected Failure Cost Case

Transportation Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers a single location on an undirected network with unreliable edges that maximizes the lowest performance level of the network service with respect to all nodes. The problem is termed the reliable 1-center problem and finds applications in telecommunication and computer networks. The users are concerned with the network capability of establishing a route to some service provider. The objective function is formally stated as either minimizing the maximum expected number of unsuccessful responses to demand requests over all nodes, named the reli-minmax problem, or maximizing the minimum expected number of successful responses to demand requests over all nodes, named the reli-maxmin problem, as sub-problems of the most general reliable 1-center problem. Solutions are presented that solve the problem in polynomial time or reduce it to the 1-center problem when it is applied on general networks using a pre-designated route policy, e.g. the most reliable route policy.