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: "simple destination swap strategies for adaptive intra and inter tenant vm migration"
  Abstract: This paper investigates the opportunities and limitations#R##N#of adaptive virtual machine (VM) migration to reduce#R##N#communication costs in a virtualized environment. We introduce#R##N#a new formal model for the problem of online VM migration#R##N#in two scenarios: (1) VMs can be migrated arbitrarily in the#R##N#substrate network; e.g., a private cloud provider may have#R##N#an incentive to reduce the overall communication cost in the#R##N#network. (2) VMs can only be migrated within a given tenant;#R##N#e.g., a user that was assigned a set of physical machines may#R##N#exchange the functionality of the VMs on these machines.#R##N#We propose a simple class of Destination-Swap algorithms#R##N#which are based on an aggressive collocation strategy (inspired#R##N#by splay datastructures) and which maintain a minimal and local#R##N#amount of per-node (amortized cost) information to decide where#R##N#to migrate a VM and how; thus, the algorithms react quickly to#R##N#changes in the load. The algorithms come in two main flavors,#R##N#an indirect and distributed variant which keeps existing VM#R##N#placements local, and a direct variant which keeps the number#R##N#of affected VMs small.#R##N#We show that naturally, inter-tenant optimizations yield a#R##N#larger potential for optimization, but generally also a tenant itself#R##N#can improve its embedding. Moreover, there exists an interesting#R##N#tradeoff between direct and indirect strategies: indirect variants#R##N#are preferable under skewed and sparse communication patterns#R##N#due to their locality properties.

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.DC(Distributed, Parallel, and Cluster Computing)