IP Library Granted Patent US 9,338,519
Granted Patent B2
US 9,338,519 · App. 13/716,295 · Granted May 10, 2016

Method for multicast video delivery for 4G cellular networks

Inventors: Honghai Zhang (Seattle, WA); Jongwon Yoon (Princeton, NJ); Sampath Rangarajan (Bridgewater, NJ)
Assignee: NEC Corporation
H04N21/6405H04N21/2383H04N21/2408H04N21/6131H04N21/2662H04W72/04
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,338,519
App. No.
13/716,295
Granted
May 10, 2016
Kind
B2
Abstract

A method for video multicast delivery for 4g wireless networks includes collecting client feedback and obtaining supportable modulation and coding scheme MCS for each client over a base station of wireless network, prioritizing video packets for said clients and setting a utility for each of the video packets; performing a radio resource allocation for determining a utility optimization for transmitted frames of the video packets; and assigning an MCS to each transmitted frame of the video packets, responsive to step performing a radio resource allocation.

Claims (243)

1. A method for video multicast delivery for 4 g wireless networks comprising:

collecting client feedback and obtaining supportable modulation and coding scheme MCS for each client from a base station of the wireless network;

prioritizing video packets for said clients and setting a utility value for each frame of said video packets;

performing a radio resource allocation for the frames of the video packets to determine a utility value optimization for transmitted frames of said video packets; and

assigning an MCS to each said transmitted frame of said video packets, responsive to said performed radio resource allocation.

2. The method of claim 1 , wherein said performing said radio resource allocation further comprises determining utilization maximization for I/P frame scheduling.

3. The method of claim 2 , wherein said performing said radio resource allocation further comprises determining utilization maximization for B frame scheduling.

4. The method of claim 3 , wherein said performing said radio resource allocation further comprises performing joint scheduling for optimal resource allocation between I/P and B frames, with

U

*

=

max

t

U

P

*

(

t

)

+

U

B

*

(

T

-

t

)

,

t

*

=

arg

max

t

U

P

*

(

t

)

+

U

B

*

(

T

-

t

)

being optimal total utility and optimal total number of slots allocated to I/P frames, respectively, and T-t* being an optimal number of slots allocated to B frames.

5. The method of claim 2 , wherein said I/P frame scheduling comprises:

(a) a recursive equation utilization maximization U P (j,m,t) defined by

U

P

(

j

,

m

,

t

)

=

max

0

i

j

[

U

P

(

i

,

m

-

1

,

t

-

τ

i

+

1

,

j

,

m

)

+

l

=

i

+

1

j

k

S

m

u

l

k

]

;

(

2

)

(b) initial conditions for utilization maximization U P (j,m,t)

U P ( j,m,t )=−∞, if t <0

U P ( j ,0 ,t )=−∞, if j ≧0 , t≧ 0

U P (−1 ,m,t )=0, if m≧ 0 , t≧ 0   (4)

(c) an optimal utility U* P for each available time slot t:

U

P

*

(

t

)

=

max

j

0

U

P

(

j

,

M

,

t

)

j

*

(

t

)

=

arg

max

j

0

U

P

(

j

,

M

,

t

)

m

*

(

t

)

=

min

{

m

:

U

P

(

j

*

(

t

)

,

m

,

t

)

==

U

P

*

(

t

)

}

;

(

5

)

 and

(d) I/P frame scheduling comprising

1: Use Eq. (4) to compute the utility U P (j,m,t) at the boundary,

2: for all j, m, t do

3: Compute U P (j,m t) iteratively using Eq. (2),

4: end for

5: Find the optimal utility U* P for all 0≦t≦T using Eq. (5).

6. The method of claim 5 , wherein said B frame scheduling comprises

1: for all m*(t)≦m≦M do

2: Find the maximum b m such that the first B m frames in B(t) can be transmitted with MCS m in T−t slots,

3: The resulting utility is U B (m,T−t)=Σ b=1 b m Σ kεS m u b k ·

4: end for

5: Find the optimal m 0 =arg max m U B (m,T−t) and obtain the utility U* B (T −t)=U B (m 0 ,T−t).

7. The method of claim 6 , wherein said assigning an MCS comprises, with an I frame being viewed as a special P frame with index 0 for frames of said video packets to be transmitted:

1t* and T −t* (obtained from Eq. (6)) are the number of slots allocated to P frames and B frames, respectively,

2The first j*(t*) P frames (from Eq. (5)) are transmitted and the rest P frames are discarded.

3t =t*,j=j*(t*),m=m*(t*), i=q(j,m,t),

4P frames P l ,l=i+1, . . . j are transmitted with MCS m(if i==j, no frames are transmitted with MCS m),

5If i<0, go to Step 6 . Otherwise, t=t−T i+1,j,m j=i,m=m−1,i=q(j,m,t), go to step 4 ,

6m 0 =arg max m (m, T−t*). The first b m 0 B frames are transmitted with MCS m 0 and the rest B frames are dropped.

8. The method of claim 7 , wherein once said MCS for each video frame is determined, video packets belonging each frame are marked with an assigned MCS index in a field of an IP header.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 17, 2016
From: NEC LABORATORIES AMERICA, INC.
To: NEC CORPORATION
Reel/Frame 038011/0263 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 17, 2013
From: ZHANG, HONGHAI; YOON, JONGWON; RANGARAJAN, SAMPATH
To: NEC LABORATORIES AMERICA, INC.
Reel/Frame 030436/0161 →
Continuity (2)
Provisional Application 61576592 · Dec 16, 2011
Related Publication 20130155935A1 · Jun 20, 2013