IP Library Granted Patent US 6,914,936
Granted Patent B1
US 6,914,936 · App. 09/909,490 · Granted Jul 5, 2005

Method for allocating media unit sequences among a plurality of output channels

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 6,914,936
App. No.
09/909,490
Granted
Jul 5, 2005
Kind
B1
Abstract

A method for allocating media unit sequences, such as MPEG compliant programs, among a plurality of output channels, especially in an allocation unit environment. The method including the steps of: (I) Generating previous media unit sequence behavior pattern information. (II) Estimating at least one aspect of a predicted overflow in at least two output channels, in response to (a) at least a portion of the previous media unit sequence behavior pattern information, and (b) at least two potential allocations of media unit sequences, and (III) Selecting a selected allocation out of the at least two potential allocations in response to the at least one aspect of the predicted overflow. Conveniently, the selected allocation is the best allocation in respect of the at least one aspect.

Claims (399)

1. A method for allocating media unit sequences among a plurality of output channels, the method comprising the steps of:

generating previous media unit sequence behavior pattern information reflecting at least one behavior pattern of at least one media unit sequence during at least one previous time period;

estimating at least one aspect of a predicted overflow in at least two output channels from the plurality of output channels, in response to (a) at least a portion of the previous media unit sequence behavior pattern information, and (b) at least two potential allocations of media unit sequences among the plurality of output channels; and

selecting a selected allocation out of the at least two potential allocations in response to the at least one aspect of the predicted overflow.

2. The method of claim 1 wherein the step of selecting comprising selecting a selected allocation that that optimizes the at least one aspect of the predicted overflow.

3. The method of claim 1 wherein the previous media unit sequence behavior pattern information reflects a size of at least one media unit sequence during at least one previous time period.

4. The method of claim 1 wherein the previous media unit sequence behavior pattern information reflects changes in the size of at least one media unit sequence during at least, one previous time period.

5. The method of claim 1 wherein the previous media unit sequence behavior pattern information reflects an average size of at least one media unit sequence during at least one previous time period.

6. The method of claim 1 wherein the previous media unit sequence behavior pattern information reflects a maximal size of at least one media unit sequence during at least one previous time period.

7. The method of claim 1 wherein the previous media unit sequence behavior pattern information reflects both a temporal size of at least one media unit sequence during at least one previous time period and a duration of time during which the at least one media unit was characterized by the temporal size.

8. The method of claim 1 wherein the previous media unit sequence behavior pattern information reflects a relevant maximum of at least one media unit sequence during at least one previous time period.

9. The method of claim 1 wherein the previous media unit sequence behavior pattern information reflects a size variance of at least one media unit sequence during at least one previous time period.

10. The method of claim 1 wherein the previous media unit sequence behavior pattern information reflects quality patterns of the media unit sequence during at least one previous time period.

11. The method of claim 1 wherein the step of estimating comprising a step of comparing an output channel estimated capacity and an aggregate estimated output channel required capacity, for each output channel out of the at least two output channels.

12. The method of claim 1 wherein an aspect of a predicted overflow is a peak value of the predicted overflow.

13. The method of claim 1 wherein an aspect of a predicted overflow is a flatness of the predicted overflow.

14. The method of claim 1 wherein an aspect of a predicted overflow is a mean value of the predicted overflow.

15. The method of claim 1 wherein an aspect of a predicted overflow is a variance of the predicted overflow.

16. The method of claim 1 wherein an aspect of a predicted overflow is at least one moment of the predicted overflow.

17. The method of claim 1 wherein an aspect of a predicted overflow is at least

one moment of the mean value of the predicted overflow.

18. The method of claim 17 wherein

NOF

l

=

(

T

l

-

C

l

)

+

C

l

.

19. The method of claim 17 wherein

NOF

l

=

(

T

l

-

C

l

)

+

T

l

.

20. The method of claim 17 wherein

NOF

l

=

(

T

l

-

C

l

)

+

C

l

-

A

l

,

whereas A l represents a constant non-compressible component of {right arrow over (T)} l .

