Motorola Corporation

At+t Corp.

Codex Corporation

Brian T Hou

James A Pasco-Anderson

Michael Gutman

Craig D Cohen

Chin-Wang Chao

Frances Centofante

Fernando Teixeira

Christian P Kolmodin

Shu-Chih Lin

Clarence W Buffalo

Elliot P Olschwang

The present invention provides a method and system for automatically providing infrastructure maintenance for a customer in response to a customer form/report/ticket in a communications network that includes a core communications (voice and data communications) service and an Access Provider service. Typically, the system includes a Work-Flow Manager and a maintenance program scheduler. The Work-Flow Manager is arranged to trigger, for each customer form/report/ticket, each automatic software program/engine of a plurality of automatic software programs/engines in response to an associated milestone event for the customer form/report/ticket. The maintenance program scheduler is coupled to the Work-Flow Manager and is used for invoking at least one predetermined maintenance software program based upon predetermined criteria being met by the form/report/ticket. The method includes the steps of: generating a ticket/customer repair request regarding a problem; diagnosing the problem; testing to determine whether the problem has been fixed; generating clearance and analysis codes; notifying the customer that the system has repaired the problem; and closing out the ticket/repair request upon successful repair of the problem.

Customer service maintenance automation

A variable length string matcher uses absolute addressing of a history buffer; the longest matching string is determined by an associative content addressable memory.

Variable length string matcher

A variable length string matcher finds the longest string in a stored sequence of data elements (e.g., in a history buffer) that matches a string in a given sequence of data elements. The matcher includes circuitry that operates iteratively to compare data elements of the strings and determine the longest matching string based on when an iteration does not result in issuance of a match signal. In another aspect, the history buffer is an associative content addressable memory (CAM), and the string matcher uses absolute addressing of the CAM to determine the longest matching string.

Associative cam apparatus and method for variable length string matching

Growing community of inventors

Freehold, NJ, United States of America

Brian T Hou