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: "on the linear behaviour of the throughput of ieee 802 11 dcf in non saturated conditions"
  Abstract: We propose a linear model of the throughput of the IEEE 802.11 distributed coordination function (DCF) protocol at the data link layer in non-saturated traffic conditions. We show that the throughput is a linear function of the packet arrival rate (PAR) lambda with a slope depending on both the number of contending stations and the average payload length. We also derive the interval of validity of the proposed model by showing the presence of a critical lambda, above which the station begins operating in saturated traffic conditions. The analysis is based on the multi-dimensional Markovian state transition model proposed by Liaw et al. with the aim of describing the behaviour of the MAC layer in unsaturated traffic conditions. Simulation results closely match the theoretical derivations, confirming the effectiveness of the proposed linear model.

Connected through hyperedge HE-1 (induced by source paper "on the throughput allocation for proportional fairness in multirate ieee 802 11 dcf"):
  with members:
    - "modelling and analysis of the distributed coordination function of ieee 802 11 with multirate capability"
    - "saturation throughput analysis of ieee 802 11 in the presence of non ideal transmission channel and capture effects"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-2 (induced by source paper "a novel proportional fairness criterion for throughput allocation in multirate ieee 802 11"):
  with members:
    - "modelling and analysis of the distributed coordination function of ieee 802 11 with multirate capability"
    - "saturation throughput analysis of ieee 802 11 in the presence of non ideal transmission channel and capture effects"
    - "a model of the ieee 802 11 dcf in presence of non ideal transmission channel and capture effects"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-3 (induced by source paper "modelling and analysis of the distributed coordination function of ieee 802 11 with multirate capability"):
  with members:
    - "saturation throughput analysis of ieee 802 11 in the presence of non ideal transmission channel and capture effects"
    - "a model of the ieee 802 11 dcf in presence of non ideal transmission channel and capture effects"

Connected through hyperedge HE-4 (induced by source paper "on the optimization of the ieee 802 11 dcf a cross layer perspective"):
  with members:
    - "saturation throughput analysis of ieee 802 11 in the presence of non ideal transmission channel and capture effects"
    - "a model of the ieee 802 11 dcf in presence of non ideal transmission channel and capture effects"

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)