System and method for improving the automated loop makeup process

• US 20040107211A1
• Filed: 12/03/2002
• Published: 06/03/2004
• Est. Priority Date: 12/03/2002
• Status: Active Grant

• Current Assignee: Bellsouth Intellectual Property Corporation (AT&T, Inc.)
• Original Assignee: Bellsouth Intellectual Property Corporation (AT&T, Inc.)
• Inventors: Kite, Joshua W., Leathers, Steven C.
• Granted Patent: US 7,065,181 B2
• Time in Patent Office: Days
• US Class Current: 707/104.1
• CPC Class Codes: H04M 3/2245 Management of the local loop plant
• CPC Class Codes: H04M 3/2263 Network management

Abstract

Automatic generation of loop make-up eliminates the need to match terminal names. A furthest feature from the origination of a particular pair range is determined. Using the determined furthest feature, one or more loop make-ups is generated by running the loop make-up for the circuit from the determined furthest feature to the origination of the pair range. Loop make-ups can be generated for a pair range as a whole or for individual complements in the pair range.

Claims

1. A method for generating LMUs for use in creating circuit assignments in a telephone network, said method comprising the steps of:

(a) receiving an extract from an assignment database system;

(b) obtaining a pair range from the extract;

(c) determining a terminal name associated with the pair range;

(d) determining if the terminal name exists in a facilities database; and

(e) generating an LMU associated with the pair range if the terminal name does not exist in the facilities database.

2. The method recited in claim 1, further comprising the steps of:

(f) determining that the terminal name does not exist in the facilities database;

(g) determining a furthest feature from an origination of the pair range; and

(h) generating the LMU in accordance with the determined furthest feature.

3. The method recited in claim 2, further comprising the steps of:

(i) determining at least one additional furthest feature from the origination of the pair range; and

(j) determining at least one additional LMU in accordance with the at least one additional determined furthest feature.

4. The method recited in claim 1, further comprising the step of generating an error report if the LMU is not generated successfully.

5. The method recited in claim 2, further comprising the steps of:

(i) determining whether the pair range exists in the facilities database; and

(j) generating an error report if the pair range does not exist in the facilities database.

6. The method recited in claim 2, further comprising the steps of:

(i) determining whether the furthest feature can be reached by all complements in the pair range;

(j) setting a new complement equal to the next logical complement that was not in the pair range; and

(k) repeating steps (g) through (j) for the new complement.

7. The method recited claim 1, further comprising the step of generating the LMU using conventional processing if the terminal name exists in the facilities database;

8. A system for generating LMUs for use in creating circuit assignments in a telephone network, comprising:

means for receiving an extract from a assignment database system;

means for obtaining a pair range from the extract;

means for determining a terminal name associated with the pair range;

means for determining if the terminal name exists in a facilities database; and

means for generating an LMU associated with the pair range if the terminal name does not exist in the facilities database.

9. The system recited in claim 8, further comprising:

means for determining that the terminal name does not exist in the facilities database;

means for determining a furthest feature from an origination of the pair range; and

means for generating the LMU in accordance with the determined furthest feature.

10. The system recited in claim 9, further comprising:

means for determining at least one additional furthest feature from the origination of the pair range; and

means for determining at least one additional LMU in accordance with the at least one additional determined furthest feature.

11. The system recited in claim 8, further comprising means for generating an error if the LMU is not generated successfully.

12. The system recited in claim 9, further comprising:

means for determining whether the pair range exists in the facilities database; and

generating an error if the pair range does not exist in the facilities database.

13. The system recited in claim 9, further comprising:

means for determining whether the furthest feature can be reached by all complements in the pair range;

means for setting a new complement equal to the next logical complement that was not in the pair range; and

means for determining another LMU in accordance with the ext logical compliment.

14. The system recited claim 8, further comprising means for generating the LMU using conventional processing if the terminal name exists in the facilities database;

15. A system for generating LMUs, comprising:

a facilities database system that stores mechanized plats, the mechanized plats containing intelligent graphics describing facilities in a telephone network, wherein the mechanized plats are used to automatically create an LMU;

an assignment database that stores the LMU and uses the LMU to generate circuit assignments to provide service to telephone system subscribers;

an extract generated by the assignment database, the extract including at least one complement and a terminal name corresponding to the complement;

a processing computer to receive the extract and use the information in the extract to generate the LMU.

16. The system recited in claim 15, wherein the computer determines that the terminal name does not exist in the facilities database, and thereafter determines a furthest feature from an origination of the pair range and then generates the LMU in accordance with the determined furthest feature.

17. The system recited in claim 16, wherein the computer further determines at least one additional furthest feature from the origination of the pair range and further determines at least one additional LMU in accordance with the at least one additional determined furthest feature.

18. The system recited in claim 16, wherein the computer further determines whether the pair range exists in the facilities database and generates an error if the pair range does not exist in the facilities database.

19. The system recited in claim 16, wherein the computer further determines the furthest feature that can be reached by all complements in the pair range and sets a new complement equal to the next logical complement that was not in the pair range and determines another LMU in accordance with the new complement.

20. The system recited claim 15, wherein the computer further generates the LMU using conventional processing if the terminal name exists in the facilities database.

21. A method for generating LMUs for use in creating circuit assignments in a telephone network, said method comprising the steps of:

(a) receiving an extract from an assignment database system;

(b) obtaining a pair range from the extract;

(c) determining a terminal name associated with the pair range;

(d) determining that the terminal name does not exist in the facilities database;

(e) determining a furthest feature from an origination of the pair range if the terminal name does not exist in the facilities database; and

(f) generating an LMU in accordance with the determined furthest feature.

22. The method recited in claim 21, further comprising the steps of:

(g) determining at least one additional furthest feature from the origination of the pair range; and

(h) determining at least one additional LMU in accordance with the at least one additional determined furthest feature.

23. The method recited in claim 21, further comprising the steps of:

(g) determining whether the pair range exists in the facilities database; and

(h) generating an error report if the pair range does not exist in the facilities database.

24. The method recited in claim 21, further comprising the steps of:

(g) determining whether the furthest feature can be reached by all complements in the pair range;

(h) setting a new complement equal to the next logical complement that was not in the pair range; and

(i) repeating steps (e) through (h) for the new complement.

25. The method recited claim 21, further comprising the step of generating the LMU using conventional processing if the terminal name exists in the facilities database;