21. The method of claim 17 wherein

NOF

l

=

(

T

l

-

C

l

)

+

T

l

-

A

l

,

whereas A l represents a constant non-compressible component of {right arrow over (T)} l .

22. The method of claim 17 wherein

NOF

l

=

(

T

l

-

C

l

)

+

1

.

23. The method of claim 22 wherein

NOF

l

=

(

T

i

-

C

i

)

+

C

i

.

24. The method of claim 22 wherein

NOF

l

=

(

T

i

-

C

i

)

+

T

i

.

25. The method of claim 22 wherein

NOF

l

=

(

T

i

-

C

i

)

+

C

i

-

A

i

,

whereas A l represents a constant non-compressible component of {right arrow over (T)} l .

26. The method of claim 22 wherein

NOF

l

=

(

T

i

-

C

i

)

+

T

i

-

A

i

,

whereas A l represents a constant non-compressible component of {right arrow over (T)} l .

27. The method of claim 22 wherein

NOF

l

=

(

T

i

-

C

i

)

+

1

.

28. The method of claim 1 wherein an aspect of the predicted overflow in an l′th output channel is reflected by {right arrow over (NOF)} l .

29. The method of claim 1 wherein an aspect of the predicted overflow in an l′th output channel is reflected by {right arrow over (NOF)} l ·{right arrow over (W)}, whereas {right arrow over (W)} including weight factors, each weight factor representative of a previous time period.

30. The method of claim 29 wherein

NOF

l

=

(

T

i

-

C

i

)

+

C

i

.

31. The method of claim 29 wherein

NOF

l

=

(

T

i

-

C

i

)

+

T

i

.

32. The method of claim 29 wherein

NOF

l

=

(

T

i

-

C

i

)

+

C

i

-

A

i

,

whereas A l represents a constant non-compressible component of {right arrow over (T)} l .

33. The method of claim 29 wherein

NOF

l

=

(

T

i

-

C

i

)

+

T

i

-

A

i

,

whereas A l represents a constant non-compressible component of {right arrow over (T)} l .

34. The method of claim 33 wherein the output channel limitations comprise a maximal amount of media unit sequences that can be simultaneously transmitted over the output channel.

35. The method of claim 29 wherein

NOF

l

=

(

T

i

-

C

i

)

+

1

.

36. The method of claim 1 wherein an aspect of the predicted overflow in an l′th output channel reflects {right arrow over (NOF)} l and {right arrow over (P)} whereas {right arrow over (P)} is representative of a combination of priorities of media unit sequences allocated to an l′th output channel.

37. The method of claim 36 wherein the target function is max l≦l≦k ∥{right arrow over (NOF)} l ∥ s , whereas s≧1.

38. The method of claim 36 wherein the target function is max l≦l≦k ∥{right arrow over (NOF)} l ∥ s , whereas s=∞.

39. The method of claim 36 wherein the target function is

l

=

1

k

NOF

l

s

,

whereas s≧1.

40. The method of claim 36 wherein the target function is

l

=

1

k

NOF

l

s

,

whereas s=∞.

41. The method of claim 36 wherein the target function is max l≦l≦k ∥{right arrow over (NOF)} l ∥ s,w whereas s≧1 and w>0.

42. The method of claim 36 wherein the target function is max l≦l≦k ∥{right arrow over (NOF)} l ∥ s,w whereas s=∞ and w>0.

43. The method of claim 36 wherein the target function is

l

=

1

k

NOF

l

s

,

w

whereas s≧1 and w>0.

44. The method of claim 36 wherein the target function is

l

=

1

k

NOF

l

s

,

w

whereas s=∞ and w>0.

45. The method of claim 44 further comprising a step of multiplexing media unit sequences being allocated to the same output channel to provide an output channel multiplexed sequence.

46. The method of claim 45 wherein the step of compressing comprising a step of selecting at least one media unit sequence to be compressed in response to compression priority associated with each media unit sequence.

