IP Library Granted Patent US 7,693,087
Granted Patent B1
US 7,693,087 · App. 11/674,848 · Granted Apr 6, 2010

Selection and optimization of potential hub candidates within a network

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,693,087
App. No.
11/674,848
Granted
Apr 6, 2010
Kind
B1
Abstract

A method, system, and medium are provided for selecting one or more hub aggregation points from a number of candidates on a network. The method begins by obtaining selection criteria for each of the candidates. Using the obtained criteria a score for each candidate is determined. This determination involves assigning intermediate scores for each criteria and applying a weighted multiplier to the intermediate score. The total of the intermediate scores is the overall score for any candidate. The method continues by selecting potential hub aggregation points for further consideration based upon the determined score of each candidate. The method then calculates a least cost route for each point on the network under consideration to each of the selected hub aggregation points. Different combinations of selected hub aggregation points can then be used to iterate through the least cost routing analysis to arrive at a final selection of hub aggregation points.

Claims (28)

1. One or more non-transitory computer-readable media having computer-useable instructions embodied thereon for performing a method of selecting one or more hub aggregation points from a number of candidates on a network under consideration, the method comprising:

obtaining selection criteria for each candidate, the criteria including the importance and relevance of each candidate;

determining a score for each candidate based upon the obtained criteria; and

selecting potential hub aggregation points for further consideration based upon the determined score of each candidate,

wherein the importance information includes one or more of the hub type of the candidate, the number of vendors at the candidate, the number of different pieces of equipment at the candidate, the percentage of locations in the network that the candidate can support and whether the candidate has a tandem switch.

2. The computer-readable media of claim 1 , wherein the candidate selection criteria includes both absolute criteria and criteria relative to the network under consideration.

3. The computer-readable media of claim 2 , wherein the determining step applies a selected weight to each criteria.

4. The computer-readable media of claim 3 , the method further comprising calculating a least cost route for each point on the network under consideration using the selected potential hub aggregation points.

5. The computer-readable media of claim 2 , wherein the obtaining of selection criteria includes both data obtained from a database and results calculated using the data obtained from a database.

6. The computer-readable media of claim 4 , the method further comprising iterating least cost route calculations for each point on the network under consideration using only selected ones of the potential hub aggregation points.

7. One or more non-transitory computer-readable media having computer-useable instructions embodied thereon for performing a method for selecting one or more network aggregation points from a number of candidates on a network under consideration, the method comprising:

obtaining information regarding the importance and relevance of each candidate, the relevance information including one or more of the number of circuits in the network that can be routed to the candidate, the percentage of circuits in the network that can be routed to the candidate, the distance to a serving wire center and whether the candidate is a MAN node of the network;

calculating a score for each candidate based upon the obtained importance and relevance information; and

selecting potential network aggregation points for further consideration based upon the calculated score of each candidate.

8. The computer-readable media of claim 7 , wherein the network is a telecommunications network.

9. The computer-readable media of claim 8 , wherein the importance information includes one or more of the hub type of the candidate, the number of vendors at the candidate, the number of different pieces of equipment at the candidate, the percentage of locations in the network that the candidate can support and whether the candidate has a tandem switch.

10. The computer-readable media of claim 1 , wherein the relevance information includes one or more of the number of circuits in the network that can be routed to the candidate, the percentage of circuits in the network that can be routed to the candidate, the distance to a serving wire center and whether the candidate is a MAN node of the network.

11. The computer-readable media of claim 8 , the method further comprising calculating a least cost route for each point on the network under consideration using the selected potential network aggregation points.

12. The computer-readable media of claim 11 , the method further comprising iterating least cost route calculations for each point on the network under consideration using only selected ones of the potential hub aggregation points.

13. The computer-readable media of claim 12 , wherein the obtaining of information includes both data obtained from a database and results calculated using the data obtained from a database.

14. One or more non-transitory computer-readable media having computer-useable instructions embodied thereon for performing a method for selecting points of aggregation on a network, considering each of a number of possible candidates, comprising;

receiving data relating to each of the number of possible candidates, the data including the importance and relevance of each candidate;

applying a scoring template to the received data to determine a score for each of the number of possible candidates;

ranking the determined scores; and

based upon the ranked scores, selecting a portion of the number of possible candidates to serve as points of aggregation on the network, the portion being a range of the top-ranked candidates,

wherein the importance information includes one or more of the hub type of the candidate, the number of vendors at the candidate, the number of different pieces of equipment at the candidate, the percentage of locations in the network that the candidate can support and whether the candidate has a tandem switch.

15. The computer-readable media of claim 14 , wherein the network is a telecommunications network.

16. The computer-readable media of claim 15 , wherein the applying step includes calculating intermediate scores for each of the candidates based upon the received data for each of the candidates.

Assignments (3)
TERMINATION AND RELEASE OF FIRST PRIORITY AND JUNIOR PRIORITY SECURITY INTEREST IN PATENT RIGHTS Recorded Apr 2, 2020
From: DEUTSCHE BANK TRUST COMPANY AMERICAS
To: SPRINT COMMUNICATIONS COMPANY L.P.
Reel/Frame 052969/0475 →
GRANT OF FIRST PRIORITY AND JUNIOR PRIORITY SECURITY INTEREST IN PATENT RIGHTS Recorded Mar 6, 2017
From: SPRINT COMMUNICATIONS COMPANY L.P.
To: DEUTSCHE BANK TRUST COMPANY AMERICAS
Reel/Frame 041895/0210 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 14, 2007
From: CARR, MARIANNE; PRICE, SARAH E.; SPAIN, DEREK M.; STRECKER, MARY ANN; LAI, SHUN CALVIN
To: SPRINT COMMUNICATIONS COMPANY L.P.
Reel/Frame 018888/0942 →