Abstract: A method includes forecasting demand for media content items of a media distribution system based on historical demand information to generate forecasted demand. The method includes generating a mixed integer program model based on storage constraints of a plurality of distribution nodes of the media distribution system, bandwidth constraints of the media distribution system, and the forecasted demand. The method includes performing a Lagrangian relaxation operation using the mixed integer program model. The method includes determining values of a cost function based on a result of the Lagrangian relaxation operation. The method includes assigning each of the media content items to a corresponding distribution node of the plurality of distribution nodes based on the cost function and the forecasted demand.

Abstract: A method includes forecasting demand for media content items of a media distribution system based on historical demand information to generate forecasted demand. The method includes generating a mixed integer program model based on storage constraints of a plurality of distribution nodes of the media distribution system, bandwidth constraints of the media distribution system, and the forecasted demand. The method includes performing a Lagrangian relaxation operation using the mixed integer program model. The method includes determining values of a cost function based on a result of the Lagrangian relaxation operation. The method includes assigning each of the media content items to a corresponding distribution node of the plurality of distribution nodes based on the cost function and the forecasted demand.

Abstract: A method of assigning a server to a client system includes determining an ingress point of the client system and identifying possible egress points for the client system. The method further includes selecting the server from a plurality of servers to reduce network cost and delivery time.

Abstract: A method includes receiving data identifying new media content items to be added to a media distribution system that provides media content on demand to a plurality of endpoints. The media distribution system includes a plurality of distribution nodes, and each of the distribution nodes is coupled to a subset of the endpoints. Historical demand is determined during a particular time period for existing media content items that include content available via at least one of the distribution nodes before the data was received. The method includes forecasting demand for media content items, including new media content items and existing media content items, based on the historical demand. Each media content item is assigned to, and stored at, at least one corresponding distribution node based at least partially on a cost function and the forecasted demand.

Abstract: A method of assigning a server to a client system includes determining an ingress point of the client system and identifying possible egress points for the client system. The method further includes selecting the server from a plurality of servers to reduce network cost and delivery time.

Abstract: A method of assigning a server to a client system includes determining an ingress point of the client system and identifying possible egress points for the client system. The method further includes selecting the server from a plurality of servers to reduce network cost and delivery time.

Abstract: A method includes receiving data identifying new media content items to be added to a media distribution system that provides media content on demand to a plurality of endpoints. The media distribution system includes a plurality of distribution nodes, and each of the distribution nodes is coupled to a subset of the endpoints. Historical demand is determined during a particular time period for existing media content items that include content available via at least one of the distribution nodes before the data was received. The method includes forecasting demand for media content items, including new media content items and existing media content items, based on the historical demand. Each media content item is assigned to, and stored at, at least one corresponding distribution node based at least partially on a cost function and the forecasted demand.

Abstract: A geometric model is considered for the problem of minimizing access control lists (ACLs) in network routers. A colored rectilinear pattern is created within an initially white rectangular canvas, and the basic operation is to choose a subrectangle and paint it a single color, overwriting all previous colors in the rectangle. The method operates on rectangular rule lists (RRLs) and access control lists (ACLs) in which all rectangles are strips that extend either the full length or the full height of the canvas. A polynomial-time algorithm optimally constructs such patterns when, as in the ACL application, the only colors are black and white (permit or deny). That algorithm is complemented by a significantly faster approximation algorithm that is guaranteed to be no worse than 3/2 optimal.

Abstract: A method of assigning a server to a client system includes determining an ingress point of the client system and identifying possible egress points for the client system. The method further includes selecting the server from a plurality of servers to reduce network cost and delivery time.