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 "robust network function virtualization"):
  Abstract: Network function virtualization (NFV) enables on-demand network function (NF) deployment providing agile and dynamic network services. Through an evaluation metric that quantifies the minimal reliability among all NFs for all demands, service providers and operators may better facilitate flexible NF service recovery and migration, thus offer higher service reliability. In this paper, we present evaluation metrics on NFV reliability and solution approaches to solve robust NFV under random NF-enabled node failure(s). We demonstrate how to construct an auxiliary NF-enabled network and its mapping onto the physical substrate network. With constructed NF-enabled network, we develop pseudo-polynomial algorithms to solve the robust NF and SFC $s-t$ path problems -- subproblems of robust NFV. We also present approximation algorithms for robust NFV with the SFC-Fork as the NF forwarding graph. Furthermore, we propose exact solution approaches via mixed-integer linear programming (MILP) under the general setting. Computational results show that our proposed solution approaches are capable of managing robust NFV in a large-size network.

Includes members:
  Member "integrated nfv sdn architectures a systematic literature review":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an end to end performance analysis for service chaining in a virtualized network")
  Member "a scalable approach for service chain mapping with multiple sc instances in a wide area network":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "placement and routing optimization problem for service function chain state of art and future opportunities")
  Member "shortest path and maximum flow problems under service function chaining constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online joint placement and allocation of virtual network functions with heterogeneous servers")
  Member "service function chaining resource allocation a survey":
    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 "joint reliability aware and cost efficient path allocation and vnf placement using sharing scheme")
  Member "service chain and virtual network embeddings approximations using randomized rounding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "joint reliability aware and cost efficient path allocation and vnf placement using sharing scheme")
  Member "network function virtualization state of the art and research challenges":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "fronthaul constrained cloud radio access networks insights and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the capacity regions of cloud radio access networks with limited orthogonal fronthaul")

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)