47. The method of claim 1 wherein the step of estimating comprising the step of calculating a target function, for each potential allocation.

48. The method of claim 1 further comprising a step of allocating the media unit sequences in response to the selected allocation.

49. The method of claim 48 further comprising a step of compressing at least one media unit sequence allocated to an output channel if the aggregate size of media unit sequences allocated to the output channel exceeds the output channel capacity.

50. The method of claim 49 wherein the step of compressing comprising a step of selecting at least one media unit sequence to be compressed in response to previous media unit sequence behavior pattern information.

51. The method of claim 50 wherein the allocation constraint reflect a relationship between a media unit sequence and at least one output channel.

52. The method of claim 50 wherein the allocation constraint reflect a relationship between at least two media unit sequence.

53. The method of claim 50 wherein the allocation constraint reflects output channel limitations.

54. The method of claim 1 wherein the potential allocation of media unit sequences respond to at least one allocation constraint.

55. The method of claim 1 wherein the at least one previous time period are selected from a group of a plurality of consecutive time periods.

56. The method of claim 1 wherein the length of a previous time period ranges between a second to a minute.

57. The method of claim 1 wherein the length of a previous time period ranges between a minute to an hour.

58. The method of claim 1 wherein the length of a previous time period ranges between an hour and a day.

59. The method of claim 1 wherein a media unit sequence is a program.

60. The method of claim 1 wherein the media unit sequences are MPEG compliant.

61. The method of claim 60 wherein the previous media unit sequence behavior pattern information during the previous time period is utilized to estimate a predicted overflow during a current time period.

62. The method of claim 60 wherein the previous media unit sequence behavior pattern information during the previous time period is utilized to estimate a predicted overflow during a future time period.

63. The method of claim 1 wherein the step of estimating comprising the steps of:

estimating, for each time period out of a plurality of previous time periods, at least one aspect of a predicted overflow in at least two output channels in response to the previous media unit sequence behavior pattern information during the previous time period and in response to at least two potential allocations of media unit sequences;

selecting a selected allocation out of the at least two potential allocations that optimizes the at least one aspect of the predicted overflow.

64. The method of claim 63 wherein the previous time period is spaced by at least one cycle period from the current time period.

