Advanced priority statistical multiplexer

• US 5,757,801 A
• Filed: 11/02/1994
• Issued: 05/26/1998
• Est. Priority Date: 04/19/1994
• Status: Expired due to Term

• Current Assignee: Multi-Tech Systems Incorporated
• Original Assignee: Multi-Tech Systems Incorporated
• Inventors: Arimilli, Harinarayana
• Primary Examiner(s): TON, DANG T
• Application Number:
  US08/333,365
• Time in Patent Office: 1,301 Days
• Field of Search: 370/74, 370/68.1, 370/80, 370/81, 370/84, 370/110.1, 370/94.1, 370/112, 370/60, 370/94.2, 370/85.7, 370/60.1, 370/85.6, 370/95.1, 370/85.13, 370/61, 370/94.3 , 370/232, 370/353, 370/356, 370/358, 370/359, 370/362, 370/389, 370/391, 370/392, 370/395, 370/396, 370/397, 370/403, 370/404, 370/489, 370/471, 370/538, 370/540 , 370/541, 370/537, 370/535, 370/536, 370/542-545, 370/905, 370/902, 370/908, 370/911, 370/916, 370/444, 370/455, 340/825.5, 340/825.51, 340/825.52, 379/88, 379/93, 379/94, 379/95, 379/96, 379/97, 379/399, 379/413, 379/201, 395/200, 395/425, 395/400, 395/200.01, 395/823, 395/842, 381/36, 381/41
• US Class Current: 370/444
• CPC Class Codes: H04J 3/1688 the demands of the users being taken into account after redundancy removal, e.g. by predictive coding, by variable sampling reducing bandwidth of signals in general H04B1/66; in PCM-systems H04B14/046; removal of redundancy in telegraph communication H03M7/30
• CPC Class Codes: H04J 3/247 ATM or packet multiplexing
• CPC Class Codes: H04L 2012/6427 Subscriber Access Module; Concentrator; Group equipment
• CPC Class Codes: H04L 2012/6459 Multiplexing, e.g. TDMA, CDMA
• CPC Class Codes: H04L 2012/6462 Movable boundaries in packets or frames
• CPC Class Codes: H04L 2012/6464 Priority
• CPC Class Codes: H04L 2012/6486 Signalling Protocols
• CPC Class Codes: H04L 2012/6494 Silence suppression
• CPC Class Codes: H04L 9/40 Network security protocols
• CPC Class Codes: H04M 1/253 Telephone sets using digital voice transmission
• CPC Class Codes: H04M 11/064 Data transmission during pauses in telephone conversation
• CPC Class Codes: H04N 1/00281 with a telecommunication apparatus, e.g. a switched network of teleprinters for the distribution of text-based information, a selective call terminal details of transmission H04N1/00095; establishing a communication with one of a facsimile machine or another apparatus sharing a single line H04N1/32704; interfacing cordless telephone terminals with an accessory to increase the functionality of user interface H04M1/72409
• CPC Class Codes: H04N 1/00302 with a telephonic apparatus, e.g. telephone answering machine or videotex terminal H04N1/00307 takes precedence; telephonic communication H04M
• CPC Class Codes: H04N 1/00312 with a digital transmission apparatus, e.g. a switched network of teleprinters for the distribution of text-based information, SMS or ISDN device transmitting or receiving via a computer, e.g. using e-mail, a computer network or the internet H04N1/00214; transmission of digital information H04L
• CPC Class Codes: Y10S 370/916 Multiplexer/demultiplexer

Abstract

A data multiplexing network is described which multiplexes a plurality of asynchronous data channels with an asynchronous data stream representing compressed voice signals and/or facsimile signals onto a single synchronous data packet stream. The single synchronous data packet stream is then transmitted by a high speed statistical multiplexer over a composite link to a second site using a modified high-level synchronous data link control protocol with an overlay of an advanced priority statistical multiplexing algorithm. The asynchronous data channels and the compressed voice channel and/or facsimile signals are demultiplexed and reconstructed for sending to other asynchronous computer terminals and to a standard telephone or facsimile analog port at the second site, respectively. PBX trunk interfaces are also provided to allow PBXs to share the composite link between sites. Communication between the first site by voice or facsimile and the second site is transparent to the users. The multiplexer efficiently allocated the bandwidth of the composite link by detecting silence periods in the voice signals and suppressing the sending of the voice information to preserve bandwidth. An advanced priority statistical multiplexer is also described which dynamically allocates composite link bandwidth to both time-sensitive and non-time-sensitive data to maximizes data throughout efficiency and quality while simultaneously reducing multiplexer processing overhead.

Claims

1. A method for multiplexing high priority data and low priority data for transmission over a communications link, the communications link having a bit rate, the communications link transferring bytes, each byte having Y bits, and the communications link having a byte transfer period equal to Y divided by the bit rate, the method comprising the steps of:

a. determining a high priority packet time;

b. determining a maximum number of bytes transferred across the communications link in the high priority packet time by dividing the high priority packet time by the byte transfer period;

c. determining a worst case number of high priority data bytes transferred over the communications link in the high priority packet time;

d. subtracting the worst case number of high priority data bytes of step c from the maximum number of bytes of step b to obtain an interrupt boundary byte count; and

e. multiplexing high priority data bytes and low priority data bytes, wherein the step of multiplexing includes the steps of;

1) if there are one or more of the high priority data bytes to be transferred across the link, transmitting the one or more of the high priority data bytes, concluding with a final high priority data byte;

