Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2011-06-07
2011-06-07
Phan, Tri H (Department: 2471)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S400000, C370S486000, C725S095000
Reexamination Certificate
active
07957397
ABSTRACT:
A method and apparatus is provided for determining bandwidth allocation that includes initiating a transmission of a plurality of at least portions of content from a root node of a tree topology network along a path having a plurality of links connecting nodes to at least one destination node, allocating bandwidth for the plurality of at least portions of content carried on a respective link with an available bandwidth capacity such that a sum of the allocated bandwidths of all of the plurality of at least portions of content carried on the respective link does not exceed the available bandwidth capacity, and using a Lexicographic Minimax Algorithm for a Flexible or Constrained Bandwidth Allocation Model to provide bandwidth allocations to the plurality of at least portions of content and to determine an ordered list from the plurality of links from a most critical link to a least critical link.
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: 7292542 (2007-11-01), Wright
patent: 7543074 (2009-06-01), O'Neal et al.
patent: 7646734 (2010-01-01), Wright
patent: 7664020 (2010-02-01), Luss
patent: 7801177 (2010-09-01), Luss
patent: 2004/0172654 (2004-09-01), Pei et al.
patent: 2004/0199613 (2004-10-01), Hundscheidt et al.
patent: 2008/0071894 (2008-03-01), Luss
patent: 2008/0268855 (2008-10-01), Hanuni et al.
patent: 2007056260 (2007-05-01), None
Ogryczak, “On the Lexicographic Minimax Approach to Location Problem,” European Journal of Operational Research, 100 (1997); p. 566-585.
Betts et al., “Minimax Resource Allocation for Problems with Ordering Constraints,” Naval Research Logistics, 41 (1994); p. 719-738.
Hua et al., “Video Delivery Technologies for Large-Scale Deployment of Multimedia Applications,” Proceedings of the IEEE, 92 (2004); p. 1439-1451.
Klein et al.,“A Lexicographic Minimax Algorithm for Multiperiod Resource Allocation,” Mathematical Programming, 55 (1992); p. 213-234.
Li et al., “Multirate Video Multicast Over the Interne: An Over,” IEEE Network, Jan./Feb. 2003; p. 24-29.
Luss, “On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach,” Operations Research, vol. 47, No. 3 (1999); p. 361-378.
Ramesh et al., “Multicast with Cache (Mcache): An Adaptive Zero-Delay Video-on-Demand Service,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 11, No. 3 (2001); p. 440-456.
Sarkar et al., “Fair Bandwidth Allocation for Multicasting in Networks with Discrete Feasible Set,”IEEE Transactions on Computers, vol. 52, No. 7 (2004); p. 785-797.
PCT Search Report from related application PCT/US2006/043154; dated Feb. 11, 2008; 6 pgs.
PCT International Preliminary Report on Patentability from related application PCT/US2006/043154; dated Mar. 25, 2008; 4 pgs.
European Examination Report from related application 06836956.0; dated Jun. 23, 2009; 3 pgs.
Supplemental European Search Report from related application 06836956.0; dated Apr. 15, 2009; 1 pg.
Fitch Even Tabin & Flannery
Phan Tri H
TTI Inventions C LLC
LandOfFree
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.
Profile ID: LFUS-PAI-O-2727071