Steven W Simmons

US Patent:

6545984, Apr 8, 2003

Filed:

Dec 17, 1998

Appl. No.:

09/213523

Inventors:

Steven Michael Simmons - Dallas TX

Assignee:

Nortel Networks Limited - St. Laurent

International Classification:

H04L 1228

US Classification:

370254, 370252, 370335, 370342, 370441, 455456

Abstract:

A method for analyzing the topology of a CDMA network with respect to both neighbor and target lists is disclosed. The method first defines a language that creates an input source file for communicating the layout of the CDMA network. The language expresses the sector-neighbor list relationships of all sectors in the CDMA network. Next, the method parses and builds a directed graph from the input source file to perform topology analysis of the CDMA network. The method then analyzes the input source file and directed graph for possible errors in the network layout that will lead to dropped calls. The method renders a report to the user about those error conditions and emits a file to be used as input into the CDMA database.

US Patent:

8462636, Jun 11, 2013

Filed:

Feb 10, 2010

Appl. No.:

12/703503

Inventors:

Steven M. Simmons - Dallas TX, US
Albert Smith - Richardson TX, US

Assignee:

Fujitsu Limited - Kawasaki-shi

International Classification:

H04L 12/56

US Classification:

3702361, 370401, 709250

Abstract:

According to one embodiment, a network element may include one or more network interfaces and a master control unit communicatively coupled to the one or more network interfaces. The one or more network interfaces may include in the aggregate, a plurality of physical ports configured as member ports of a link aggregation group. The master control unit may be configured to maintain a routing table, such routing table including information regarding which of the plurality of physical ports of the link aggregation group is designated as an active port for management traffic egressing via the link aggregation group, wherein the active port carries a communication channel for the management traffic segregated from carrier traffic, and communicate the routing table to each of the one or more network interfaces.

US Patent:

8493872, Jul 23, 2013

Filed:

Mar 26, 2010

Appl. No.:

12/748019

Inventors:

Albert Smith - Richardson TX, US
Nimer Yaseen - Allen TX, US
Zanjun Lu - Edison NJ, US
Joseph K. Nguyen - Flower Mound TX, US
Stephen Graham - Fate TX, US
Sushanth Vallath - Calabasas CA, US
Steven M. Simmons - Dallas TX, US

Assignee:

Fujitsu Limited - Kawasaki-shi

International Classification:

H04J 1/16
H04L 12/26

US Classification:

370248, 370227

Abstract:

A method and system for determining a path between nodes in a network are disclosed. In accordance with an embodiment of the present disclosure, a system for determining a path between nodes in a network comprises a destination node and a link aggregation group (LAG) that includes a first link and a second link. The system further comprises a source node communicatively coupled to the destination node by the LAG where the source node, the LAG and the destination node form a path. The source node is operable to determine a link availability status for each of the first and second links using a layer-2 protection scheme. The source node is further operable to monitor the path for connectivity based on the link availability status using a layer-3 protection scheme.

US Patent:

53717473, Dec 6, 1994

Filed:

Jun 5, 1992

Appl. No.:

7/893761

Inventors:

Gary S. Brooks - Garland TX
Steven M. Simmons - Dallas TX

Assignee:

Convex Computer Corporation - Richardson TX

International Classification:

G06F 1100

US Classification:

371 19

Abstract:

Debugging of computer programs is necessary for the development of the programs as well as for maintaining the operation of the programs. Symbolic debugging requires the ability to relate the current position in the object code program to the corresponding position in the source code. In the absence of compiler optimization, correlating the source and object code elements is a straightforward procedure. However, when the object code has been optimized, the relation between the source code constructs and object code instructions can become convoluted and complex. A correlation technique for optimized code is disclosed which maps the source constructs (source units) through each of the optimization operations by use of compilation nodes and associated source units to build a table which relates ranges of object instructions to the source units which produced the object instructions.

US Patent:

59565128, Sep 21, 1999

Filed:

Sep 29, 1995

Appl. No.:

8/536196

Inventors:

Steven M. Simmons - Dallas TX
Gary S. Brooks - Garland TX

Assignee:

Hewlett-Packard Co. - Palo Alto CA

International Classification:

G06F 945

US Classification:

395705

Abstract:

A debugger is used in an environment of optimized compiling to track both user-defined and synthesized variables so that the values of these variables at selected programmer counter addresses can be either determined or set. The tracking is primarily accomplished by the generation of various interrelated tables including a Type Scope Table, a Name Space Table, an Expression Table, a Location Range Tab and a Variable Table. These tables define the existence of variable at defined program counter ranges and provide the algebraic definitions for the synthesized variables. A programmer can efficiently debug a program produced with optimized compiling through the operations of determining variable values and setting variable values.

US Patent:

20150271304, Sep 24, 2015

Filed:

Mar 21, 2014

Appl. No.:

14/222474

Inventors:

Albert V. Smith - Richardson TX, US
Nasir Iqbal Amanullah - Richardson TX, US
Bradford J. Dobson - Richardson TX, US
Tintooda Nakakes - Richardson TX, US
Steven M. Simmons - Richardson TX, US

International Classification:

H04L 29/08
H04L 12/24

Abstract:

Separating and isolating multiple network stacks in a network element may enable a network element to simultaneously operate within multiple forwarding planes respectively corresponding to the multiple network stacks. In addition to the network stack, other protocols and routing tools may also be instantiated for each desired forwarding plane. The different instantiations of the network stacks may be executed in parallel in respective memory spaces that are distinct and separate. In this manner, each forwarding plane may operate independently on the network element from other forwarding planes.