Synchronous protocol data formatter

• US 5,029,163 A
• Filed: 03/18/1988
• Issued: 07/02/1991
• Est. Priority Date: 03/18/1988
• Status: Expired due to Term

• Current Assignee: American Telephone & Telegraph Company (AT&T, Inc.), Bell Telephone Laboratories, Inc. (Nokia Corporation)
• Original Assignee: AT&T, Inc.
• Inventors: Peshkin, Joel D., King, Robert W., Wilson, Ralph A. III, Chao, Phillip C. J., Choe, Bong S., Hiller, Thomas L., Fairfield, Robert C.
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): Chin, Wellington
• Application Number:
  US07/169,687
• Time in Patent Office: 1,201 Days
• Field of Search: 370/94, 370/95, 370/80, 370/79, 370/94.1, 370/94.2, 370/94.3, 370/95.1, 370/95.3
• US Class Current: 370/458
• CPC Class Codes: H04J 3/1647 Subrate or multislot multiplexing
• CPC Class Codes: H04Q 11/0464 Primary rate access circuits

Abstract

A synchronous protocol data formatter handles all 24-32 channels of a so-called primary rate version of a digital multiplexed interface or ISDN Primary Rates Interface for a communication system. The formatter relieves the host computer of the local area network of some highly specialized tasks, and, at the same time, provides the following augmented capabilities, which exceed those required by the C.C.I.T.T. standard, I.431:

1. dynamic channel bandwidth allocation can assign arbitrary (even non-adjacent) time slots to create a super channel;

2. a circular interrupt-queue in a shared memory enables the formatter and the host computer of the local area network to interact efficiently in updating and responding to changing conditions; and

3. cyclical redundancy codes can be used on a more flexible basis than theretofore, e.g., can be generated upon only address and control fields for digitized voice signals, or, in a relay mode, can substitute an existing cyclical redundancy code to guard against memory errors.

Claims

1. A synchronous formatter for a data network interface of the type having means for allocating communication channel bandwidth to one or more applied messages through the allocation of time slots and means for performing protocol functions for the Integrated Service Digital Network (ISDN) Primary Rate Standard,

characterized in that

the means for allocating channel bandwidth includes means for allocating a plurality of time slots to each of said one or more messages without regard to adjacency of said plurality of time slots for use repetitively to communicate a message.

2. A synchronous formatter for a data network interface of the type having means for allocating communication bandwidth to one or more applied messages through the allocation of time slots and means for performing protocol functions,

characterized in that

the means for performing protocol functions includes means for calculating cyclical redundancy codes based on the content of said messages, said means for calculating comprising means for calculating said codes based on less than the entire content of said messages.

3. A synchronous formatter of the type claimed in claim 2,

further characterized in that

the means for calculating includes means for excluding any voice signal content of said messages in calculating said cyclical redundancy codes.

4. A synchronous formatter for a data network interface of the type having means for allocating communication bandwidth through the allocation of time slots and means for performing cyclical redundancy code checking on received data,

further characterized by

means for suppressing cyclical redundancy code checking and for transmitting the received cyclical redundancy code as received.

5. In combination, a host computer, a memory and a synchronous formatter for a data network interface of the type having means for allocating communication bandwidth through the allocation of time slots and means for performing protocol functions,

characterized in that

the means for performing protocol functions includes means for sharing said memory without conflict with said host computer, means for establishing a circular queue of items for the attention of the host computer, and means for issuing an attention signal to the host computer after each access of the shared memory by the formatter, when the attention of the host computer is likely to be required.

6. A synchronous formatter of the type claimed in claim 5,

further characterized by

means in said formatter including means for directing said host computer to an item requiring attention when said host computer failed to respond to a prior attention signal temporarily;

and means for constraining the host computer to access items in the queue in the order in which they were entered there.