human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "joint reliability aware and cost efficient path allocation and vnf placement using sharing scheme"):
  Abstract: Network function virtualization (NFV) is a vital player of modern networks providing different types of services such as traffic optimization, content filtering, and load balancing. More precisely, NFV is a provisioning technology aims at reducing the large Capital Expenditure (CAPEX) of network providers by moving services from dedicated hardware to commodity servers using Virtualized Network Functions (VNF). A sequence of VNFs/services following a logical goal is referred to as a Service Function Chain (SFC). The movement toward SFC introduces new challenges to those network services which require high reliability. To address this challenge, redundancy schemes are introduced. Existing redundancy schemes using dedicated protection enhance the reliability of services, however, they do not consider the cost of redundant VNFs. In this paper, we propose a novel reliability enhancement method using a shared protection scheme to reduce the cost of redundant VNFs. To this end, We mathematically formulate the problem as a Mixed Integer Linear Programming (MILP). The objective is to determine optimal reliability that could be achieved with minimum cost. Although the corresponding optimization problem can be solved using existing MILP solvers, the computational complexity is not rational for realistic scenarios. Thereafter, we propose a Reliability-aware and minimum-Cost based Genetic (RCG) algorithm to solve this problem with low computational complexity. In order to evaluate the proposed solution, We have compared it with four different solutions. Simulation results show that RCG achieves near-optimal performance at a much lower complexity compared with the optimal solution.

Includes members:
  Member "optimal virtual network function placement in multi cloud service function chaining architecture":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cybersecurity for industrial control systems a survey")
  Member "implementation of virtual network function chaining through segment routing in a linux based nfv infrastructure":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "srperf a performance evaluation framework for ipv6 segment routing")
  Member "on the trade off between computational load and reliability for network function virtualization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a coverage aware resource provisioning method for network slicing")
  Member "distributed service function chaining":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a virtual network customization framework for multicast services in nfv enabled core networks")
  Member "an approximation algorithm for path computation and function placement in sdns":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robust network function virtualization")
  Member "service chain and virtual network embeddings approximations using randomized rounding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robust network function virtualization")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.NI(Networking and Internet Architecture)