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 "resource allocation for loss tolerant video streaming in embms"):
  Abstract: Bandwidth hungry video content has become the dominant contributor to the data traffic world over. Cellular networks are constantly evolving to meet the growing traffic demands. Over the past few years, wireless multicast has been garnering a lot of attention as a means of efficient resource utilization. Multicast transmission lets spectral resources to be shared between users streaming the same content. Even though multicast transmission allows to serve multiple users on the same resources, in order to serve all these users successfully, the base station cannot transmit the content at a rate greater than that decodable by the user with the worst channel conditions. In this paper, we propose a way to overcome this bottleneck. Video streaming services can sustain a certain amount of packet loss without any significant degradation in the quality experienced by the users. We leverage this loss tolerant nature of video streaming applications to improve the performance of multicast video services in LTE and 5G. We convert the problem of resource allocation for loss tolerant multicasting into the problem of stabilizing a queueing system. We then propose two throughput optimal Maximum Weight (MW) policies that successfully stabilize the constructed queueing system. However, brute force implementation of MW policies is mostly NP-hard. To overcome this, we propose a maximum weight bipartite matching approach that results in a polynomial time implementation of the proposed policies. We also evaluate the performance of our policies via extensive simulations.

Includes members:
  Member "towards optimal grouping and resource allocation for multicast streaming in lte":
    also connected through other hyperedges:
      (none)
  Member "resource allocation frameworks for network coded layered multimedia multicast services":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scheduling for volte resource allocation optimization and low complexity algorithms")
  Member "throughput optimal scheduling design with regular service guarantees in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "benefits of coding on age of information in broadcast networks")
  Member "optimized network coded scalable video multicasting over embms networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "random linear network coding for 5g mobile video delivery")

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)