U S West, Inc.

Cisco Technology, Inc.

Mediaone Group, Inc.

Qwest Communications International Inc.

Steve Y Chiu

Jean-Philippe Vasseur

Stefano Novello

Subramanian Raghavan

Pierre L Bastien

Victoria L C Okeson

Ronald L Hansen

Jiyang Xu

Jennifer Sanchez

Subramanian Vasudevan

Victoria L Okeson

Youngho Lee

Jianhua Zhu

In one embodiment, a target bandwidth, a lower bandwidth boundary constraint, and an upper cost boundary constraint for a constrained path are configured. A set of paths are computed that have bandwidth within the lower bandwidth boundary constraint and cost within the upper cost boundary constraint. A determination is made whether one or more paths of the set of paths has bandwidth that provides at least the target bandwidth and, if so, a path from the one or more paths of the set of paths having bandwidth that provides at least the target bandwidth is selected to use as the constrained path, and, if not, a path from the one or more paths of the set having bandwidth that does not provide at least the target bandwidth that has bandwidth closest to the target bandwidth is selected to use as the constrained path.

Relaxed constrained shortest path first (R-CSPF)

In one embodiment, a target bandwidth, a lower boundary constraint on bandwidth, and an upper boundary constraint on cost are configured on a path computation device. The device may then compute a set of paths that is within the lower bandwidth boundary and upper cost boundary constraints. If the set of paths contains one or more paths, the device may select a path having a bandwidth value that is closest to the target bandwidth. However if the set of paths contains no paths, the device may search amongst paths that violate either the maximum cost or minimum bandwidth limits, selecting the path closest to the violated constraint (e.g., whose combined violation is minimized). Also, a weighting factor may be configured to establish the relative importance for a cost violation in comparison to a bandwidth violation.

Local signal transfer points (LSTPs) are optimally selected for removal from a Signaling System Number 7 (SS7) network. At least one network element is connected to each LSTP and each LSTP is connected to a parent node. Each LSTP is determined as a flexible LSTP or a fixed LSTP. A potential network configuration is formed with at least one flexible LSTP excluded. Each network element is reconnected to one LSTP in the potential network configuration and each LSTP in the potential network configuration is reconnected to one parent node. A total cost based on the potential network configuration is determined. The potential network configuration becomes the new best network configuration if the total cost is less than any previous total cost. The process is repeated for each potential network configuration resulting from removing a different combination of flexible LSTPs.

Method for optimally selecting nodes for removal from a hierarchical communication network

A method and system for optimizing system capacity and allocation in a CDMA cellular communication system obtains a current call volume and associated call characteristics for each of a plurality of cell sites in the system, and estimates effective boundaries for each of the plurality of cell sites to minimize the weighted sum of powers received at selected base stations. Selection of base stations can include highly loaded sites and adjoining cell sites. System parameters are then controlled to effect the estimated cell site boundaries. Thus, the present invention allows for dynamic shrinking and enlarging of cell boundaries to enhance the system capacity advantages of CDMA while maintaining contiguous coverage and avoiding coverage holes.

Method and system to optimize capacity of a CDMA cellular communication

A frame relay network planning tool is provided for analyzing the status of an existing network, for evaluating the condition of any user defined configuration, and for optimizing the expansion of the network based on demand and costs. The tool recommends the optimal locations of new switches, the configurations of existing switches and the placement of new trunks, and backhaul locations where desirable. The tool attempts to optimize the network configuration for the given demand by a sequence of network configuration changes. After each change, an attempt is made to route the demand, with minimal cost, until all demand is routed. The network changes made by the program include in order of priority, upgrading a link, adding a link, upgrading a switch, and adding a switch. When this process is completed a survivability test is run to insure that the network configured by the tool is survivable.

Frame relay network planning tool

An improved system for translating an optimization problem for use in efficient resource allocation. The improved system of the present invention includes means for generating an index link record for each of the index variables in the optimization problem so as to eliminate the need for a symbol table and a plurality of temporary data records. The system also includes means for linking the index link records of the index variables requiring expansion in a reverse order of the order listed in the optimization problem so as to reduce the number of traversals performed during expansion processing. The index link records have a pointer for identifying the next index variable requiring expansion.

Growing community of inventors

Bedford, MA, United States of America

Steve Y Chiu