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 "design and provision of traffic grooming for optical wireless data center networks"):
  Abstract: Traditional wired data center networks (DCNs) suffer from cabling complexity, lack flexibility, and are limited by the speed of digital switches. In this paper, we alternatively develop a top-down traffic grooming (TG) approach to the design and provisioning of mission-critical optical wireless DCNs. While switches are modeled as hybrid optoelectronic cross-connects, links are modeled as wavelength division multiplexing (WDM) capable free-space optic (FSO) channels. Using the standard TG terminology, we formulate the optimal mixed-integer TG problem considering the virtual topology, flow conversation, connection topology, non-bifurcation, and capacity constraints. Thereafter, we develop a fast yet efficient sub-optimal solution which grooms mice flows (MFs) and mission-critical flows (CFs) and forward on predetermined rack-to-rack (R2R) lightpaths. On the other hand, elephant flows (EFs) are forwarded over dedicated server-to-server (S2S) express lightpaths whose routes and capacity are dynamically determined based on the availability of wavelength and capacity. To prioritize the CFs, we consider low and high priority queues and analyze the delay characteristics such as waiting times, maximum hop counts, and blocking probability. As a result of grooming the sub-wavelength traffic and adjusting the wavelength capacities, numerical results show that the proposed solutions can achieve significant performance enhancement by utilizing the bandwidth more efficiently, completing the flows faster than delay sensitivity requirements, and avoiding the traffic congestion by treating EFs and MFs separately.

Includes members:
  Member "wireless data center networks advances challenges and opportunities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coded federated computing in wireless networks with straggling devices and imperfect csi")
  Member "heterogeneous cloud radio access networks a new perspective for enhancing spectral and energy efficiencies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint power allocation and load balancing optimization for energy efficient cell free massive mimo networks")
  Member "on the capacity of free space optical intensity channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "throughput maximization of mixed fso rf uav aided mobile relaying with a buffer")

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)