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 "a survey of energy efficiency in sdn software based methods and optimization models"):
  Abstract: Software Defined Networking (SDN) paradigm has the benefits of programmable network elements by separating the control and the forwarding planes, efficiency through optimized routing and flexibility in network management. As the energy costs contribute largely to the overall costs in networks, energy efficiency has become a significant design requirement for modern networking mechanisms. However, designing energy efficient solutions is non-trivial since they need to tackle the trade-off between energy efficiency and network performance. In this article, we address the energy efficiency capabilities that can be utilized in the emerging SDN. We provide a comprehensive and novel classification of software-based energy efficient solutions into subcategories of traffic aware, end system aware and rule placement. We propose general optimization models for each subcategory, and present the objective function, the parameters and constraints to be considered in each model. Detailed information on the characteristics of state-of-the-art methods, their advantages, drawbacks are provided. Hardware-based solutions used to enhance the efficiency of switches are also described. Furthermore, we discuss the open issues and future research directions in the area of energy efficiency in SDN.

Includes members:
  Member "dynamic environments for virtual machine placement considering elasticity and overbooking":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scalarization methods for many objective virtual machine placement of elastic infrastructures in overbooked cloud computing data centers under uncertainty")
  Member "network function virtualization state of the art and research challenges":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "software defined optical networks sdons a comprehensive survey":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey of big data machine learning applications optimization in cloud data centers and networks")
  Member "software defined networking a comprehensive survey":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")

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)