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: "finishing flows quickly with preemptive scheduling"
  Abstract: Today's data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from optimal for satisfying latency requirements. #R##N#We propose Preemptive Distributed Quick (PDQ) flow scheduling, a protocol designed to complete flows quickly and meet flow deadlines. PDQ enables flow preemption to approximate a range of scheduling disciplines. For example, PDQ can emulate a shortest job first algorithm to give priority to the short flows by pausing the contending flows. PDQ borrows ideas from centralized scheduling disciplines and implements them in a fully distributed manner, making it scalable to today's data centers. Further, we develop a multipath version of PDQ to exploit path diversity. #R##N#Through extensive packet-level and flow-level simulation, we demonstrate that PDQ significantly outperforms TCP, RCP and D3 in data center environments. We further show that PDQ is stable, resilient to packet loss, and preserves nearly all its performance gains even given inaccurate flow information.

Connected through hyperedge HE-1 (induced by source paper "to schedule or not to schedule when no scheduling can beat the best known flow scheduling algorithm in datacenter networks"):
  with members:
    - "sharpedge an asynchronous and core agnostic solution to guarantee bounded delays"
    - "make tcp great again in cellular networks a deep reinforcement learning approach"
    - "toward optimal performance with network assisted tcp at mobile edge"
    - "hyline a simple and practical flow scheduling for commodity datacenters"
    - "cellular controlled delay tcp c2tcp"
    - "c2tcp a flexible cellular tcp to meet stringent delay requirements"

Connected through hyperedge HE-2 (induced by source paper "sharpedge an asynchronous and core agnostic solution to guarantee bounded delays"):
  with members:
    - "bounding queue delay in cellular networks to support ultra low latency applications"
    - "make tcp great again in cellular networks a deep reinforcement learning approach"
    - "toward optimal performance with network assisted tcp at mobile edge"
    - "hyline a simple and practical flow scheduling for commodity datacenters"
    - "cellular controlled delay tcp c2tcp"
    - "c2tcp a flexible cellular tcp to meet stringent delay requirements"

Connected through hyperedge HE-3 (induced by source paper "a survey of big data machine learning applications optimization in cloud data centers and networks"):
  with members:
    - "fog assisted caching employing solar renewable energy for delivering video on demand service"
    - "energy efficient and resilient infrastructure for fog computing health monitoring applications"
    - "virtual machines embedding for cloud pon awgr and server based data centres"
    - "a survey on geographically distributed big data processing using mapreduce"
    - "disaggregation for improved efficiency in fog computing era"
    - "experimental evaluation of server centric passive optical network based data centre architecture"
    - "energy efficient distributed processing in vehicular cloud architecture"
    - "energy efficient software matching in vehicular fog"

Connected through hyperedge HE-4 (induced by source paper "on efficient data transfers across geographically dispersed datacenters"):
  with members:
    - "quickcast fast and efficient inter datacenter transfers using forwarding tree cohorts"
    - "dccast efficient point to multipoint transfers across datacenters"
    - "ddccast meeting point to multipoint transfer deadlines across datacenters using alap scheduling policy"
    - "rcd rapid close to deadline scheduling for datacenter networks"
    - "multicast traffic engineering for software defined networks"
    - "jellyfish networking data centers randomly"
    - "an axiomatic theory of fairness in network resource allocation"

Connected through hyperedge HE-5 (induced by source paper "rdma performance isolation with justitia"):
  with members:
    - "datacenter rpcs can be general and fast"
    - "revisiting network support for rdma"
    - "tensorflow a system for large scale machine learning"

Connected through hyperedge HE-6 (induced by source paper "terra scalable cross layer gda optimizations"):
  with members:
    - "dccast efficient point to multipoint transfers across datacenters"
    - "shark sql and rich analytics at scale"
    - "blinkdb queries with bounded errors and bounded response times on very large data"

Connected through hyperedge HE-7 (induced by source paper "tiny buffer tcp for data center networks"):
  with members:
    - "homa a receiver driven low latency transport protocol using network priorities"
    - "pcc re architecting congestion control for consistent high performance"

Connected through hyperedge HE-8 (induced by source paper "managing recurrent virtual network updates in multi tenant datacenters a system perspective"):
  with members:
    - "jellyfish networking data centers randomly"

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)