Method and system for rehome optimization

• US 5,937,042 A
• Filed: 03/19/1996
• Issued: 08/10/1999
• Est. Priority Date: 03/19/1996
• Status: Expired due to Term

• Current Assignee: Verizon Patent and Licensing Incorporated (Verizon Communications Inc.)
• Original Assignee: MCI Communications Corporation (Verizon Communications Inc.)
• Inventors: Sofman, Lev B.
• Primary Examiner(s): Kuntz, Curtis A.
• Assistant Examiner(s): TIEU, BINH KIEN
• Application Number:
  US08/620,727
• Time in Patent Office: 1,239 Days
• Field of Search: 379/9-10, 379/15, 379/16, 379/17, 379/33, 379/34, 379/111, 379/113, 379/201, 379/207, 379/219, 379/220, 379/221, 379/229, 379/230, 379/269, 379/133, 379/136, 379/112, 379/115 , 379/242, 379/134, 364/825.07, 364/825.17
• US Class Current: 379/112.05
• CPC Class Codes: H04M 3/36 Statistical metering, e.g. recording occasions when traffic exceeds capacity of trunks
• CPC Class Codes: H04Q 2213/13525 GUI - graphical user interface, inc. for service creation
• CPC Class Codes: H04Q 2213/13526 resource management
• CPC Class Codes: H04Q 2213/13544 modeling or simulation, particularly of networks
• CPC Class Codes: H04Q 2213/13547 subscriber, e.g. profile, database, database access
• CPC Class Codes: H04Q 3/0083 Network planning or design; Modelling of planned or existing networks
• CPC Class Codes: H04Q 3/665 Circuit arrangements therefor

Abstract

Provided is a method and system for rehome optimization of a telecommunications network. Optimal network configurations are determined according to automatically derived attributes associated with granulations of elements in the network called rehome circuit groups (RCGs). RCGs are automatically derived from the telecommunications network. RCGs are definable as a rehoming set of one or more circuits in the network. Optimal network configurations satisfy specified constraints and are calculated in accordance with cost objectives. Constraints include rehoming RCGs on criteria of having a relationship with other RCGs in the network and how to treat certain RCGs in the rehome process.

Claims

1. A method in a data processing system for rehome optimization of a telecommunications network, said method comprising:

constructing a set of rehome circuit groups and data associated thereof;

specifying a problem scope as a subset of said set of rehome circuit groups;

specifying input for predicating said rehome optimization, wherein the step of specifying input for predicating said rehome optimization comprises the step of specifying a cost function comprising;

specifying cost function components;

specifying a number of solutions for report of said rehome optimization solutions;

calculating rehome cost for each candidate rehome optimization solution in accordance with said cost function; and

confining report of said rehome optimization solutions with respect to said number of solutions and in accordance with said rehome cost for each candidate rehome optimization solution in accordance with said cost function; and

calcalating rehome optimization solutions for said problem scope in accordance with said input.

2. The method of claim 1 wherein the step of specifying cost function components further comprises the step of associating a user defined weight coefficient to each of said cost function components.

3. The method of claim 1 wherein the step of specifying cost function components further comprises the step of specifying an intermachine trunk traffic measurement component.

4. The method of claim 1 wherein the step of specifying cost function components further comprises the step of specifying a distance component.

5. The method of claim 1 wherein the step of specifying cost function components further comprises the step of specifying a port balancing component.

6. A method in a data processing system for rehome optimization of a telecommunications network, said method comprising:

constructing a set of rehome circuit groups and data associated thereof;

specifying a problem scope as a subset of said set of rehome circuit groups;

specifying input for predicating said rehome optimization; and

calculating rehome optimization solutions for said problem scope in accordance with said input, wherein the step of calculating rehome optimization solutions for said problem scope in accordance with said input further comprises the steps of;

generating unique rehome circuit group enumeration for said rehome circuit groups;

generating unique switch enumeration for switches for which said rehome circuit groups capable of being homed;

constructing a set of assignment vectors according to said unique circuit group enumeration and said unique switch enumeration; and

sequencing candidate assignment vectors of said set of assignment vectors.

7. The method of claim 6 further comprising the steps of:

associating constraints with said candidate assignment vectors;

associating a feasibility function with said candidate assignment vectors according to said constraints;

assessing feasibility of said candidate assignment vectors in accordance with said feasibility function; and

selecting a feasible assignment vector from said candidate assignment vectors according to said feasibility function.

8. The method of claim 7 further comprising the steps of:

associating a cost function with said set of assignment vectors;

calculating a cost for said candidate assignment vectors; and

constructing rehome optimization solution information for said set of assignment vectors from said candidate assignment vectors in accordance with said feasibility function and said cost function.

9. The method of claim 6 wherein the step of sequencing candidate assignment vectors comprises the steps of:

constructing an (S,R)-vector set of said set of assignment vectors for a number S of switches and a number R of rehome circuit groups;

constructing a k-neighborhood from said (S,R)-vector set for a depth of search parameter k;

constructing a random permutation p for said number R of rehome circuit groups;

performing (p,k)-enumeration of said set of assignment vectors in said k-neighborhood; and

sequencing said set of assignment vectors in said (S,R)-vector set in order of said (p,k)-enumeration.

10. The method of claim 8 further comprising the step of reporting said rehome optimization solution information.

11. The method of claim 10 wherein the step of reporting said rehome optimization solution information further comprises the step of reporting rehome optimization solutions in a priority order.

12. The method of claim 10 wherein the step of reporting said rehome optimization solution information further comprises the step of reporting the best rehome optimization solution.

13. A method in a data processing system for automatically creating logical groups of data for the purpose of rehome optimization of a telecommunications network, said method comprising the steps of:

automatically accessing a plurality of network system data repositories;

comparing data found in said plurality of network system data repositories;

complementing data found in said plurality of network system data repositories;

constructing a set of rehome circuit groups and associated data thereof;

creating a working copy of said set of rehome circuit groups and associated data thereof;

presenting a user interface to a user for managing said working copy of said set of rehome circuit groups and associated data thereof; and

altering only said working copy of said set of rehome circuit groups and associated data thereof.