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 "lightfdg an integrated approach to flow detection and grooming in optical wireless dcns"):
  Abstract: LightFDG is an integrated approach to flow detection (FD) and flow grooming (FG) in optical wireless data center networks (DCNs), which is interconnected via wavelength division multiplexing (WDM) based free-space optical (FSO) links. Since forwarding bandwidth-hungry elephant flows (EFs) and delay-sensitive mice flows (MFs) on the same path can cause severe performance degradation, the LightFDG optically grooms flows of each class into rack-to-rack (R2R) flows. Then, R2R-MF and R2R-EF flows are separately forwarded over lightpaths of separate MF and EF virtual topologies, respectively. Lightpaths are provisioned by jointly determining the capacity and route based on flows' arrival rate, size, and completion time request. To prevent EFs from congesting the MF lightpaths, high speed and accurate flow-detection mechanisms are also necessary for classifying EFs as soon as possible. Therefore, a fast-lightweight-and-accurate flow detection framework is developed by leveraging the transmission control protocol (TCP) behaviors. The proposed FD scheme has the flexibility of being implemented as in-network or centralized to classify flows of modifiable and unmodifiable hosts, respectively. Since the centralized scheme incurs considerable overhead, the processing and communication overhead is also mitigated by proposed techniques. Numerical results show that LightFDG outperforms traditional load balancers by about 3x for EFs and 10x for MFs. Along with the developed overhead mitigation methods, the centralized scheme is shown to provide up to 62x lower overhead with 100% accuracy and with about 224x higher detection speeds than the existing centralized solutions.

Includes members:
  Member "design and provision of traffic grooming for optical wireless data center networks":
    also connected through other hyperedges:
      (none)
  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 "heavy hitter detection entirely in the data plane":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constellation a high performance geo distributed middlebox framework")
  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)