Optimum Locations on a Graph with Probabilistic Demands

Abstract

The traffic demands at the stations of a communication network are usually not deterministic. Optimum locations found using deterministic techniques are poor when the random nature of the network traffic is considered. The concepts of absolute centers and medians are generalized to maximum probability absolute centers and medians. Minimum variance points are also considered. Techniques to locate these optimum points are discussed.