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 online composition routing and nf placement for nfv enabled services"):
  Abstract: Network function virtualization (NFV) fosters innovation in the networking field and reduces the complexity involved in managing modern-day conventional networks. Via NFV, the provisioning of a network service becomes more agile, whereby virtual network functions can be instantiated on commodity servers and data centers on demand. Network functions can be either mandatory or best-effort. The former type is strictly necessary for the correctness of a network service, whereas the latter is preferrable yet not necessary. In this paper, we study the online provisioning of NFV-enabled network services. We consider both unicast and multicast NFV-enabled services with multiple mandatory and best-effort NF instances. We propose a primal-dual based online approximation algorithm that allocates both processing and transmission resources to maximize a profit function, subject to resource constraints on physical links and NFV nodes. The online algorithm resembles a joint admission mechanism and an online composition, routing and NF placement framework. The online algorithm is derived from an offline formulation through a primal-dual based analysis. Such analysis offers direct insights and a fundamental understanding on the nature of the profit-maximization problem for NFV-enabled services with multiple resource types.

Includes members:
  Member "a virtual network customization framework for multicast services in nfv enabled core networks":
    also connected through other hyperedges:
      (none)
  Member "near optimal online algorithms and fast approximation algorithms for resource allocation problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online stochastic max weight matching prophet inequality for vertex and edge arrival models")
  Member "distributed service function chaining":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a virtual network customization framework for multicast services in nfv enabled core networks")
  Member "service function chaining resource allocation a survey":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a virtual network customization framework for multicast services in nfv enabled core networks")
  Member "online admission control and embedding of service chains":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "placement and allocation of virtual network functions multi dimensional case")
  Member "scalable steiner tree for multicast communications in software defined networking":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a virtual network customization framework for multicast services in nfv enabled core networks")
  Member "competitive and deterministic embeddings of virtual networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "placement and allocation of virtual network functions multi dimensional case")

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)