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 "cemon a cost effective flow monitoring system in software defined networks"):
  Abstract: Abstract   Network monitoring and measurement are crucial in network management to facilitate quality of service routing and performance evaluation. Software Defined Networking (SDN) makes network management easier by separating the control plane and data plane. Network monitoring in SDN is relatively light-weight since operators only need to install a monitoring module into the controller. Active monitoring techniques usually introduce extra overhead into the network. The state-of-the-art approaches utilize sampling, aggregation and passive measurement techniques to reduce measurement overhead. However, little work has focused on reducing the communication cost of network monitoring. Moreover, most of the existing approaches select polling switch nodes by sub-optimal local heuristics.  Inspired by the visibility and central control of SDN, we propose CeMon, a generic low-cost high-accuracy monitoring system that supports various network management tasks. We first propose a Maximum Coverage Polling Scheme (MCPS) to optimize the polling cost for all active flows. The problem is formulated as a weighted set cover problem which is proved to be NP-hard. Heuristics are presented to obtain the polling scheme efficiently and handle traffic dynamics practically. In order to balance the cost and flexibility, an Adaptive Fine-grained Polling Scheme (AFPS) is proposed as a complementary method to implement flow level measurement tasks. Three sampling algorithms are further proposed to eliminate measurement overhead while maintain high accuracy. Both emulation and simulation results show that MCPS reduces more than 50% of the communication cost with negligible loss of accuracy for different topologies and traffics. We also use real traces to demonstrate that AFPS reduces the cost by up to 20% with only 1.5% loss in accuracy.

Includes members:
  Member "flowcover low cost flow monitoring scheme in software defined networks":
    also connected through other hyperedges:
      (none)
  Member "distributed and collaborative traffic monitoring in software defined networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "detecting heavy flows in the sdn match and action model")

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)