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: "improved utility based congestion control for delay constrained communication extended version"
  Abstract: This paper proposes a novel congestion control algorithm for delay-constrained communication over best effort packet switched networks. Due to the presence of buffers in the internal network nodes, each congestion episode leads to buffer queueing and thus to an increasing delivery delay. It is therefore essential to properly control congestions in delay-sensitive applications. Delay-based congestion algorithms could offer a viable solution since they tend to minimize the queueing delay. Unfortunately they do not cohabit well with other types of congestion algorithms, such as loss-based algorithms, that are not regulated by delay constraints. Our target is to propose a congestion control algorithm able to both maintain a bounded queueing delay when the network conditions allows for it and to avoid starvation when competing against flows controlled by other types of policies. Our Delay-Constrained Congestion Control algorithm exactly achieves this double objective by using a non-linear mapping between the experienced delay and the penalty value used in rate update equation in the controller, and by combining delay and loss feedback information in a single term based on packet interarrival measurements. We provide a stability analysis of our new algorithm and show its performance in simulation results that are carried out in the NS3 framework. They show that our algorithm compares favorably to other congestion control algorithms that share similar objectives. In particular, the simulation results show good fairness properties of our controller in different scenarios, with relatively low self inflicted delay and good ability to work also in lossy environments.

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)