human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on determining the fair bandwidth share for abr connections in atm networks"):
  Abstract: The available bit rate (ABR) service is designed to fairly allocate the bandwidth unused by higher priority services. The network indicates to the ABR sources the rates at which they should transmit to minimize their cell loss. Switches must constantly measure the demand and available capacity, and divide the capacity fairly among the contending connections. In order to compute the fair and efficient allocation for each connection, a switch needs to determine the effective number of active connections. We propose a method for determining the number of active connections and the fair bandwidth share for each. We prove the efficiency and fairness of the proposed method analytically, and simulate it for a number of configurations.

Includes members:
  Member "the erica switch algorithm for abr traffic management in atm networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis and simulation of delay and buffer requirements of satellite atm networks for tcp ip traffic")
  Member "congestion control and traffic management in atm networks recent advances and a survey":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "abc a simple explicit congestion control protocol for wireless networks")
  Member "a definition of general weighted fairness and its support in explicit rate switch algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "overload based explicit rate switch schemes with mcr guarantees")
  Member "congestion control with explicit rate indication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi path alpha fair resource allocation at scale in distributed software defined networks")
  Member "abr flow control for multipoint connections":
    also connected through other hyperedges:
      (none)
  Member "source behavior for atm abr traffic management an explanation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the erica switch algorithm for abr traffic management in atm networks")

Question: Please tell me which class the source paper 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)