EP0169017A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Method for controlling information transfer

Assignee: AT&T Inc

•

Filing: 1985-07-08

•

Granted: —

•

Expires: 2005-07-08

📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Service to a plurality of channels (13, 15, 17, Fig. 1) served by packet switches (28, Fig. 3) at nodes (10, 110, Fig. 1) interconnected through a common carrier facility (11, Fig. 2) is achieved by controlling the quantity of data sent from any one channel to another. When data arrives at a node from a channel, address (62, Fig. 6) is entered in line in the first of two channel address queues (102, 104, Fig. 10) and the data is entered in a separate data queue. Each channel address is read from the first queue, a predetermined number of data bytes is read from the corresponding data queue (92, 94, 96, Fig. 9) and sent in a frame (Fig. 13) to a distant node. Thereafter, the channel address is entered at the end of the second, lower priority queue. The frame may have data bytes from other first queue channels but the frame length is limited either by a predetermined number of bytes or when no more channel addresses remain in the first queue. When no channel addresses remain in the first queue, a new frame is started by reading a channel address from the lower priority second queue. A frame may have data from a data queue corresponding to a channel address in the second queue followed by data from a data queue corresponding to a channel in the higher priority first queue.

Inventors

👤 Guy Gregory Riddle

Bibliographic Details

Application Number —

Jurisdiction EP

Data Source google_patents

Last Synchronized 2026-10-25 13:17

CPC Classifications

H; H04; H04L; H04L47/00; H04L47/10; H04L47/30; H04L47/36; H04L47/43

Claims Analysis

Total Claims: 11

Claim 1

Independent Claim 71 words

A method for controlling the transfer of a plurality of data bytes from each of a plurality of channels served by one node to channels served by another node said method CHARACTERIZED BY entering the address of each of said channels demanding service in the order of the arrival of said information in a first queue, and storing said information corresponding to each of said channels in a separate data queue.

Claim 2

Independent Claim 71 words

Claim 3

Dependent Claim 41 words

The method of claim 1 further CHARACTERIZED BY reading a first address of said channels from said first queue, and reading said data bytes, one byte at a time, from a data queue corresponding to said first address of said channels.

Claim 4

Dependent Claim 83 words

The method of claim 2 further CHARACTERIZED BY forming a frame for transmitting said information from said one node to said another node, and forming a plurality of chunks, one at a time, for transmitting said data bytes corresponding to each address of said channels in a separate chunk, each of said chunks including, when necessary, control bytes to effect control of said nodes, said control bytes being distinguished from said information bytes by including a special byte adjacent to said control byte.

Claim 5

Dependent Claim 104 words

The method of claim 3 further CHARACTERIZED BY limiting the length of a chunk according to a predetermined first limit comprising a plurality of said data and said control bytes, said chunk including an address of one of said channels and the number of bytes in said chunk, and further limiting the length of said chunk by a second limit comprising a predetermined number of said special bytes, and ending said chunk when either all of said data bytes corresponding to said address of said channel have been read from said data queue or one of said first or second limits has been reached.

Claim 6

Dependent Claim 65 words

The method of claim 4 further CHARACTERIZED BY limiting the length of a frame according to a predetermined third limit, said third limit being a predetermined number of said data, said control bytes and a plurality of overhead bytes comprising the length of the chunk and the channel number, and ending said frame when said third limit is reached or when all queues are empty.

Claim 7

Dependent Claim 51 words

The method of claim 5 further CHARACTERIZED BY entering said address of said channel at the end of the line in a lower priority, second queue, either after said first limit or said second limit is reached or after all of said data bytes have been read from said data queue.

Claim 8

Dependent Claim 50 words

The method of claim 6 further CHARACTERIZED BY reading an address of one of said channels from said second queue when no addresses of said channels remain in said first queue, and reading one data byte at a time corresponding to said address of said channel from said data queue.

Claim 9

Dependent Claim 141 words

The method of claim 7 further CHARACTERIZED BY forming a frame for transmitting said information from said one node to said another node, forming a chunk of said data bytes corresponding to said address of said channel read from said second queue, the length of said chunk being determined by a fourth limit of said control bytes and said data bytes, or by said second limit of special bytes, each of said chunks including said address of said channel and the number of said data bytes and said control bytes in said chunk, entering said address of said channel being served, when there remain data bytes at the end of all other channel numbers in said second queue, and ending said chunk when said fourth limit has been reached or when there remain no further data bytes in said data queue.

Claim 10

Dependent Claim 43 words

The method of claim 8 further CHARACTERIZED BY ending said frame when a fifth limit comprising a predetermined number of said control bytes and said data bytes has been reached or when no further addresses remain in either said first or second queues.

Claim 11

Dependent Claim 25 words

The method of claim 9 further CHARACTERIZED BY limiting said information corresponding to each of said channels which may be stored in said data queues.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag

Select Category

Notes (Optional)