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 "mpls based reduction of flow table entries in sdn switches supporting multipath transmission"):
  Abstract: In the paper, a new mechanism for Software-Defined Networking (SDN) flow aggregation accompanied with multipath transmission is proposed. The aggregation results in a low number of flow entries in core switches. This type of scalability improvement of flow processing is obtained thanks to application of the procedure based on introduction of centrally managed MPLS label distribution performed by an SDN controller. Moreover, multipath transmission improves network resource utilization. #R##N#The proposed mechanism does not involve definition of new protocols. It neither needs application of legacy signalling protocols. Only simple modifications of the existing solutions, assured by flexibility of OpenFlow, are necessary. Additionally, the mechanism significantly reduces communication between the controller and switches, thus enabling a fine-grained flow-level control. Furthermore, the proposed solution can be incrementally deployed in legacy networks. The simulations show that a number of flow entries in core switches can be reduced as much as of 96%, while the overall network traffic is increased by about 32\%. Moreover, the number of OpenFlow messages is reduced by about 98%.

Includes members:
  Member "sdn flow entry management using reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "how many mice make an elephant modelling flow length and size distribution of internet traffic")
  Member "software defined networking a comprehensive survey":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")

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)