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.

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.

Abstract: A method is presented for determining bandwidth allocations in a content distribution network that comprises multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The allocation problem is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree-like ordering constraints imposed on each of the programs. The algorithm provides an equitable solution in polynomial time for wide classes of performance functions. At each iteration, the algorithm solves single-link maximin optimization problems while relaxing the ordering constraints, selects a bottleneck link and fixes various variables at their optimal value.

Abstract: Methods for allocating blocks of addresses to nodes in an IP communications network determine an optimal set of serving subnets, referred to as resources, for a single node in an IP communications network with given input demands for blocks of addresses. An optimal set of resources is determined at the node to a relaxed problem that aggregates all the demands to a single large demand and deletes the constraints that each demand must be assigned to a single resource. Each of the original demands is then assigned to a single resource from among those determined by the solution to the relaxed problem. The methods can also be used to allocate new resources to nodes that already have existing resources, and to allocate subnets at all nodes in a tree network by solving repeatedly single-node problems.

Abstract: A communications path is established among an ordered sequence of moving nodes, representing vehicles. Available channels may differ from one node to the next node and a node cannot use the same channel for both receiving and transmitting information. Three methods are described that provide an optimal sequence of channel assignments between the nodes. A sequence of channel assignments is called optimal if it establishes a communications path from the first node in the sequence to the last node in the sequence, or, if such a path does not exist, from the first node to the farthest node possible in the sequence. The first method uses a depth-first search starting from the first node in the sequence. The second method uses a “look ahead” scheme in the depth-first search method. The third method requires only a single pass through the sequence of nodes by identifying optimal channel assignments in subsequences of nodes without a need for backtracking.

Abstract: A limited number of sensors are placed at selected locations in order to achieve equitable coverage levels to all locations that need to be monitored. The coverage level provided to any specific location depends on all sensors that monitor the location and on the properties of the sensors, including probability of object detection and probability of false alarm. These probabilities may depend on the monitoring and monitored locations. An equitable coverage to all locations is obtained by finding the lexicographically largest vector of coverage levels, where these coverage levels are sorted in a non-decreasing order. The method generates a lexicographic maximin optimization model whose solution provides equitable coverage levels. In order to facilitate computations, a nonlinear integer optimization model is generated whose solution provides the same coverage levels as the lexicographic maximin optimization model.

Abstract: A method provides for the optimal location of servers and the optimal assignment of programs to the servers in a video-on-demand (VOD) network with a tree topology. Each node may have demands for multiple VOD programs. The central server at the root of the network stores all programs, and each of the other servers may store some of these programs. The cost considered include cost of servers, cost of assigning programs to servers, and cost of link bandwidths used for broadcasting programs from servers to demands at various nodes. The demand for a specific program is served by the closest server that has this program along the path that connects the requesting node to the root of the tree network. The invention consists of a dynamic programming method that determines optimal server locations and optimal program assignments for minimizing the costs.

Abstract: This invention provides an automated adaptive method for identity verification of claimants that attempt to get access into a resource by responding to a sequence of identifiers. The sequence has a specified maximal length and the identifiers are partitioned into multiple groups where identifiers in the same group are correlated and identifiers in different groups are not correlated. The method guarantees that an impostor will be accepted with a probability that does not exceed a specified parameter and that a legitimate claimant will be rejected with a probability that does not exceed a different specified parameter. The method also computes the probabilities that a legitimate claimant, or an impostor, will terminate an interrogation session with an inconclusive result, which would necessitate further manual interrogation. The method is adaptive as the conditional probabilities of an impostor's responses change throughout a session of interrogation.

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.

Abstract: A method for placing equipment in a network begins with a baseline network on which demographic data is analyzed statistically to produce a demographically-driven driven demand forecast model. The demand forecast model yields a predicted demand for each census block group. This can be visualized as one map layer with a GIS. The layout method takes the predicted demands as input and produces new attribute information for network nodes, the central office and cross-connects. By the layout method the cost of placing equipment at available placement sites or nodes is minimized based on various constraints, e.g., the capacity of the equipment to be placed, the distance a user is located from a potential node. Once the minimum cost for a given set of placement sites, subscribers, equipment capacity, and other known constraints is determined the equipment are then placed at these sites. These include the number and type of DSLAMs assigned to each node.

