Abstract: Scrambling code conflicts can be mitigated by primary scrambling code reuse that minimizing a potential interference Primary scrambling codes are applied to a first set of cells located in a portion of the network being considered. A second set of cells are evaluated for primary scrambling code reuse based on a distance parameter and/or a coverage area. If the distance parameter is greater than a defined distance, primary scrambling code reuse can be applied. If all distance parameters evaluated are less than the distance parameter, a length of the distance parameter is reduced and the distance between cells is reevaluated.

Abstract: A method and apparatus for providing planning of a plurality of radio network controllers in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one radio network controller parameter in accordance with the input data. The method determines if the limit for the at least one radio network controller parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one radio controller parameter is exceeded.

Abstract: A rule-based method and apparatus for evaluating the cost of operating a network infrastructure are disclosed. For example, the method receives a request to evaluate the cost of operating a network infrastructure in a form of one or more rules, e.g., in a natural language format. The one or more rules are translated into at least one cost model. The method then applies the at least one cost model to determine the cost of operating the network infrastructure.

Abstract: A location of user equipment (UE) in a wireless network is determined. Geometric calculations are leveraged for an overlaid bin grid framework mapping the wireless network area to store differential values for each frame of the bin grid framework for each pair of relevant NodeBs. A timing offset can be determined, such that when a time value from a target UE is accessed, the location can be quickly determined. The target UE time value can be searched for in the pre-computed differential value data set indexed by a relevant NodeB site pair to return a set of frames (forming a hyperbola between the site pair) that can be intersected with a second set of frames for a second NodeB site pair for the same UE. The intersecting frames can represent the location of the UE in the wireless network and timing in the network is correctable based on the data.

Abstract: Certain exemplary embodiments comprise a method, comprising: via an antecedents user interface, receiving a plurality of customer antecedents, each of the customer antecedents corresponding to one of a plurality of variables associated with one or more rules from a set of rules defining a plurality of service offerings; generating a prioritized list of the plurality of service offerings based upon application of the set of rules to the received customer antecedents; and causing the prioritized list to be rendered to a user.

Abstract: Systems and techniques for determining the location of user equipment (UE) in a wireless network are disclosed. These techniques leverage geometric calculations for an overlaid bin grid framework mapping the wireless network area to store differential values for each frame of the bin grid framework for each pair of relevant NodeBs. A timing offset can be determined, such that when a time value from a target UE is accessed, the location can be quickly determined with minimal real time computation. In an aspect, the target UE time value can be search for in the pre-computed differential value data set indexed by a relevant NodeB site pair to return a set of frames (forming a hyperbola between the site pair) that can be intersected with a second set of frames for a second NodeB site pair for the same UE. The intersecting frames can represent the location of the UE in the wireless network. Further, the data can be leveraged to correct timing in the network.

Abstract: A method and apparatus for providing planning of a plurality of mobile switching centers in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one mobile switching center parameter in accordance with the input data. The method determines if the limit for the at least one mobile switching center parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one mobile switching center parameter is exceeded.

Abstract: Systems and techniques for determining the location of user equipment (UE) in a wireless network are disclosed. These techniques leverage geometric calculations for an overlaid bin grid framework mapping the wireless network area to store differential values for each frame of the bin grid framework for each pair of relevant NodeBs. A timing offset can be determined, such that when a time value from a target UE is accessed, the location can be quickly determined with minimal real time computation. In an aspect, the target UE time value can be search for in the pre-computed differential value data set indexed by a relevant NodeB site pair to return a set of frames (forming a hyperbola between the site pair) that can be intersected with a second set of frames for a second NodeB site pair for the same UE. The intersecting frames can represent the location of the UE in the wireless network. Further, the data can be leveraged to correct timing in the network.

Abstract: Systems and techniques for determining the location of user equipment (UE) in a wireless network are disclosed. These techniques leverage geometric calculations for an overlaid bin grid framework mapping the wireless network area to store differential values for each frame of the bin grid framework for each pair of relevant NodeBs. A timing offset can be determined, such that when a time value from a target UE is accessed, the location can be quickly determined with minimal real time computation. In an aspect, the target UE time value can be search for in the pre-computed differential value data set indexed by a relevant NodeB site pair to return a set of frames (forming a hyperbola between the site pair) that can be intersected with a second set of frames for a second NodeB site pair for the same UE. The intersecting frames can represent the location of the UE in the wireless network. Further, the data can be leveraged to correct timing in the network.

