human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on orchestrating virtual network functions in nfv"
  Abstract: Middleboxes or network appliances like firewalls, proxies and WAN optimizers have become an integral part of today's ISP and enterprise networks. Middlebox functionalities are usually deployed on expensive and proprietary hardware that require trained personnel for deployment and maintenance. Middleboxes contribute significantly to a network's capital and operational costs. In addition, organizations often require their traffic to pass through a specific sequence of middleboxes for compliance with security and performance policies. This makes the middlebox deployment and maintenance tasks even more complicated. Network Function Virtualization (NFV) is an emerging and promising technology that is envisioned to overcome these challenges. It proposes to move packet processing from dedicated hardware middleboxes to software running on commodity servers. In NFV terminology, software middleboxes are referred to as Virtualized Network Functions (VNFs). It is a challenging problem to determine the required number and placement of VNFs that optimizes network operational costs and utilization, without violating service level agreements. We call this the VNF Orchestration Problem (VNF-OP) and provide an Integer Linear Programming (ILP) formulation with implementation in CPLEX. We also provide a dynamic programming based heuristic to solve larger instances of VNF-OP. Trace driven simulations on real-world network topologies demonstrate that the heuristic can provide solutions that are within 1.3 times of the optimal solution. Our experiments suggest that a VNF based approach can provide more than 4x reduction in the operational cost of a network.

Connected through hyperedge HE-1 (induced by source paper "on service chaining strategies using virtual network functions in operator networks"):
  with members:
    - "a scalable approach for service chain mapping with multiple sc instances in a wide area network"
    - "optimal virtual network function placement in multi cloud service function chaining architecture"
    - "network function virtualization state of the art and research challenges"
    - "specifying and placing chains of virtual network functions"
    - "research directions in network service chaining"
    - "resource allocation in a network based cloud computing environment design challenges"

Connected through hyperedge HE-2 (induced by source paper "optimal control of distributed computing networks with mixed cast traffic flows"):
  with members:
    - "multi commodity flow with in network processing"
    - "optimal dynamic cloud network control"
    - "streaming big data meets backpressure in distributed network computation"

Connected through hyperedge HE-3 (induced by source paper "service chain sc mapping with multiple sc instances in a wide area network"):
  with members:
    - "multiple service chain placement and routing in a network enabled cloud"
    - "specifying and placing chains of virtual network functions"

Connected through hyperedge HE-4 (induced by source paper "distributed vnf scaling in large scale datacenters an admm based approach"):
  with members:
    - "online vnf scaling in datacenters"

Connected through hyperedge HE-5 (induced by source paper "online vnf scaling in datacenters"):
  with members:
    - "specifying and placing chains of virtual network functions"
    - "polynomiality for bin packing with a constant number of item types"

Connected through hyperedge HE-6 (induced by source paper "online scaling of nfv service chains across geo distributed datacenters"):
  with members:
    - "online vnf scaling in datacenters"
    - "specifying and placing chains of virtual network functions"

Connected through hyperedge HE-7 (induced by source paper "online admission control and embedding of service chains"):
  with members:
    - "specifying and placing chains of virtual network functions"
    - "merlin a language for provisioning network resources"
    - "a nonmonotone analysis with the primal dual approach online routing of virtual circuits with unknown durations"
    - "competitive and deterministic embeddings of virtual networks"

Question: Please tell me which class the center node 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)