Abstract: Non-uniform spatial loads are estimated for a plurality of bins corresponding to a cellular wireless territory served by Base Station Transceivers (BTS's). Using means and standard deviation of signal strength received at each of the bins from each of the BTS's, probabilities are computed for each bin such that each of the BTS's will serve the bin. Using the computed probabilities and an estimated offered load for each BTS, which load is derived from carried load and call lost measurements at the BTS, a resource constraint is then expressed for each BDS in terms of the bin offered load estimates. Next, using an approximation of relative demand for wireless services across all bins, based, for example, on demographic data, a performance function is expressed for each bin in terms of the bin's estimated offered load. Using the performance function a lexicographic minimax objective function is defined, which is then coupled with the resource constraints to express an equitable resource allocation model.

Abstract: A method is disclosed that provides an ordered sequence of reassignments of communications paths to new routes. The network may have multiple excessively long communications paths, referred to as out-of-kilter paths, while other communications paths are of acceptable length, referred to as in-kilter paths. The method approximately optimizes a predefined objective such as maximizing the number of reassigned out-of kilter communications paths. The method may reassign multiple in-kilter paths to new routes in order to free up capacity and allow the reassignment of an out-of-kilter path. Reassignments are executed one at a time according to the ordered sequence determined by the method, and no capacity violations are incurred on any network link at any point in time during the execution of the sequence of reassignments. All reassigned communications paths will be in-kilter.

Abstract: Methods for allocating blocks of addresses to nodes in an IP communications network determine an optimal set of serving subnets, referred to as resources, for a single node in an IP communications network with given input demands for blocks of addresses. An optimal set of resources is determined at the node to a relaxed problem that aggregates all the demands to a single large demand and deletes the constraints that each demand must be assigned to a single resource. Each of the original demands is assigned to a single resource from among those determined by the solution to the relaxed problem. The optimal solution balances the amount of excess addresses that are not used at the resources with the fragmentation of addresses at the node to too many resources with a discontinuous range of addresses. New resources can be allocated to nodes that already have existing resources.

Abstract: Non-uniform spatial offered loads are estimated for a plurality of bins corresponding to a cellular wireless territory served by Base Station Transceivers (BTS's). Using mean and standard deviation of signal strengths received at each of the bins from each of the BTS's, probabilities are computed for each bin that each of the BTS's will serve the bin. Using the computed probabilities and an estimated offered load for each BTS, which load is derived from carried load and call lost measurements at the BTS, a resource constraint is then expressed for each BTS in terms of the bin offered load estimates. Next, using an approximation of relative demand for wireless services across all bins, based, for example, on demographic data, a performance function is expressed for each bin in terms of the bin's estimated offered load. Using the performance functions, a lexographic minimax objective function is defined, which is then coupled with the resource constraints to express an equitable resource allocation model.

Abstract: A method for placing equipment in a network begins with a baseline network on which demographic data is analyzed statistically to produce a demographically-driven driven demand forecast model. The demand forecast model yields a predicted demand for each census block group. This can be visualized as one map layer with a GIS. The layout method takes the predicted demands as input and produces new attribute information for network nodes, the central office and cross-connects. By the layout method the cost of placing equipment at available placement sites or nodes is minimized based on various constraints, e.g., the capacity of the equipment to be placed, the distance a user is located from a potential node. Once the minimum cost for a given set of placement sites, subscribers, equipment capacity, and other known constraints is determined the equipment are then placed at these sites. These include the number and type of DSLAMs assigned to each node.

Abstract: The invention is directed toward a device wherein out-of-kilter communications paths are reassigned in a manner that is more efficient than the art. Efficiency is improved because the reassignment of out-of-kilter communications paths permits reassignments of in-kilter communications paths in order to most efficiently accommodate the reassignment of the out-of-kilter communications paths. More specifically, a device made in accordance with the invention would comprise means for receiving a set of out-of-kilter communications paths and a set of in-kilter communications paths and means for permitting changes to both the set of out-of-kilter communications paths and the set of in-kilter communications paths. The changes are specified as an ordered sequence of reassignments. This sequence satisfies the properties of graceful reassignment solutions. A corresponding method for finding a graceful reassignment solution is disclosed.

Abstract: A method is provided for designing a hierarchical architecture for a synchronous optical network (SONET) given a plurality of demand nodes at which communications traffic originates and at least one destination node at which the communications traffic is collected for transmission to a switch.