Abstract: A computerized method and system for integrated access network business planning for a telecommunications carrier. The invention enables a user to input a set of network business planning parameters that are utilized by a linear programming model to jointly optimize a carrier's dedicated and radio access network by executing a plurality of network optimization models and determine network configuration changes for the dedicated and radio access networks as a constrained optimization based on the set of business planning parameters.

Abstract: A method and apparatus for providing a topology for interconnection of telecommunication nodes in a communication network are disclosed. For example, the method obtains input data, and determines values of: at least one set, at least one parameter, and at least one variable associated with the communication network in accordance with the input data. The method then determines the topology for the interconnection via microwave links of the telecommunication nodes from an objective function in accordance with the at least one set, at least one parameter, and at least one variable, wherein the objective function is based on a plurality of penalty factors.

Abstract: A method and apparatus for providing planning of a plurality of serving general packet radio service support nodes in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one serving general packet radio service support node parameter in accordance with the input data. The method determines if the limit for the at least one serving general packet radio service support node parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one serving general packet radio service support node parameter is exceeded.

Abstract: A method and apparatus for providing planning of a plurality of mobile switching centers in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one mobile switching center parameter in accordance with the input data. The method determines if the limit for the at least one mobile switching center parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one mobile switching center parameter is exceeded.

Abstract: A method and apparatus for providing planning of a plurality of base station controllers in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one base station controller parameter in accordance with the input data. The method determines if the limit for the at least one base station controller parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one base station controller parameter is exceeded.

Abstract: A method and apparatus for providing planning of a plurality of radio network controllers in a wireless network are disclosed. For example, the method obtains input data, and determines a limit for at least one radio network controller parameter in accordance with the input data. The method determines if the limit for the at least one radio network controller parameter is exceeded and determines an optimal output for an objective function, wherein the objective function is based on a plurality of penalty factors, if the limit for the at least one radio controller parameter is exceeded.

Abstract: A method and apparatus for selecting a bandwidth option for a cell in a network are disclosed. For example, the method obtains, for the cell, network traffic data for a geographical area, and a physical characteristic of an antenna in the geographical area, determines busy time data traffic from the network traffic data, determines, for the cell, a cell range from the physical characteristic of the antenna, selects a bandwidth option from a plurality of bandwidth options, and determines an average throughput in accordance with the bandwidth option that is selected and the cell range.

Abstract: A system and method for generating a map includes a database for storing a list of recipients and characteristics associated with each recipient in the list of recipients. The method and system also includes a control module for receiving a characteristic associated with at least one recipient in the list of recipients. The method and system also includes a rule engine for generating a map based at least in part on the characteristic associated with the at least one recipient using programmable rules.

Abstract: Systems and techniques for determining the location of user equipment (UE) in a wireless network are disclosed. These techniques leverage geometric calculations for an overlaid bin grid framework mapping the wireless network area to store differential values for each frame of the bin grid framework for each pair of relevant NodeBs. A timing offset can be determined, such that when a time value from a target UE is accessed, the location can be quickly determined with minimal real time computation. In an aspect, the target UE time value can be search for in the pre-computed differential value data set indexed by a relevant NodeB site pair to return a set of frames (forming a hyperbola between the site pair) that can be intersected with a second set of frames for a second NodeB site pair for the same UE. The intersecting frames can represent the location of the UE in the wireless network. Further, the data can be leveraged to correct timing in the network.

Abstract: A technique for reducing costs associated with a radio access network of a mobile telecommunications network includes configuring the radio access network using a linear programming model of the radio access network subject to constraints. The technique includes selecting cellular sites and hub locations of the radio access network to be connected by broadband wireless links based on the linear programming model and constraints. In at least one embodiment of the invention, a method of designing a radio access network of links between a cellular site and a core network includes selecting at least one first link of the radio access network to be at least one first wireless link at least partially based on a linear programming model of the radio access network. The method includes configuring an output device of a computer system to indicate the selection.

Abstract: A computer readable storage medium stores a set of instructions executable by a processor. The instructions are operable to receive a data set including data corresponding to a set of nodes, the data corresponding to each of the nodes including a node prize, a node cost, and a node value that is the difference between the node prize and the node cost; select one or more of the nodes for inclusion in a cluster, the cluster comprising the one or more of the nodes, two or more external links from nodes in the cluster to a network, and one or more internal links between nodes if the cluster comprises two or more nodes, each of the internal links having an internal link cost, each of the external links having an external link cost; and determine a plan for incorporating the one or more nodes in the cluster into the network, the incorporating comprising building the cluster by building the two or more external links and the one or more internal links.