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 delay based approach for congestion avoidance in interconnected heterogeneous computer networks"
  Abstract: In heterogeneous networks, achieving congestion avoidance is difficult because the congestion feedback from one subnetwork may have no meaning to source on other other subnetworks. We propose using changes in round-trip delay as an implicit feedback. Using a black-box model of the network, we derive an expression for the optimal window as a function of the gradient of the delay-window curve. #R##N#The problems of selfish optimum and social optimum are also addressed. It is shown that without a careful design, it is possible to get into a race condition during heavy congestion, where each user wants more resources than others, thereby leading to a diverging congestion #R##N#It is shown that congestion avoidance using round trip delay is a promising approach. The aproach has the advantage that there is absolutely no overhead for the network itself. It is exemplified by a simple scheme. The performance of the scheme is analyzed using a simulation model. The scheme is shown to be efficient, fair, convergent and adaptive to changes in network configuration. #R##N#The scheme as described works only for networks that can ne modelled with queueing servers with constant service times. Further research is required to extend it for implementation in practical networks. Several directions for future research have beensuggested.

Connected through hyperedge HE-1 (induced by source paper "improved utility based congestion control for delay constrained communication"):
  with members:
    - "the quest for ledbat fairness"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-2 (induced by source paper "improved utility based congestion control for delay constrained communication extended version"):
  with members:
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-3 (induced by source paper "common problems in delay based congestion control algorithms a gallery of solutions"):
  with members:
    - "the persistent congestion problem of fast tcp analysis and solutions"
    - "achieving fair network equilibria with delay based congestion control algorithms"

Connected through hyperedge HE-4 (induced by source paper "the persistent congestion problem of fast tcp analysis and solutions"):
  with members:
    - "achieving fair network equilibria with delay based congestion control algorithms"

Connected through hyperedge HE-5 (induced by source paper "congestion control and traffic management in atm networks recent advances and a survey"):
  with members:
    - "congestion avoidance in computer networks with a connectionless network layer"
    - "myths about congestion management in high speed networks"
    - "congestion control with explicit rate indication"
    - "congestion control in computer networks issues and trends"

Connected through hyperedge HE-6 (induced by source paper "congestion control in computer networks issues and trends"):
  with members:
    - "congestion avoidance in computer networks with a connectionless network layer"
    - "a timeout based congestion control scheme for window flow controlled 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)