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: "toward fully shared access designing isp service plans leveraging excess bandwidth allocation"
  Abstract: Shaping subscriber traffic based on token bucket filter (TBF) by Internet service providers (ISPs) results in waste of network resources in shared access when there are few active subscribers, because it cannot allocate excess bandwidth in the long term. New traffic control schemes have been recently proposed to allocate excess bandwidth among active subscribers proportional to their token generation rates. In this paper we report the current status of our research on designing flexible yet practical service plans exploiting excess bandwidth allocation enabled by the new traffic control schemes in shared access networks, which are attractive to both ISP and its subscribers in terms of revenue and quality of service (QoS) and serve as a stepping stone to fully-shared access in the future.

Connected through hyperedge HE-1 (induced by source paper "stacked vlan based modeling of hybrid isp traffic control schemes and service plans exploiting excess bandwidth in shared access networks"):
  with members:
    - "the effect of isp traffic shaping on user perceived performances in broadband access networks"

Connected through hyperedge HE-2 (induced by source paper "deficit round robin based isp traffic control scheme enabling excess bandwidth allocation in shared access networks"):
  with members:
    - "the effect of isp traffic shaping on user perceived performances in broadband 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)