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: "congestion avoidance in computer networks with a connectionless network layer"
  Abstract: Widespread use of computer networks and the use of varied technology for the interconnection of computers has made congestion a significant problem. #R##N#In this report, we summarize our research on congestion avoidance. We compare the concept of congestion avoidance with that of congestion control. #R##N#Briefly, congestion control is a recovery mechanism, while congestion avoidance is a prevention mechanism. A congestion control scheme helps the network to recover from the congestion state while a congestion avoidance scheme allows a network to operate in the region of low delay and high throughput with minimal queuing, thereby preventing it from entering the congested state in which packets are lost due to buffer shortage. #R##N#A number of possible alternatives for congestion avoidance were identified. #R##N#From these alternatives we selected one called the binary feedback scheme in which the network uses a single bit in the network layer header to feed back the congestion information to its users, which then increase or decrease their load to make optimal use of the resources. The concept of global optimality in a distributed system is defined in terms of efficiency and fairness such that they can be independently quantified and apply to any number of resources and users. #R##N#The proposed scheme has been simulated and shown to be globally efficient, fair, responsive, convergent, robust, distributed, and configuration-independent.

Connected through hyperedge HE-1 (induced by source paper "the coco beholder enabling comprehensive evaluation of congestion control algorithms"):
  with members:
    - "fifty shades of congestion control a performance and interactions evaluation"
    - "an evaluation of bbr and its variants"
    - "fairness of congestion based congestion control experimental evaluation and analysis"
    - "pcc re architecting congestion control for consistent high performance"

Connected through hyperedge HE-2 (induced by source paper "congestion control and traffic management in atm networks recent advances and a survey"):
  with members:
    - "myths about congestion management in high speed networks"
    - "congestion control with explicit rate indication"
    - "a delay based approach for congestion avoidance in interconnected heterogeneous computer networks"
    - "congestion control in computer networks issues and trends"

Connected through hyperedge HE-3 (induced by source paper "the osu scheme for congestion avoidance in atm networks lessons learnt and extensions"):
  with members:
    - "congestion control and traffic management in atm networks recent advances and a survey"
    - "the osu scheme for congestion avoidance in atm networks using explicit rate indication"
    - "congestion control with explicit rate indication"

Connected through hyperedge HE-4 (induced by source paper "a delay based approach for congestion avoidance in interconnected heterogeneous computer networks"):
  with members:
    - "a timeout based congestion control scheme for window flow controlled networks"

Connected through hyperedge HE-5 (induced by source paper "congestion control in computer networks issues and trends"):
  with members:
    - "a delay based approach for congestion avoidance in interconnected heterogeneous computer networks"
    - "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)