human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "an online delay efficient multi class packet scheduler for heterogeneous m2m uplink traffic"
  Abstract: The Machine-to-Machine (M2M) traffic exhibit heterogeneity in several dimensions such as packet arrival rate, delay tolerance requirements etc. Therefore, motivated by this, we study the delay-performance of a heterogeneous M2M uplink channel from the sensors to the Programmable Logic Controller (PLC) in an industrial automation scenario. Besides the heterogeneity across the sensors, the data from each sensor is also heterogeneous and can be classified as either Event Driven (ED) or Periodic Update (PU) data. While the ED arrivals are random and do not have hard service deadlines, the periodic PU data needs to be processed before a predetermined deadline. We map these contrasting delay requirements of PU and ED packets using step and sigmoidal functions of service delay respectively. The aggregated traffic at PLC forms multiple queues/classes based on the delay requirements, which are then served so as to maximize a proportionally-fair system utility. Specifically the proposed multi-class scheduler gives priority to ED data from different sensors as long as the deadline is met for the PU data. We minimize successive PU failures using a novel exponential penalty function and clear the failed PU packets so as to reduce network congestion. Using extensive simulations, we compare the performance of our scheme with various state-of-the art packet schedulers and show that it outperforms other schedulers when network congestion increases. We show that this performance gap increases with heterogeneity in delay requirements and increasing penalization for successive PU failures.

Connected through hyperedge HE-1 (induced by source paper "position estimation of robotic mobile nodes in wireless testbed using geni"):
  with members:
    - "an online delay efficient packet scheduler for m2m traffic in industrial automation"
    - "a qos based power allocation for cellular users with different modulations"
    - "optimal downlink power allocation in cellular networks"
    - "a price selective centralized algorithm for resource allocation with carrier aggregation in lte cellular networks"
    - "an efficient multi carrier resource allocation with user discrimination framework for 5g wireless systems"
    - "application aware resource block and power allocation for lte"
    - "an optimal application aware resource block scheduling in lte"
    - "real time rate distortion optimized streaming of wireless video"

Connected through hyperedge HE-2 (induced by source paper "a delay optimal packet scheduler for m2m uplink"):
  with members:
    - "an online delay efficient packet scheduler for m2m traffic in industrial automation"
    - "fundamentals of throughput maximization with random arrivals for m2m communications"

Question: Please tell me which class the center node 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)