登入選單
返回Google圖書搜尋
出版Department of Computer Science, University of Illinois at Urbana-Champaign, 1990
URLhttp://books.google.com.hk/books?id=oLHQiSyo0kUC&hl=&source=gbs_api
註釋Abstract: "In this paper we describe a class of networks called hierarchical networks. We show how certain reliability measures can be computed efficiently in a hierarchical network. In particular, we describe an algorithm to compute the probability of reaching at least k members of a set of nodes. This algorithm can be used by applications that provide highly available services to compute the probability that a client can reach at least k replicated servers. We also show how to compute the average availability of the service for a group of clients when k = 1. Finally, we describe a heuristic that attempts to maximize the average availability by choosing appropriate locations for the servers.