US4774706A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Packet handling communications network
Assignee: British Telecommunications PLC
•
Filing: 1986-10-29
•
Granted: 1988-09-27
•
Expires: 2006-10-29
Abstract
Abstract A communications network has a packet assembler/disassembler (PAD) 25 accessed from one or more nodes 21. Short delay limits can be met by creating composite packets at the nodes; these carry information for more than one call. Composite packets are transmitted to the PAD, disassembled and reassembled into composite packets each addressed to a single destination node. A call is allocated one or more octets at a given location in packets having a given connection number. Octets are handled by the PAD according to the connection number of their packet and their location in the packet.
Inventors
- 👤 John L. Adams
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 21:26
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/64; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5638; H04L2012/5646; H04L2012/5652
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
114 words
A communications network comprising: a plurality of nodes, each adapted to transmit and receive packets of information and at least one packet assembler and disassembler, wherein each of said nodes is adapted to assemble composite packets comprising information for calls for one or more destination nodes and to send the packets via the network to the packet assembler and disassembler and wherein the packet assembler and disassembler is adapted (a) to disassemble the composite packets without requiring packets to be received thereat in a predetermined order, (b) to reassemble information into composite packets of information for respective single nodes, and (c) to release those packets for transmission over the network to their destination nodes.
Claim 2
Dependent Claim
114 words
A communications network comprising: a plurality of nodes, each adapted to transmit and receive packets of information and at least one packet assembler and disassembler, wherein each of said nodes is adapted to assemble composite packets comprising information for calls for one or more destination nodes and to send the packets via the network to the packet assembler and disassembler and wherein the packet assembler and disassembler is adapted (a) to disassemble the composite packets without requiring packets to be received thereat in a predetermined order, (b) to reassemble information into composite packets of information for respective single nodes, and (c) to release those packets for transmission over the network to their destination nodes.
Claim 3
Dependent Claim
38 words
A communications network as claimed in claim 1, wherein restrictions are placed on the right of said nodes to transmit such that all nodes have the opportunity to transmit at least one packet in a fixed maximum period.
Claim 4
Dependent Claim
73 words
A network as claimed in claim 1 or claim 2, wherein each composite packet has a packet identifier and information for a call is assembled in a sequence of composite packets all having the same identifier and in the same location in each packet in the sequence, wherein the packet assembler and disassembler processes packets according to their identifiers, the information in the packets being handled according to its location in the packets.
Claim 5
Dependent Claim
42 words
A network as claimed in claim 3, wherein the packet assembler and disassembler comprises disassembly means and assembly means, and storage means to hold data on packet identifiers and the location of call information in a composite packet having a particular identifier.
Claim 6
Dependent Claim
24 words
A network as claimed in claim 4, wherein the packet assembler and disassembler is adapted to process a plurality of composite packets in parallel.
Claim 7
Dependent Claim
25 words
A network as claimed in claim 5, wherein the packet assembler and disassembler comprises a plurality of said disassembly means, assembly means and storage means.
Claim 8
Dependent Claim
44 words
A network as claimed in claim 1 or 2, wherein the packet assembler and disassembler can store information for an interval which is at least the maximum time likely to be taken for a packet from a node to gain access to the network.
Claim 9
Dependent Claim
17 words
A network as claimed in claim 1 or 2, having a plurality of packet assembler and disassemblers.
Claim 10
Dependent Claim
48 words
A network as claimed in claim 1 or 2, wherein at least some nodes are adapted to assemble composite packets to be sent to a packet assembler and disassembler and also to assemble packets of information for a single call addressed to the destination node for that call.
Claim 11
Dependent Claim
27 words
A network as claimed in claim 1 or 2, wherein at least some of said composite packets comprise information for two or more types of time-sensitive service.
Claim 12
Independent Claim
71 words
A method of transmitting information between interconnected nodes in a communications network, comprising assembling at a node composite packets of information for calls for one or more nodes and sending the packets to a packet assembler and disassembler, via a network which may variably delay each packet, disassembling the information and reassembling in composite packets of information for a single node, and transmitting those packets via the network to their destinations.
Claim 13
Independent Claim
71 words
A method of transmitting information between interconnected nodes in a communications network, comprising assembling at a node composite packets of information for calls for one or more nodes and sending the packets to a packet assembler and disassembler, via a network which may variably delay each packet, disassembling the information and reassembling in composite packets of information for a single node, and transmitting those packets via the network to their destinations.
Claim 14
Dependent Claim
74 words
A method as claimed in claim 11, wherein information for a call between two nodes is sent from the originating node in a sequence of composite packets all having an identifier and at a location in each packet which is the same for all packets in the sequence, and in the packet assembler and disassembler the packets are processed according to their identifier and information is handled according to its location in the packets.
Claim 15
Dependent Claim
82 words
A packet assembler and disassembler for processing packets of information transmitted from nodes in a communications network, comprising: input means for receiving composite packets containing information for calls for one or more destination nodes, disassembly means for disassembling the packets without requiring packets to be received thereat in a predetermined order, re-assembly means for re-assembing the information into packets containing information for a single destination node, and output means for releasing packets for transmission via the network to their respective destination nodes.
Claim 16
Dependent Claim
82 words
A packet assembler and disassembler for processing packets of information transmitted from nodes in a communications network, comprising: input means for receiving composite packets containing information for calls for one or more destination nodes, disassembly means for disassembling the packets without requiring packets to be received thereat in a predetermined order, re-assembly means for re-assembing the information into packets containing information for a single destination node, and output means for releasing packets for transmission via the network to their respective destination nodes.
Claim 17
Dependent Claim
65 words
a multi-node digital communications network comprising: means for assembling digital information destined for different destination nodes into a composite packet and for sending such composite packet via said network to a predetermined node; means associated with said predetermined node for receiving said composite packets and reassembling said digital information into packets destined for single destination nodes and for transmitting such reassembled packets onto said network.
Claim 18
Dependent Claim
65 words
a multi-node digital communications network comprising: means for assembling digital information destined for different destination nodes into a composite packet and for sending such composite packet via said network to a predetermined node; means associated with said predetermined node for receiving said composite packets and reassembling said digital information into packets destined for single destination nodes and for transmitting such reassembled packets onto said network.
Claim 19
Independent Claim
64 words
A method of communicating on a multi-node digital communications network, said method comprising: assembling digital information destined for different destination nodes into a composite packet; sending said composite packet via said network to a predetermined node; reassembling, via said predetermined node, said digital information into packets destined for single destination nodes; and sending said reassembled packets to said single destination nodes via said network.
Claim 20
Independent Claim
64 words
A method of communicating on a multi-node digital communications network, said method comprising: assembling digital information destined for different destination nodes into a composite packet; sending said composite packet via said network to a predetermined node; reassembling, via said predetermined node, said digital information into packets destined for single destination nodes; and sending said reassembled packets to said single destination nodes via said network.
References Cited (Backward Citations)
US4375097A
Cited
US4408323A
Cited
GB2113953A
Cited
EP0119105A2
Cited
US4569041A
Cited
US4577314A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-09-27 | 1992-03-28 | 1992-09-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-09-27 | 1996-03-28 | 1996-09-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-09-27 | 2000-03-28 | 2000-09-27 | $7700.00 | Window Closed / Lapsed |