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: "a system theoretic approach to bandwidth estimation"
  Abstract: It is shown that bandwidth estimation in packet networks can be viewed in terms of min-plus linear system theory. The available bandwidth of a link or complete path is expressed in terms of a {\em service curve}, which is a function that appears in the network calculus to express the service available to a traffic flow. The service curve is estimated based on measurements of a sequence of probing packets or passive measurements of a sample path of arrivals. It is shown that existing bandwidth estimation methods can be derived in the min-plus algebra of the network calculus, thus providing further mathematical justification for these methods. Principal difficulties of estimating available bandwidth from measurement of network probes are related to potential non-linearities of the underlying network. When networks are viewed as systems that operate either in a linear or in a non-linear regime, it is argued that probing schemes extract the most information at a point when the network crosses from a linear to a non-linear regime. Experiments on the Emulab testbed at the University of Utah evaluate the robustness of the system theoretic interpretation of networks in practice. Multi-node experiments evaluate how well the convolution operation of the min-plus algebra provides estimates for the available bandwidth of a path from estimates of individual links.

Connected through hyperedge HE-1 (induced by source paper "measurement based online available bandwidth estimation employing reinforcement learning"):
  with members:
    - "moongen a scriptable high speed packet generator"
    - "mr bart multi rate available bandwidth estimation in real time"

Connected through hyperedge HE-2 (induced by source paper "a non stationary service curve model for estimation of cellular sleep scheduling"):
  with members:
    - "a non stationary service curve model for performance analysis of transient phases"
    - "downlink performance of cellular systems with base station sleeping user association and scheduling"
    - "delay bounds in communication networks with heavy tailed and self similar traffic"
    - "an end to end probabilistic network calculus with moment generating functions"

Connected through hyperedge HE-3 (induced by source paper "a non stationary service curve model for performance analysis of transient phases"):
  with members:
    - "delay bounds in communication networks with heavy tailed and self similar traffic"
    - "an end to end probabilistic network calculus with moment generating functions"

Connected through hyperedge HE-4 (induced by source paper "a foundation for stochastic bandwidth estimation of networks with random service"):
  with members:
    - "stochastic service guarantee analysis based on time domain models"

Connected through hyperedge HE-5 (induced by source paper "large scale probabilistic available bandwidth estimation"):
  with members:
    - "efficient test selection in active diagnosis via entropy approximation"
    - "sufficient conditions for convergence of the sum product algorithm"

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)