human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "An analysis of the average message overhead in replica control protocols"
  Abstract: Management of replicated data has received considerable attention in the last few years. Several replica control schemes have been proposed which work in the presence of both node and communication link failures. However, this resiliency to failure inflicts a performance penalty in terms of the communication overhead incurred. Though the issue of performance of these schemes from the standpoint of availability of the system has been well addressed, the issue of message overhead has been limited to the analysis of worst case and best case message bounds. In this paper we derive expressions for computing the average message overhead of several well known replica control protocols and provide a comparative study of the different protocols with respect to both average message overhead and system availabilities.

Connected through hyperedge HE-1 (induced by source paper "Are quorums an alternative for data replication"):
  with members:
    - "Chain replication for supporting high throughput and availability"

Connected through hyperedge HE-2 (induced by source paper "On a unified framework for the evaluation of distributed quorum attainment protocols"):
  with members:
    - "A dynamic information-structure mutual exclusion algorithm for distributed systems"

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Computer science