Browse Prior Art Database

ALGORITHM FOR DESCRIBING COLLECTED PACKET/FRAME FORMAT DATA

IP.com Disclosure Number: IPCOM000006246D
Original Publication Date: 1991-Jul-01
Included in the Prior Art Database: 2001-Dec-18
Document File: 2 page(s) / 95K

Publishing Venue

Motorola

Related People

Joe Kruft: AUTHOR [+2]

Abstract

An algorithm is needed to describe, in no more description byte for every collected data byte for opti- than one description byte for every one collected data mum memory utilization and real-time efficiency. byte, collected data bytes from a packet/frame data structure. Since only one description byte is available for every collected data byte, an algorithm is needed to The packet/frame data structure is defined as any include all of the necessary information in the descrip- data structure with the following attributes: tion byte. Figure 2 illustrates this algorithm.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 50% of the total text.

Page 1 of 2

0 M

MOTOROLA INC. Technical Developments Volume 13 July 1991

ALGORITHM FOR DESCRIBING COLLECTED

PACKET/FRAME FORMAT DATA

by Joe Kruft and James J. Berken

  An algorithm is needed to describe, in no more description byte for every collected data byte for opti- than one description byte for every one collected data mum memory utilization and real-time efficiency. byte, collected data bytes from a packet/frame data
structure. Since only one description byte is available for every collected data byte, an algorithm is needed to The packet/frame data structure is defined as any include all of the necessary information in the descrip- data structure with the following attributes: tion byte. Figure 2 illustrates this algorithm.

1. The structure can contain any number of frames.

  2. Frames occupy non-overlapping byte positions of the structure. Hence, every byte position of the structure is in exactly one frame.

  3. A frame is defined as a structure that can have up to 16384 bytes and may contain any number of packets.

4. A packet is defined as data occupying consecu- tive byte positions within a frame.

5. Packets can not overlap each other.
6. Each packet must contain at least hvo bytes of data.

Figure 1 diagram illustrates the form of the packet/frame data structure.

  If a computer or other device collects data con- tained in a packet/frame data structure as described above, an algorithm is needed to describe the collected data. This collected data includes data contained in packets and frame start markers. This description includes the following.

1. Is this byte a frame start marker?
2. Is this byte the first byte of a packet?
3. At what byte position in the frame is this packet located?

  4. What signals where active at the time that this byte was collected. If this data structure is coming across a bus, the state of misc. bus signals at the time of collection may be recorded.

This description must use no more than one

  The algorithm involves combining each collected da...