Sarah Price

US Patent:

8422424, Apr 16, 2013

Filed:

Dec 8, 2009

Appl. No.:

12/633195

Inventors:

Brian Daniel VonFeldt - Olathe KS, US
Sarah E. Price - Merriam KS, US
William Leslie Hitchcock - Olathe KS, US

Assignee:

Sprint Communications Company L.P. - Overland Park KS

International Classification:

H04W 4/00

US Classification:

370328

Abstract:

A wireless communication network is served by a plurality of network paths between network control nodes and base stations, wherein the network paths each include a plurality of backhaul links. A backhaul link termination system comprises a communication interface and a processing system. The communication interface is configured to receive architecture information that individually associates the backhaul links with the network paths, and to receive communication loading data and cost data for each of the backhaul links. The processing system is configured to process the architecture information, the loading data, and the cost data to identify a set of the backhaul links for termination.

US Patent:

7693087, Apr 6, 2010

Filed:

Feb 14, 2007

Appl. No.:

11/674848

Inventors:

Marianne Carr - Overland Park KS, US
Sarah E. Price - Merriam KS, US
Derek M. Spain - Olathe KS, US
Mary Ann Strecker - Grandview MO, US
Shun Calvin Lai - Overland Park KS, US

Assignee:

Sprint Communications Company L.P. - Overland Park KS

International Classification:

H04L 12/26

US Classification:

370252, 370229, 370230, 370235

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.