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: "deficit round robin based isp traffic control scheme enabling excess bandwidth allocation in shared access networks"
  Abstract: In shared access shaping subscriber traffic based on token bucket by ISPs wastes network resources when there are few active subscribers, because it cannot allocate excess bandwidth in the long term. To address it, traffic control schemes based on core-stateless fair queueing (CSFQ) and token bucket meters (TBMs) have been proposed, which can allocate excess bandwidth among active subscribers proportional to their token generation rates. Using FIFO queue for all packets, however, degrades the short-term performance of conformant traffic due to the presence of non-conformant packets already in the queue. Also, the rate estimation based on exponential averaging makes it difficult to react to rapid changes in traffic conditions. In this paper we propose a new traffic control scheme based on deficit round-robin (DRR) and TBMs to guarantee the quality of service of conformant packets in all time scales while allocating excess bandwidth among active subscribers proportional to their token generation rates, whose advantages over the CSFQ-based schemes are demonstrated through simulation results.

Connected through hyperedge HE-1 (induced by source paper "toward fully shared access designing isp service plans leveraging excess bandwidth allocation"):
  with members:
    - "on the excess bandwidth allocation in isp traffic control for shared access networks"
    - "cooperative isp traffic shaping schemes in broadband shared access 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)