Michael S Moriarty

US Patent:

7496544, Feb 24, 2009

Filed:

Apr 19, 2005

Appl. No.:

11/109070

Inventors:

Steven Edward Atkin - Austin TX, US
Mark Edward Davis - Menlo Park CA, US
Michael Francis Moriarty - Byron MN, US
Dale Martin Schultz - Chelmsford MA, US
William James Sullivan - Bethel CT, US
Luis Zapata - Wake Forest NC, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/60

US Classification:

705400, 705 1, 717136, 717137, 706925

Abstract:

An improved method, apparatus, and computer instructions for evaluating acquisition costs for a software product. A set of questions regarding the software product is presented. The set of questions are selected from a source. Costs for acquiring the software product are identified in response to receiving a user input to the set of questions. A report is generated using the costs, wherein the report is used to evaluate whether to acquire the software product in response to identifying the costs.

US Patent:

7773516, Aug 10, 2010

Filed:

Nov 16, 2006

Appl. No.:

11/560710

Inventors:

Dennis Cox - Austin TX, US
Michael Moriarty - Austin TX, US

Assignee:

Breakingpoint Systems, Inc. - Austin TX

International Classification:

H04J 1/16

US Classification:

370231, 370235

Abstract:

A network processor is enabled to retrieve a packet transmission data structure (PTD) from a memory. The NP parses packet data from the PTD and transmits the data over the network as a network packet. The PTD may include repetition information used by the NP to transmit a plurality of packets. The PTD use transmission interval information to control transmission timing of consecutive network packets. The PTD may include modification information used to modify the data packet portion. The modification may include incrementing, decrementing, or storing a random number into any portion of the data packet. The PTD may include flow control information to determine the next PTD to process. The flow control information may include criteria including acknowledgement criteria and time delay criteria. The packet data portion preferably includes all formatting information applicable to the network.

US Patent:

7793262, Sep 7, 2010

Filed:

Jul 29, 2004

Appl. No.:

10/902476

Inventors:

Steven Edward Atkin - Austin TX, US
Mark Edward Davis - Menlo Park CA, US
Michael Francis Moriarty - Byron MN, US
Dale Martin Schultz - Chelmsford MA, US
William James Sullivan - Bethel CT, US
Luis M. Zapata - Wake Forest NC, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 9/44
G06F 11/00

US Classification:

717125, 717124, 714 38

Abstract:

A method, apparatus, and computer instructions for testing software. A set of questions regarding the application is presented, wherein the set of questions are selected from a database. In response to receiving a user input to the set of questions, the application is tested to form identified testing. In response to identifying testing, a testing report is generated using the identified testing, wherein the testing report includes links to testing instructions for the identified testing for the application.

US Patent:

20040085956, May 6, 2004

Filed:

Oct 31, 2002

Appl. No.:

10/285069

Inventors:

Michael Moriarty - Austin TX, US
Michael Roche - Austin TX, US
Leslie Zsohar - Round Rock TX, US

International Classification:

H04L012/28
H04L012/56

US Classification:

370/389000

Abstract:

A network or other type of processor operates to switch packets from an incoming cell stream to an outgoing cell stream. Each received and transmitted cell in a cell stream includes portions of packets, or complete packets or both. Packets are reassembled from incoming cells, and outgoing cells may be created from portions of packets, complete packets or both. The packets in the outgoing cells may be from incoming packets, switched reassembled packets or both. Each incoming and outgoing cell is associated with one virtual channel, and each virtual channel for an outgoing cell may be different from the virtual channel corresponding to the incoming cell or cells from which a packet was reassembled. Switched packets also may have their conversation identifications changed. Partial packets or partial cells that are awaiting completion are retained such that switching capabilities associated with the virtual channel and channel identification modifications may be used.

US Patent:

20130343207, Dec 26, 2013

Filed:

Jun 21, 2012

Appl. No.:

13/529423

Inventors:

Brent Aaron Cook - Pflugerville TX, US
Ryan Clifton - Austin TX, US
Kristopher Len Raney - Austin TX, US
Mark Veteikis - Austin TX, US
Michael Moriarty - Austin TX, US

International Classification:

H04L 12/26

US Classification:

370252

Abstract:

An automated method for analyzing a plurality of network messages received by a network testing device is disclosed. The method may comprise, during a current window of time, receiving from a target network device a network message associated with an original network message determining a latency value for the received network message comparing the determined latency value with the threshold latency value; and incrementing either the first counter or the second counter based on the comparison of the determined latency value with a threshold latency value. The method may further comprise, at the end of the current window of time, storing the first and second counter values resulting from the analysis of the plurality of original network messages.

US Patent:

20130343378, Dec 26, 2013

Filed:

Jun 21, 2012

Appl. No.:

13/529372

Inventors:

Mark Veteikis - Austin TX, US
Dennis James Cox - Austin TX, US
Michael Moriarty - Austin TX, US

International Classification:

H04L 12/56

US Classification:

370389

Abstract:

A method for enabling virtual data loopback in a computing system may include forwarding a data packet from a first device to a second device; the second device identifying from the data packet egress interface information indicating a first interface for forwarding the data packet out of the computing system; based on the first interface identified from the egress interface information, automatically determining a second interface to the first interface; inserting into the data packet ingress interface information that indicates the second interface; forwarding the data packet, including the ingress interface information, back to the first device; and the first device identifying the ingress interface information indicating the second interface; such that the data packet is looped back to the first device without being communicated via the first or second interface, and such that from the perspective of the first device the data packet was received via the second interface.

US Patent:

20130343380, Dec 26, 2013

Filed:

Jun 21, 2012

Appl. No.:

13/530019

Inventors:

Rodney S. Canion - Austin TX, US
Brent Aaron Cook - Pflugerville TX, US
Jonathan Stroud - Austin TX, US
Michael Moriarty - Austin TX, US

International Classification:

H04L 12/56

US Classification:

370389

Abstract:

A method of flexibly binding physical network interface ports to a processor in a network testing system comprises generating an egress network packet with a prepend header at a processor, wherein the prepend header specifies a particular physical network interface through which the egress network packet should be transmitted, transmitting the prepended network packet to a configurable logic device (CLD), routing the prepended network packet to the specified physical network interface.

US Patent:

20130343387, Dec 26, 2013

Filed:

Jun 21, 2012

Appl. No.:

13/529535

Inventors:

Jonathan Stroud - Austin TX, US
Michael Moriarty - Austin TX, US
Brent Aaron Cook - Pflugerville TX, US

International Classification:

H04L 12/56

US Classification:

370392

Abstract:

A method of routing internal network traffic within a computing system comprises receiving a network packet at a configurable logic device (CLD), parsing the network packet to obtain a destination address, searching a predetermined range of a routing table wherein each row of the routing table specifies a range of possible destination addresses and routing information, identifying a matching row of the routing table wherein the destination address falls within the range of possible destination addresses of the matching row, and routing the packet according to the routing information.