EP0339809A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
An asynchronous time division network
Assignee: Telent Technologies Services Ltd
•
Filing: 1989-04-03
•
Granted: —
•
Expires: 2009-04-03
Abstract
Abstract The asynchronous time division network transmits data by way of high rate bearers. The data is divided into fixed length packets. The network comprises a switching matrix having a number of input and output ports arranged in columns. Each data packet is routed from an input port to a defined output port via addressed switching nodes. Each node has a queueing means, and each queueing means of each output column is tested and priority is given to the first queueing means tested which holds more than one packet.
Inventors
- 👤 John Spencer Arnold
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-08 16:20
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L49/00; H04L49/10; H04L49/104; H04L49/105; H04L49/106; H04L49/15; H04L49/1553; H04L49/1576; H04L2012/5638; H04L2012/5646; H04L2012/5651; H04L2012/5678; H04L2012/5681
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
109 words
An asynchronous time division network in which data is divided into fixed length packets which are transmitted by way of high rate bearers, the network comprising a switching matrix having a plurality of input ports and a plurality of output ports, arranged in columns, and means is provided for routeing each data packet from an input port to a defined output port by way of a plurality of individually addressed switching nodes, each node being provided with queueing means, and each queueing means in each output column of the switching matrix is tested whereby priority is given to the first queueing means tested which holds more than one packet.
Claim 2
Dependent Claim
109 words
An asynchronous time division network in which data is divided into fixed length packets which are transmitted by way of high rate bearers, the network comprising a switching matrix having a plurality of input ports and a plurality of output ports, arranged in columns, and means is provided for routeing each data packet from an input port to a defined output port by way of a plurality of individually addressed switching nodes, each node being provided with queueing means, and each queueing means in each output column of the switching matrix is tested whereby priority is given to the first queueing means tested which holds more than one packet.
Claim 3
Dependent Claim
41 words
An asynchronous time division network as claimed in Claim I, wherein a translator at each input port is arranged to translate a label appended to an incoming packet of data, into a new label appended to the outgoing packet of data.
Claim 4
Dependent Claim
27 words
An asynchronous time division network as claimed in Claim 2, wherein the translator generates routeing digits in the form of an address accepted by successive switching stages.
Claim 5
Dependent Claim
46 words
An asynchronous time division network as claimed in Claim 3, wherein the translator is arranged to select one of three switch planes and connections to the planes are made by way of respective output logic circuits and respective switch input queue and queue full, logic circuits.
Claim 6
Dependent Claim
36 words
An asynchronous time division network as claimed in Claim 4, wherein data received from the switching planes is passed to the respective output port by way of a contention logic circuit and speedmatch first-in first-out store.
Claim 7
Dependent Claim
42 words
An asynchronous time division network as claimed in Claim 1 or 5 wherein each queueing means is provided with a status indicator which is polled and priority given to a queue having more than one packet of data or a full queue.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.