System and Method for Re-home Sequencing Optimization

• US 20100017247A1
• Filed: 03/30/2007
• Published: 01/21/2010
• Est. Priority Date: 10/02/2006
• Status: Abandoned Application

• Current Assignee: Cerion Optimization Services, Inc.
• Original Assignee: Cerion Optimization Services, Inc.
• Inventors: Liu, Feng, Liu, He, Li, Dongdong, Liao, Chen, Egner, Will A., Zheng, Yindong
• Application Number:
  US12/443,956
• Publication Number:
  US 20100017247A1
• Time in Patent Office: Days
• US Class Current: 705/8
• CPC Class Codes: G06Q 10/0633 Workflow analysis
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 41/145 involving simulating, designing, planning or modelling of a network
• CPC Class Codes: H04Q 2213/13098 Mobile subscriber
• CPC Class Codes: H04W 16/18 Network planning tools
• CPC Class Codes: H04W 16/22 Traffic simulation tools or models
• CPC Class Codes: H04W 24/02 Arrangements for optimising operational condition

Abstract

A system and method for rehome sequencing optimization of a telecommunications network. In a preferred embodiment, a practicable optimized rehome sequencing plan is determined for a rehome plan in order to migrate the network topology from an initial state to a final state while minimizing the costs incurred during the network state transitions across multiple time periods. Constraints that may be considered include specific market restrictions such as the limit on the number of network elements in a cluster, the limit on the number of clusters in a sequencing step, the limit on the number of sequencing steps, and the immobility limit on the network elements. Constraints also may include cost restrictions incurred during network transitions, such as individual cost limits during each network transition state and an overall cost limit of network transitions from the initial state to the final state.

Claims

1. A method of generating a rehome sequencing plan for a telecommunications network the method comprising:

inputting an initial topology of network elements for the telecommunications network;

generating an initial rehome sequencing plan for rehoming the telecommunications network from the initial topology to a final topology of network elements; and

modifying an order of rehome sequencing steps in the initial rehome sequencing plan to generate a practicable optimized rehome sequencing plan having minimized cost.

2. The method of claim 1, wherein the modifying the order of the rehome sequencing steps comprises a simulated annealing process to generate the practicable optimized rehome sequencing plan.

3. The method of claim 1, wherein the modifying the order of the rehome sequencing steps comprises a greedy search process to generate the practicable optimized rehome sequencing plan.

4. The method of claim 1, wherein the modifying the order of the rehome sequencing steps comprises a heuristic search process to generate the practicable optimized rehome sequencing plan.

5. The method of claim 1, wherein the minimized cost comprises minimized overall utilization of the network elements and inter-element mobility traffic.

6. The method of claim 5, wherein the utilization of the network elements comprises a utilization selected from the group consisting of:

sector load, transceiver utilization, Erlang load, busy hour call attempts load, packet control unit load, T1 load, DS0 channel utilization, and combinations thereof.

7. The method of claim 5, wherein the inter-element mobility traffic comprises inter-element handovers and inter-element location updates.

8. The method of claim 5, further comprising measuring the minimized cost using net present value as a unified unit of measurement.

9. The method of claim 1, wherein the generating the initial rehome sequencing plan comprises inputting the initial rehome sequencing plan, the method further comprising inputting the final topology.

10. The method of claim 1, wherein the generating the initial rehome sequencing plan comprises using a random permutation or heuristic selection of the rehome sequencing steps to create the initial rehome sequencing plan.

11. The method of claim 1, further comprising, before the modifying the order of the rehome sequencing steps, clustering adjacent network elements into rehome clusters such that the adjacent network elements are grouped into one of the rehome sequencing steps.

12. The method of claim 11, wherein adjacency of the network elements is determined by geographic distance or inter-element mobility traffic.

13. The method of claim 11, wherein there is only one of the network elements in each of the rehome clusters.

14. The method of claim 11, further comprising combining adjacent ones of the rehome clusters into one of the rehome sequencing steps.

15. The method of claim 1, further comprising implementing the practicable optimized rehome sequencing plan on the telecommunications network

16. The method of claim 1, wherein the telecommunications network is a wireless network, and wherein the network elements comprise base transceiver stations, base station controllers, and mobile switching centers.

17. The method of claim 1, wherein the modifying the order of rehome sequencing steps further comprises comparing at least two intermediate rehome sequencing plans by determining a difference in their respective costs, and the generating the practicable optimized rehome sequencing plan further comprises selecting the intermediate rehome sequencing plan with a lowest relative cost.

18. A system for generating a practicable optimized rehome sequencing plan for a telecommunications network, the system comprising:

a sequencing plan manager configured to generate rehome sequencing plans for rehoming the telecommunications network from an initial network element topology to a final network element topology;

a sequencing plan optimizer configured to search for the practicable optimized rehome sequencing plan for the telecommunications network;

a sequencing plan calculator configured to determine costs of the rehome sequencing plans;

a persistent storage for storing data about network element topologies, network elements, and network mobility information;

a network manager configured to retrieve the data from persistent storage and format the data into data structures usable by the sequencing plan manager, the sequencing plan optimizer and the sequencing plan calculator; and

a graphical user interface for interacting with a user of the system.

19. The system of claim 18, wherein the graphical user interface is configured to display the rehome sequencing plan in a series of geographical maps, and wherein the graphical user interface is configured to receive input from the system user to manually re-cluster network elements in a cluster, re-group clusters in rehome sequencing steps, and re-order rehome sequencing steps in the rehome sequencing plan.

20. The system of claim 18, wherein the graphical user interface is configured to display the rehome sequencing plan in a graph or report format showing a cost of network elements and a utilization of network elements for each rehome sequencing step in the rehome sequencing plan.

21. A computer program product for generating a rehome sequencing plan for a telecommunications network, the computer program product comprising:

computer program code for inputting an initial topology of network elements for the telecommunications network;

computer program code for generating an initial rehome sequencing plan for rehoming the telecommunications network from the initial topology to a final topology of network elements; and

computer program code for modifying an order of rehome sequencing steps in the initial rehome sequencing plan to generate a practicable optimized rehome sequencing plan having minimized cost.