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 excess bandwidth allocation in isp traffic control for shared access networks"
  Abstract: Current practice of shaping subscriber traffic based on token bucket by Internet service provider (ISP) allows short-term fluctuations in its shaped rate and thereby enables a subscriber to transmit traffic at a higher rate than a negotiated long-term average. The traffic shaping, however, results in significant waste of network resources, especially when there are only a few active subscribers, because it cannot allocate excess bandwidth to active subscribers in the long term. In this letter we investigate the long-term aspect of resource sharing in ISP traffic control for shared access networks. We discuss major requirements for the excess bandwidth allocation in shared access networks and propose ISP traffic control schemes based on core-stateless fair queueing (CSFQ) and token bucket meters. Simulation results demonstrate that the proposed schemes allocate excess bandwidth among active subscribers in a fair and efficient way, while not compromising the service contracts specified by token bucket for conformant subscribers.

Connected through hyperedge HE-1 (induced by source paper "toward fully shared access designing isp service plans leveraging excess bandwidth allocation"):
  with members:
    - "deficit round robin based isp traffic control scheme enabling excess bandwidth allocation in 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)