2) if there are one or more of the low priority data bytes to be transferred across the link, transmitting up to K bytes of the one or more of the low priority data bytes, where K does not exceed the interrupt boundary byte count;

3) waiting V byte transfer periods, wherein V equals the interrupt boundary byte count minus K; and

4) returning to step

     1).

2. The method of claim 1 wherein the step of transmitting the one or more of the high priority data bytes comprises the step of transmitting voice data.

3. The method of claim 1 wherein the step of transmitting the one or more of the high priority data bytes comprises the step of transmitting facsimile data.

4. The method of claim 1 wherein the step of transmitting the one or more of the high priority data bytes comprises the step of transmitting video data.

5. The method of claim 1 wherein the step of transmitting up to K bytes of the one or more of the low priority data bytes comprises the step of transmitting asynchronous digital data.

6. A method for transmitting high priority data and low priority data over a communications link in a hybrid data frame having a frame length equal to F_n bytes, the communications link having a bit rate, the communications link transferring bytes, each byte having Y bits, and the communications link having a byte transfer period equal to Y divided by the bit rate, the method comprising the steps of:

a. determining a high priority packet time;

b. determining a maximum number of bytes transferred across the communications link in the high priority packet time by dividing the high priority packet time by the byte transfer period;

c. determining a worst case number of high priority data bytes transferred across the communications link in the high priority packet time;

d. subtracting the worst case number of high priority data bytes from the maximum number of bytes to obtain an interrupt boundary byte count; and

e. transmitting high priority data bytes and low priority data bytes, including the steps of;

1) setting a frame length count equal to the frame length;

2) transmitting header information;

3) if there are one or more of the high priority data bytes to be transferred across the link, transmitting the one or more of the high priority data bytes, concluding with a final high priority data byte, and decrementing the frame length count for each high priority data byte transmitted;

4) if there are one or more of the low priority data bytes to be transferred across the link, transmitting up to K bytes of the one or more of the low priority data bytes, where K does not exceed the interrupt boundary byte count, and decrementing the frame length count K times;

5) waiting V byte transfer periods, wherein V equals the interrupt boundary byte count minus K; and

6) repeating steps

     3) ,

     4) and

     5) until the frame length count is equal to zero.

7. The method of claim 6, wherein the step of transmitting high priority data bytes and low priority data bytes further comprises the step of transmitting error correction codes.

8. The method of claim 6, wherein the step of transmitting the one or more of the high priority data bytes firther comprises the step of transmitting a high priority data identification byte, and wherein the step of transmitting up to K bytes of the one or more of the low priority data bytes further comprises the step of transmitting a low priority data identification byte.

9. A method for demultiplexing frames of packetized high priority data and low priority data, the low priority data packed into a hybrid frame in interrupt boundary byte count (IBBC) increments, the method comprising the steps of:

a. determining a frame length, wherein F_n equals the frame length of the hybrid frame;

b. setting a frame length counter equal to F_n ;

c. reading an identification byte;

d. decoding the identification byte to determine whether high priority data or low priority data is being received;

e. if low priority data bytes are being received, reading Y of the low priority data bytes and subtracting Y from the frame length counter, where Y is not greater than the interrupt boundary byte count;

f. if high priority data is being received;

1. determining a length X of the high priority data; and

2. reading X bytes of the high priority data; and

g. if the frame length counter is a positive, nonzero number, continuing to demultiplex at step c.

10. The method of claim 9 wherein the step of determining a frame length includes reading frame header information containing the frame length.

11. The method of claim 9 wherein the step of determining a frame length includes referring to a lookup table to obtain the frame length.

12. The method of claim 9 wherein the step of determining a length of the high priority data includes reading header information in the identification byte of the high priority data.

13. The method of claim 9 wherein the step of determining a length of the high priority data includes referring to a lookup table to obtain a high priority data frame length.

14. A method for multiplexing high priority data, intermediate priority data, and low priority data for transmission across a communications link, the link having a maximum bandwidth with a byte transfer period equal to an amount of time needed to transfer one byte of data over the communications link, the method comprising the steps of:

a. determining a high priority packet time;

b. determining a maximum number of bytes transferred in the high priority packet time;

c. determining a worst case number of high priority data bytes transferred in the high priority packet time;

d. subtracting the worst case number of high priority bytes from the maximum number of bytes to obtain an interrupt boundary byte count;

e. storing the high priority data in a first memory, the intermediate priority data in a second memory, and the low priority data in a third memory; and

f. multiplexing the high priority data, the intermediate priority data, and the low priority data, wherein the step of multiplexing includes the steps of;

1. if there is high priority data, transmitting the high priority data, including a final high priority data byte;

2. transmitting a number of bytes of the intermediate priority data and the low priority data, wherein the number of bytes equals J bytes, and wherein J is not greater than the interrupt boundary byte count;

3. waiting N byte transfer periods, wherein N equals the interrupt boundary byte count minus J; and

4. returning to step 1.

15. The method of claim 14 wherein step 2 further includes the step of transmitting all intermediate priority data bytes prior to transmitting low priority data bytes.

16. The method of claim 14 wherein step 2 further includes the step of transmitting a number of intermediate priority data bytes prior to transmitting low priority data bytes where the number is equal to X, wherein X is not greater than the interrupt boundary byte count.

17. The method of claim 14 wherein the step of storing includes the steps of storing digital voice data in the first memory, storing synchronous digital data in the second memory, and asynchronous digital data in the third memory.