Stochastic time division multiplexing

• US 4,700,341 A
• Filed: 10/30/1985
• Issued: 10/13/1987
• Est. Priority Date: 10/30/1985
• Status: Expired due to Term

• Current Assignee: Racal-Datacom, Inc. (Thales SA)
• Original Assignee: Racal Data Communications Incorporated
• Inventors: Huang, Zheng F.
• Primary Examiner(s): Olms, Douglas W.
• Application Number:
  US06/793,051
• Time in Patent Office: 713 Days
• Field of Search: 370/80, 370/81, 370/82, 370/94, 370/91
• US Class Current: 370/471
• CPC Class Codes: H04J 3/1682 Allocation of channels according to the instantaneous demands of the users, e.g. concentrated multiplexers, statistical multiplexers

Abstract

Stochastic Time Division Multiplexing (STOTDM) is disclosed. in STOTDM data packets are preceded by a flag word. Each data packet appears in a frame of data packets in a predetermined order. If there is no data to be placed in the packet location, only the flag is transmitted and the data location is allocated to other data. By using a fixed length frame, synchronous data packets can be placed near the beginning of the frame and packets which are not timing sensitive may follow them. A variable length frame may also be used wherein data from a plurality of sources are once again ordered and preceded by a flag word or bit. The flag may be used to indicate whether or not the packet location is filled or this may be determined by control packets. Variable length frames may be accommodated as long as the average bandwidth required to transmit the data does not exceed the channel bandwidth.

Claims

1. A method of multiplexing a plurality of N data packets selected from M possible data packets where M>

N, comprising the steps of;

arranging M possible data packet locations and M flag words into a frame, each flag word being identical to the other flag words, each flag word and each packet location being associated with a predetermined one of said M possible packets so that each said flag word is also associated with a predetermined one of said packet locations, and each said flag word preceding its associated packet location;

filling N of said M packet location with said N packets so that each of said N packets fills its associated packet location leaving (M-N) unfilled packet locations in said frame; and

omitting each of said (M-N) unfilled packet location so that no packet location is reserved for packets not included in said N packet locations associated with said N packets.

2. A method of demultiplexing a frame of STOTDM multiplexed data packets, wherein said frame includes a plurality of sequentially arranged flags, each of which may precede one of said packets or may precede the next successive flag in the absence of a packet, the method comprising the ordered steps of:

(a) locating a first flag within said frame;

(b) determining, by inspection of information following said first flag, if said first flag is followed by a second flag or a first packet; and

(c) routing said first packet if it follows said first flag.

3. The method of claim 2, further comprising the steps of:

detecting a word associated said first flag; and

comparing said word with a stored word to verify synchronization.

4. The method of claim 2, further comprising the steps of:

(d) determining if said second flag is followed by a third flag or a second packet; and

(e) routing said second packet if it follows said second flag.

5. A method of demultiplexing a frame of STOTDM multiplexed data packets, wherein said frame includes a plurality of identical sequentially arranged flags, each of which may precede one of said packets or may precede the next successive flag in the absence of a packet, the method comprising the ordered steps of:

(a) locating a first flag within said frame;

(b) looking for a second flag after said first flag;

(c) routing a first packet if said second flag is not found in step (b); and

(d) looking for said second flag after said first packet is routed if said second flag is not found in step (b).

6. A method of demultiplexing a frame of STOTDM multiplexed data packets, wherein said frame includes a plurality of identical sequentially arranged flags, each of which may precede one of said packets or may precede the next successive flag in the absence of a packet, the method comprising the ordered steps of:

(a) reading a first flag and determining by inspecting information following said first flag whether or not a first packet follows said first flag;

(b) reading a second flag after step (a) if said first packet does not follow said first flag; and

(c) routing said first packet after step (a) if said first packet does follow said first flag.

7. An apparatus for demultiplexing a stochastic time division multiplexed frame of data packets, comprising:

detecting means for detecting a predetermined flag pattern within said frame of data packets;

counting means for counting the number of flag patterns detected by said detecting means; and

routing means, responsive to said counting means, for routing a data packet in accordance with said number of flag patterns.

8. The apparatus of claim 7, further comprising:

framing means for detecting the first flag pattern in said frame; and

means responsive to said detecting means for resetting said counting means.

9. The apparatus of claim 7, further comprising:

masking means for inhibiting said detecting means during a portion of said data packets so that data packets may include said flag pattern within their data without causing said counting means to count.

10. The apparatus of claim 7, further including means for reading a word associated with said flag and for comparing said word with the number of flag patterns detected by said detecting means for verifying synchronization.

11. The apparatus of claim 7, wherein said frame is a fixed length so that a first flag pattern reoccurs periodically.

12. The apparatus of claim 7, wherein said frame has a variable length.

13. The apparatus of claim 7, further comprising:

comparing means for comparing the number of said flag patterns detected by said detecting means with a count in said frame; and

error detecting means for producing an error signal in response to said comparing means if said count and said number do not agree.

14. The apparatus of claim 11 wherein said frame includes an idle pattern at the end of said frame to fill in the frame until time for the next recurring flag pattern.