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: "on the trade off between spectrum efficiency with dedicated access and short end to end transmission delays with random access in dvb rcs2"
  Abstract: This paper analyses the performance of TCP over random and dedicated access methods in the context of DVB-RCS2. Random access methods introduce a lower connection delay compared to dedicated methods. We investigate the poten- tial to improve the performance of short flows in regards to transmission delay, over random access methods for DVB- RCS2 that is currently under development. Our simulation experiments show that the transmission of the first ten IP datagrams of each TCP flow can be 500 ms faster with ran- dom access than with dedicated access making the former of interest to carry Internet traffic. Such methods, however, are less efficient in regards to bandwidth usage than dedicated access mecanisms and less reliable in overloaded network conditions. Two aspects of channel usage optimization can be distinguished: reducing the duration of ressource utiliza- tion with random access methods, or increasing the spec- trum efficiency with dedicated access methods. This article argues that service providers may let low-cost users exploit the DVB-RCS2 to browse the web by introducing different services, which choice is based on the channel access method.

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)