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: "application components migration in nfv based hybrid cloud fog systems"
  Abstract: Fog computing extends the cloud to the edge of the network, close to the end-users enabling the deployment of some application component in the fog while others in the cloud. Network Functions Virtualization (NFV) decouples the network functions from the underlying hardware. In NFV settings, application components can be implemented as sets of Virtual Network Functions (VNFs) chained in specific order representing VNF-Forwarding Graphs (VNF-FG). Many studies have been carried out to map the VNF-FGs to cloud systems. However, in hybrid cloud/fog systems, an additional challenge arises. The mobility of fog nodes may cause high latency as the distance between the end-users and the nodes hosting the components increases. This may not be tolerable for some applications. In such cases, a prominent solution is to migrate application components to a closer fog node. This paper focuses on application component migration in NFV-based hybrid cloud/fog systems. The objective is to minimize the aggregated makespan of the applications. The problem is modeled mathematically, and a heuristic is proposed to find the sub-optimal solution in an acceptable time. The heuristic aims at finding the optimal fog node in each time-slot considering a pre-knowledge of the mobility models of the fog nodes. The experiment's results show that our proposed solution improves the makespan and the number of migrations compared to random migration and No-migration.

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)