EP0234618A1
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Network of data processing stations
Assignee: Koninklijke Philips NV
•
Filing: 1987-01-26
•
Granted: —
•
Expires: 2007-01-26
Abstract
Abstract A description is given of a data processing network that is constructed as a product network of two or more factor networks. At least one of the factor networks is a chordal ring of at least five stations, or a generalised chordal ring. A generalised chordal ring is formed by dividing each of the stations in a chordal ring (124, 130, 136) into a number of sub-stations. The sub-station within a station constitute a homogeneous network. The external connections of a station are divided over the relevant sub-stations. In this way an optimum value for the degree (G) and diameter (D) of the network can be chosen on the basis of a selection strategy.
Inventors
- 👤 Robert Andrianus Hendrik Van Twist
- 👤 Franciscus Petrus Maria Hopmans
- 👤 Eddy Albert Maria Odijk
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-08 18:30
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17337; G06F15/17343
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
212 words
Data processing network, comprising a first set of data processing stations, which each station is connected by respective lines to a maximum of G other stations, in which G, the degree of the network, has at least the value of four, in order to exchange information between the stations via the said lines, in which the shortest connection path between two arbitrarily selected stations is composed of a maximum of D lines and in which D is the diameter of the network, characterised in that the data processing network is constructed as a product network of at least two factor networks, and in that at least one factor network is constructed as a chordal ring, that is, a ring of stations in which all the stations are connected to the two immediately neighbouring stations and, in addition, to two further stations which are a same step size of at least two, but smaller than the number of stations in the ring divided by two, apart from the original station, in that all the connecting lines operate bi-directionally, in that the number of stations is a least 32, in that all the factor networks comprise at least two stations and in that at least one said chordal ring comprises at least five stations.
Claim 2
Dependent Claim
212 words
Data processing network, comprising a first set of data processing stations, which each station is connected by respective lines to a maximum of G other stations, in which G, the degree of the network, has at least the value of four, in order to exchange information between the stations via the said lines, in which the shortest connection path between two arbitrarily selected stations is composed of a maximum of D lines and in which D is the diameter of the network, characterised in that the data processing network is constructed as a product network of at least two factor networks, and in that at least one factor network is constructed as a chordal ring, that is, a ring of stations in which all the stations are connected to the two immediately neighbouring stations and, in addition, to two further stations which are a same step size of at least two, but smaller than the number of stations in the ring divided by two, apart from the original station, in that all the connecting lines operate bi-directionally, in that the number of stations is a least 32, in that all the factor networks comprise at least two stations and in that at least one said chordal ring comprises at least five stations.
Claim 3
Dependent Claim
36 words
Data processing network according to claim 1, characterised in that within at least one said chordal ring all the stations are connected to a further station in a homogeneous manner by means of a third chord.
Claim 4
Dependent Claim
28 words
Data processing network according to claim 1 or 2, characterised in that it comprises at least one second factor network that is also constructed as a chordal ring.
Claim 5
Dependent Claim
29 words
Data processing network according to claim 1, 2 or 3, characterised in that it comprises at least one further factor network that is constructed as a fully connected network.
Claim 6
Dependent Claim
36 words
Data processing network according to one of the claims 1 to 4 inclusive, characterised in that it comprises at least one other factor network that is built up as a ring of at least four stations.
Claim 7
Dependent Claim
53 words
Data processing network according to one of the claims 1 to 5 inclusive, characterised in that within at least one said chordal ring each station consists of P sub-stations which are interconnected and in that each sub-station is connected to sub-stations within the same station and further sub-stations by R>2 lines each time.
Claim 8
Dependent Claim
55 words
Data processing network according to claim 6, characterised in that within the factor network of the said at least one chordal ring P=2 and R=3, as a result of which the degree of the network is reduced by one with respect to the degree of the product network without the division into the said sub-stations.
References Cited (Backward Citations)
GB2064839A
Cited
FR2482746A1
Cited
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.