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: "design and analysis of queue control functions for explicit rate switch schemes"
  Abstract: The main goals of a switch scheme are high utilization, low queuing delay and fairness. To achieve high utilization the switch scheme can maintain non-zero (small) queues in steady state which can be used if the sources do not have data to send. Queue length (delay) can be controlled if part of the link capacity is used for draining queues in the event of queue build up. In most schemes a simple threshold function is used for queue control. Better control of the queue and hence delay can be achieved by using sophisticated queue control functions. It is very important to design and analyze such queue control functions. We study step, linear, hyperbolic and inverse hyperbolic queue control functions. Analytical explanation and simulation results consistent with analysis are presented. From the study, we conclude that inverse hyperbolic is the best control function and to reduce complexity the linear control function can be used since it performs satisfactorily in most cases.

Connected through hyperedge HE-1 (induced by source paper "the erica switch algorithm for abr traffic management in atm networks"):
  with members:
    - "congestion avoidance in computer networks with a connectionless network layer part i concepts goals and methodology"
    - "congestion control and traffic management in atm networks recent advances and a survey"
    - "feedback consolidation algorithms for abr point to multipoint connections in atm networks"
    - "tcp selective acknowledgments and ubr drop policies to improve atm ubr performance over terrestrial and satellite networks"
    - "the osu scheme for congestion avoidance in atm networks lessons learnt and extensions"
    - "congestion control with explicit rate indication"
    - "performance of tcp over abr on atm backbone and with various vbr traffic patterns"
    - "source behavior for atm abr traffic management an explanation"

Connected through hyperedge HE-2 (induced by source paper "overload based explicit rate switch schemes with mcr guarantees"):
  with members:
    - "the erica switch algorithm for abr traffic management in atm networks"
    - "a definition of general weighted fairness and its support in explicit rate switch algorithms"
    - "on determining the fair bandwidth share for abr connections in atm networks"

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)