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 "technique report scheduling flows with multiple service frequency constraints"):
  Abstract: With the fast development of wireless technologies, wireless applications have invaded various areas in people's lives with a wide range of capabilities. Guaranteeing Quality-of-Service (QoS) is the key to the success of those applications. One of the QoS requirements, service frequency, is very important for tasks including multimedia transmission in the Internet of Things. A service frequency constraint denotes the length of time period during which a link can transmit at least once. Unfortunately, it has not been well addressed yet. Therefore, this paper proposes a new framework to schedule multi transmitting flows in wireless networks considering service frequency constraint for each link. In our model, the constraints for flows are heterogeneous due to the diversity of users' behaviors. We first introduce a new definition for network stability with service frequency constraints and demonstrate that the novel scheduling policy is throughput-optimal in one fundamental category of network models. After that, we discuss the performance of a wireless network with service frequency constraints from the views of capacity region and total queue length. Finally, a series of evaluations indicate the proposed scheduling policy can guarantee service frequency and achieve a good performance on the aspect of queue length of each flow.

Includes members:
  Member "scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the power of randomization for scheduling real time traffic in wireless networks")
  Member "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the power of randomization for scheduling real time traffic in wireless networks")
  Member "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the power of randomization for scheduling real time traffic in wireless networks")

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)