Ronald A Hansen

US Patent:

6094417, Jul 25, 2000

Filed:

Dec 1, 1998

Appl. No.:

9/203139

Inventors:

Ronald L. Hansen - Louisville CO
Jennifer Sanchez - Nederland CO

Assignee:

U S West, Inc. - Denver CO

International Classification:

H04J 300

US Classification:

370222

Abstract:

A SONET planning tool is provided for generating optimized SONET rings based on an existing SONET system capacity and anticipated system demand at minimal cost. The planning tool includes an analytical process that accurately models and utilizes embedded systems, linear chains, unidirectional rings, and bi-directional rings based on existing capabilities. In addition, large forecasted demands can be preprocessed with dedicated two-node rings, and multi-period studies can be generated.

US Patent:

59403730, Aug 17, 1999

Filed:

Jan 14, 1997

Appl. No.:

8/785805

Inventors:

Steve Y. Chiu - Louisville CO
Subramanian Raghavan - Louisville CO
Ronald L. Hansen - Louisville CO
Jiyang Xu - Superior CO

Assignee:

U S West, Inc. - Denver CO
MediaOne Group, Inc. - Englewood CO

International Classification:

H04J 1100

US Classification:

370238

Abstract:

A frame relay network planning tool is provided for analyzing the status of an existing network, for evaluating the condition of any user defined configuration, and for optimizing the expansion of the network based on demand and costs. The tool recommends the optimal locations of new switches, the configurations of existing switches and the placement of new trunks, and backhaul locations where desirable. The tool attempts to optimize the network configuration for the given demand by a sequence of network configuration changes. After each change, an attempt is made to route the demand, with minimal cost, until all demand is routed. The network changes made by the program include in order of priority, upgrading a link, adding a link, upgrading a switch, and adding a switch. When this process is completed a survivability test is run to insure that the network configured by the tool is survivable.

US Patent:

56151217, Mar 25, 1997

Filed:

Jan 31, 1995

Appl. No.:

8/381657

Inventors:

Djangir A. Babayev - Boulder CO
Richard M. Berger - Boulder CO
Vincil C. Dean - Edgewater CO
Ronald L. Hansen - Louisville CO
Scott H. Parrish - Boulder CO

Assignee:

U S West Technologies, Inc. - Boulder CO

International Classification:

G06F 1900
G06F 1760

US Classification:

395209

Abstract:

A scheduling system is disclosed for scheduling tasks for fulfilling a series of service requests. When each service request is received, a determination is made as to the amount of resources a task requires to provide the requested service. Further, a preferred time within which to perform the task is obtained from the requestor of the service request. For each service request, data for the estimated amount of resources and the preferred time are supplied, on a first-come-first-serve basis, to a scheduling component for solving a combinatorial optimization model which efficiently allocates a predetermined amount of resources for each time slot in a scheduling period by rearranging tasks for service requests previously received. The scheduling component provides for a service requestor, without regard to subsequently received service requests, a service time in which to perform the task for the requested service substantially immediately after the service request is made. Whenever possible, the service time coincides with the preferred time.