Patent US1276256A successfully refreshed from Google Patents.
Patent US4583219A successfully refreshed from Google Patents.
US4583219A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Trunk for packet switching
Assignee: Nokia Bell Labs
•
Filing: 1984-07-16
•
Granted: 1986-04-15
•
Expires: 2004-07-16
Abstract
Abstract Fair and fast service to a plurality of channels served by packet switches at nodes interconnected through a common carrier facility is achieved by controlling the quantity of data sent from any one channel to another. When data arrives at a node from a channel, the channel address is entered in line in the first of two channel address queues 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 and sent in a frame 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 G. Riddle
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 13:06
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10; H04L47/30; H04L47/36; H04L47/43
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
97 words
A method for controlling the quantity of information comprising a plurality of data bytes to be transferred from each of a plurality of channels served by one node to channels served by another node, each of said channels at each of said nodes having an address, said method comprising the steps of disassembling the information received at a node, 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
97 words
A method for controlling the quantity of information comprising a plurality of data bytes to be transferred from each of a plurality of channels served by one node to channels served by another node, each of said channels at each of said nodes having an address, said method comprising the steps of disassembling the information received at a node, 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 3
Dependent Claim
22 words
The method of claim 1 further comprising the steps of reading a first address of said channels from said first queue, and
Claim 4
Dependent Claim
21 words
reading said data bytes, one byte at a time, from a data queue corresponding to said first address of said channels.
Claim 5
Dependent Claim
21 words
reading said data bytes, one byte at a time, from a data queue corresponding to said first address of said channels.
Claim 6
Dependent Claim
92 words
The method of claim 2 further comprising the steps of starting the formation of a frame for transmitting said information from said one node to said another node, and starting the formation of 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, at determinable events, 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 7
Dependent Claim
112 words
The method of claim 3 further comprising the steps of limiting the length of a chunk according to a predetermined first limit said 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 said 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 has been read from said data queue or one of said first or second limits has been reached.
Claim 8
Dependent Claim
67 words
The method of claim 4 further comprising the steps of 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 9
Dependent Claim
53 words
The method of claim 5 further comprising the step of 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 10
Dependent Claim
52 words
The method of claim 6 further comprising the steps of 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 11
Dependent Claim
149 words
The method of claim 7 further comprising the steps of starting the formation of a frame for transmitting said information from said one node to said another node, starting the formation of 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 12
Dependent Claim
45 words
The method of claim 8 further comprising the step of 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 13
Dependent Claim
27 words
The method of claim 9 further comprising the step of limiting said information corresponding to each of said channels which may be stored in said data queues.
Claim 14
Independent Claim
123 words
A method for transmitting information from one location to another location, each of said locations serving a plurality of users' equipment, each of said equipment having an address, said method comprising the steps of disassembling the information received from said equipment and storing said information as bytes from each of said equipment in a separate data queue, storing the address of said equipment in a separate first channel queue, reading an address from said first queue, reading a predetermined plurality of said information bytes from the data queue corresponding to the address read from said first queue, sending said information bytes in a frame from said one location to said other location, and entering said address at the end of said first queue.
Claim 15
Independent Claim
123 words
A method for transmitting information from one location to another location, each of said locations serving a plurality of users' equipment, each of said equipment having an address, said method comprising the steps of disassembling the information received from said equipment and storing said information as bytes from each of said equipment in a separate data queue, storing the address of said equipment in a separate first channel queue, reading an address from said first queue, reading a predetermined plurality of said information bytes from the data queue corresponding to the address read from said first queue, sending said information bytes in a frame from said one location to said other location, and entering said address at the end of said first queue.
Claim 16
Dependent Claim
86 words
The method of claim 11 further comprising the step of forming said frame by including a plurality of chunks, each of said chunks comprising a plurality of said information bytes and a plurality of control bytes to effect control functions at said locations, said control bytes being distinguished from said information bytes by preceding each of said control bytes with a special byte, each of said chunks further comprising the address of said equipment associated with said bytes and the length of the chunk in bytes.
Claim 17
Independent Claim
156 words
A method for transmitting packets between two packet switch nodes over a telecommunications common carrier facility, each of said nodes serving a plurality of users' equipment over separate channels and each of said nodes being served by a trunk, said method comprising the steps of receiving said packets from one of said nodes and disassembling each of said packets into a plurality of data bytes and a channel address byte, storing said channel address byte in a higher priority, first queue and storing said data bytes in a data queue, reading a channel address byte from said first queue, reading a predetermined plurality of data bytes from said data queues, and entering said channel byte at the end of the line in lower priority, second queue, forming a frame comprising a plurality of chunks, each of said chunks comprising a predetermined number of said bytes, and transmitting said frame from said trunk to a distant node.
Claim 18
Independent Claim
156 words
A method for transmitting packets between two packet switch nodes over a telecommunications common carrier facility, each of said nodes serving a plurality of users' equipment over separate channels and each of said nodes being served by a trunk, said method comprising the steps of receiving said packets from one of said nodes and disassembling each of said packets into a plurality of data bytes and a channel address byte, storing said channel address byte in a higher priority, first queue and storing said data bytes in a data queue, reading a channel address byte from said first queue, reading a predetermined plurality of data bytes from said data queues, and entering said channel byte at the end of the line in lower priority, second queue, forming a frame comprising a plurality of chunks, each of said chunks comprising a predetermined number of said bytes, and transmitting said frame from said trunk to a distant node.
Claim 19
Dependent Claim
23 words
The method of claim 13 wherein said chunk is formed by placing the length of said chunk at the end of said chunk.
Claim 20
Dependent Claim
46 words
The method of claim 13 further comprising the steps of receiving said frame at a trunk at said distant node, disassembling said frame and said chunks into a plurality of data bytes, forming packets of said data bytes, and sending said packets to a destination channel.
References Cited (Backward Citations)
US4317195A
Cited
US4399531A
Cited
US4475192A
Cited
US4443875A
Cited
US4488288A
Cited
US4499576A
Cited
US4484326A
Cited
US4516238A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-04-14 | 1989-10-14 | 1990-04-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-04-14 | 1993-10-14 | 1994-04-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-04-14 | 1997-10-14 | 1998-04-15 | $7700.00 | Window Closed / Lapsed |