Assignments (10)
RELEASE OF SECURITY INTEREST AT REEL/FRAME 049905/0504 Recorded Dec 19, 2024
From: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
To: ARRIS ENTERPRISES LLC (F/K/A ARRIS ENTERPRISES, INC.); ARRIS TECHNOLOGY, INC.; ARRIS SOLUTIONS, INC.; COMMSCOPE, INC. OF NORTH CAROLINA; COMMSCOPE TECHNOLOGIES LLC; RUCKUS WIRELESS, LLC (F/K/A RUCKUS WIRELESS, INC.)
Reel/Frame 071477/0255 →
SECURITY INTEREST Recorded Nov 19, 2021
From: ARRIS SOLUTIONS, INC.; ARRIS ENTERPRISES LLC; COMMSCOPE TECHNOLOGIES LLC; COMMSCOPE, INC. OF NORTH CAROLINA; RUCKUS WIRELESS, INC.
To: WILMINGTON TRUST
Reel/Frame 060752/0001 →
TERM LOAN SECURITY AGREEMENT Recorded Jul 3, 2019
From: COMMSCOPE, INC. OF NORTH CAROLINA; COMMSCOPE TECHNOLOGIES LLC; ARRIS ENTERPRISES LLC; ARRIS TECHNOLOGY, INC.; RUCKUS WIRELESS, INC.; ARRIS SOLUTIONS, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 049905/0504 →
PATENT SECURITY AGREEMENT Recorded Jul 3, 2019
From: ARRIS ENTERPRISES LLC
To: WILMINGTON TRUST, NATIONAL ASSOCIATION, AS COLLATERAL AGENT
Reel/Frame 049820/0495 →
ABL SECURITY AGREEMENT Recorded Jul 3, 2019
From: COMMSCOPE, INC. OF NORTH CAROLINA; COMMSCOPE TECHNOLOGIES LLC; ARRIS ENTERPRISES LLC; ARRIS TECHNOLOGY, INC.; RUCKUS WIRELESS, INC.; ARRIS SOLUTIONS, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 049892/0396 →
TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS Recorded Apr 8, 2019
From: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AGENT
To: ARRIS GROUP, INC.; ARRIS ENTERPRISES, INC.; ARRIS SOLUTIONS, INC.; ARRIS KOREA, INC.; ARRIS HOLDINGS CORP. OF ILLINOIS, INC.; BIG BAND NETWORKS, INC.; TEXSCAN CORPORATION; POWER GUARD, INC.; 4HOME, INC.; ACADIA AIC, INC.; AEROCAST, INC.; BROADBUS TECHNOLOGIES, INC.; GENERAL INSTRUMENT CORPORATION; GENERAL INSTRUMENT AUTHORIZATION SERVICES, INC.; GENERAL INSTRUMENT INTERNATIONAL HOLDINGS, INC.; IMEDIA CORPORATION; JERROLD DC RADIO, INC.; LEAPSTONE SYSTEMS, INC.; MODULUS VIDEO, INC.; MOTOROLA WIRELINE NETWORKS, INC.; NETOPIA, INC.; NEXTLEVEL SYSTEMS (PUERTO RICO), INC.; QUANTUM BRIDGE COMMUNICATIONS, INC.; SETJAM, INC.; SUNUP DESIGN SYSTEMS, INC.; UCENTRIC SYSTEMS, INC.; GIC INTERNATIONAL HOLDCO LLC; GIC INTERNATIONAL CAPITAL LLC; CCE SOFTWARE LLC; THE GI REALTY TRUST 1996
Reel/Frame 048825/0294 →
CHANGE OF NAME Recorded Mar 14, 2017
From: ARRIS ENTERPRISES INC
To: ARRIS ENTERPRISES LLC
Reel/Frame 041995/0031 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 14, 2015
From: ARRIS SOLUTIONS, INC.
To: ARRIS ENTERPRISES, INC.
Reel/Frame 036601/0162 →
SECURITY AGREEMENT Recorded May 28, 2013
From: ARRIS GROUP, INC.; ARRIS ENTERPRISES, INC.; ARRIS SOLUTIONS, INC.; ARRIS KOREA, INC.; ARRIS HOLDINGS CORP. OF ILLINOIS; BIGBAND NETWORKS, INC.; TEXSCAN CORPORATION; POWER GUARD, INC.; 4HOME, INC.; ACADIA AIC, INC.; AEROCAST, INC.; BROADBUS TECHNOLOGIES, INC.; GENERAL INSTRUMENT CORPORATION; GENERAL INSTRUMENT AUTHORIZATION SERVICES, INC.; GENERAL INSTRUMENT INTERNATIONAL HOLDINGS, INC.; IMEDIA CORPORATION; JERROLD DC RADIO, INC.; LEAPSTONE SYSTEMS, INC.; MODULUS VIDEO, INC.; MOTOROLA WIRELINE NETWORKS, INC.; NETOPIA, INC.; NEXTLEVEL SYSTEMS (PUERTO RICO), INC.; QUANTUM BRIDGE COMMUNICATIONS, INC.; SETJAM, INC.; SUNUP DESIGN SYSTEMS, INC.; UCENTRIC SYSTEMS, INC.; GIC INTERNATIONAL HOLDCO LLC; GIC INTERNATIONAL CAPITAL LLC; CCE SOFTWARE LLC; THE GI REALTY TRUST 1996
To: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 030498/0023 →
CORRECTIVE ASSIGNMENT TO CORRET THE ASSIGNEE PREVIOUSLY RECORDED ON REEL 027422 FRAME 0633. ASSIGNOR(S) HEREBY CONFIRMS THE MERGER. Recorded Mar 7, 2012
From: BIGBAND NETWORKS, INC.
To: ARRIS SOLUTIONS, INC.
Reel/Frame 028226/0273 →