“…In [7], the availability of the deadline for delay sensitive service is analyzed and scheduling target for delay sensitive service is to transmit packet before deadline, rather than as soon as possible. Thus, the delay sensitive service is divided into three parts according to schedule priority and the deadline: Absolute Priority Services (APS), Relative Priority Services (RPS) and Common Priority Services (CPS), as shown in Fig.2, where d j is the transmit deadline of the head-of-line (HOL) packet of delay sensitive service j. Firstly, parts of resources are allocated to APS until the HOL packet delay is out of [d j − J 1 , d j ], then, RPS and CPS are all treated as best-effort services, therefore, for the RPS,CPS and best-effort service, the optimization problem is formulated as follows:…”