Bandwidth allocation for video-on-demand networks

Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S468000, C370S486000, C725S095000

Reexamination Certificate

active

07664020

ABSTRACT:
Methods for the optimal allocation of bandwidth among a plurality of video-on-demand (VOD) programs available on each link of a VOD tree network, where a server at the root node of the tree network broadcasts the multiple VOD programs. Each node in the network has demands for a subset of the programs and each link connecting nodes in the network has a limited amount of available bandwidth capacity. The available bandwidth is allocated on each link optimally among all programs that are carried on that link. The bandwidth allocated to a specific program may be different on different links of the network, as the bandwidth allocated may be decreased, but not increased, from one link to the next along the paths from the root node to the destination nodes. The methods use equitable resource allocation models with a lexicographic minimax objective function. The first method finds optimal solutions while satisfying the capacity constraints on all links, tree-like ordering constraints for the bandwidth allocated to each of the programs, and lower and upper bounds on bandwidth allocation for each program. The second method finds optimal solutions to a more restrictive scheme that imposes additional constraints which require equal bandwidth allocation for a specific program on all relevant links emanating from the same node.

REFERENCES:
patent: 6269080 (2001-07-01), Kumar
patent: 6446125 (2002-09-01), Huang et al.
patent: 6691312 (2004-02-01), Sen et al.
patent: 6986156 (2006-01-01), Rodriguez et al.
patent: 2004/0172654 (2004-09-01), Pei et al.
patent: 2004/0199613 (2004-10-01), Hundscheidt et al.
Author: Wlodzimierz Ogryczak, Title: On the lexicographic minimax approach to location problem, Date: May 1, 1996□□publisher: 1997.
L. M. Betts, J. R. Brown, and H. Luss, Minimax Resource Allocation for Problems with Ordering Constraints, Naval Research Logistics 41, 719-738, 1994.
K. A. Hua, M. A. Tantaoui, and W. Tavanapong, Video Delivery Technologies for Large-Scale Deployment of Multimedia Applications, Proceedings of the IEEE, 92, 1439-1451, Sep. 2004.
R. S. Klein, H. Luss, and D. R. Smith, A Lexicographic Minimax Algorithm for Multiperiod Resource Allocation, Mathematical Programming 55, 213-234, 1992.
B. Li and J. Liu, Multirate Video Multicast Over the Internet: An Overview, IEEE Network, Jan./Feb. 24-29, 2003.
H. Luss, On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach, Operations Research 47, 361-378, 1999.
S. Ramesh, I. Rhee, and K. Guo, Multicast with Cache (Mcache): An Adaptive Zero-Delay Video-on-DemandService, IEEE Transactions on Circuits and Systems for Video Technology, 11, 440-456, 2001.
Pham, Brenda; PCT Search Report dated Feb. 11, 2008; 6 pgs.
Pham, Brenda; Supplemental PCT Search Report dated Mar. 25, 2008; 4 pgs.
Fajardo, Juan Tous; Supplemental EP Search Report dated Apr. 15, 2009; 1 pg.
Sarkar, S. et al.; “Fair Bandwidth Allocation for Multicasting in Networks with Discrete Feasible Set”; IEEE Transactions on Computers, IEEE Service Center, Los Alamitos, CA, vol. 53, No. 7, Jul. 1, 2004; pp. 785-797, XP011116156.
Fajardo, Juan Tous; EP Examination Report; Jun. 23, 2009; 3 pgs.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Bandwidth allocation for video-on-demand networks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Bandwidth allocation for video-on-demand networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bandwidth allocation for video-on-demand networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4190089

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.