Method of information transmission with priority scheme in a time-division multiplex communication system comprising a loop line

• US 3,985,962 A
• Filed: 08/12/1974
• Issued: 10/12/1976
• Est. Priority Date: 08/13/1971
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Wild, Daniel, Mueller, Hans R., Zafiropulo, Pitro A., Jones, Ivor
• Primary Examiner(s): Olms, Douglas W.
• Application Number:
  US05/496,500
• Time in Patent Office: 792 Days
• Field of Search: 179/15 AL, 179/15 AP, 444/1
• US Class Current: 370/455
• CPC Class Codes: H04L 12/43 with synchronous transmission, e.g. time division multiplex [TDM], slotted rings
• CPC Class Codes: H04L 5/22 using time-division multiplexing
• CPC Class Codes: H04Q 11/04 for time-division multiplexing H04Q11/0001 takes precedence

Abstract

A closed loop communication system in which the terminals are grouped into priority classes. Any terminal can seize a free channel if certain priority conditions exist. A channel (frame) is always preceded by a header comprising a priority request field and a priority grant field. The request field has n bits assigned to the n priority classes; a terminal requiring service sets that bit to "1" which corresponds to its class. Thus, the controller receives a compiled overall request and inserts, for the next cycle, into the grant field an indication as to which priority class or classes are now allowed access to the channel. This is accomplished by shifting the contents of the request field to the grant field. A terminal can only seize the channel if its priority class is allowed for that cycle by the grant field, and if the channel is still free.

Claims

1. A method of information transmission with a priority scheme in a time-division multiplex communication system comprising a loop to which a plurality of terminals of different priority classes and at least one supervisory unit are attached, said method comprising the steps of:

transferring information on said loop by cyclically consecutive frames, each frame including a group of control characters;

said control characters comprising at least two fields for priority assignment, one of the fields serving as request field for the insertion of channel requests by attached terminals, discernable by priority class, and one other field serving as a grant field for characterizing which priority class may occupy the transmission channel represented by the corresponding frame;

formulating the contents of the grant field at said supervisory unit from the contents of a request field previously transmitted over the loop; and

determining at each terminal, if that terminal has requested channel allocation during the preceding cycle and if the grant field of the frame in the current cycle does not contain an identification of a class with higher priority than that of the respective terminal, or if the grant field of the frame in the current cycle does not contain any priority class identification and if so, seizing the frame of the current cycle for information transmission.

2. The method as defined in claim 1 wherein the request field of any frame has one bit position provided for each priority class, said method further comprising the step of:

setting the priority class bit corresponding to the terminal requiring channel allocation, said bit corresponding to the terminal priority class.

3. The method as defined in claim 2 wherein the request field and the grant field are equal in size to each other, said step of determining the contents of the grant field further including the step of:

transferring the contents of the request field unaltered to the grant field under the control of the supervisory unit.

4. The method as defined in claim 1 further comprising the steps of:

examining the contents of a received request field at said supervisory unit;

determining the highest priority class having requested channel allocation;

inserting a coded character assigned to this class as priority key into the grant field.

5. The method as defined in claim 1 further comprising the step of:

repeating the insertion of channel allocation requests into the request fields of subsequent frames until said terminal can seize a frame when said terminal has made a previous channel allocation request which has not been serviced.

6. The method as defined in claim 1 further comprising the step of:

releasing a channel and making a new channel allocation request at said terminal when it is determined that said grant field contains the identification having a higher priority class than said terminal.