Communications internetwork system connecting a client node array to a resource array

• US 5,515,510 A
• Filed: 01/14/1994
• Issued: 05/07/1996
• Est. Priority Date: 01/14/1994
• Status: Expired due to Term

• Current Assignee: PDACO LIMITED
• Original Assignee: Consilium Overseas Limited
• Inventors: Kikinis, Dan
• Primary Examiner(s): Kim, Ken S.
• Application Number:
  US08/182,282
• Time in Patent Office: 844 Days
• Field of Search: 370/94.3, 395/200, 395/325, 395/200.02, 395/200.15
• US Class Current: 709/203
• CPC Class Codes: G06F 13/4004 Coupling between buses
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/42 Centralised routing
• CPC Class Codes: H04L 65/1101 Session protocols
• CPC Class Codes: H04L 65/612 for unicast
• CPC Class Codes: H04L 67/01 Protocols
• CPC Class Codes: H04L 9/40 Network security protocols
• CPC Class Codes: H04N 21/21 Server components or server architectures
• CPC Class Codes: H04N 21/23 Processing of content or additional data; Elementary server operations; Server middleware
• CPC Class Codes: H04N 7/17336 Handling of requests in head-ends

Abstract

An interconnection topography for microprocessor-based communication nodes consists of opposite arrays of client nodes and resource nodes, with each client node connected to one resource node by a data transfer link, each resource node connected to a resource trunk by a data transfer link, and each node connected to just four neighboring nodes by data transfer links. Communication nodes in the topography are microprocessor controlled, and comprise random access memory and data routing circuitry interfaced to the data transfer links. In one aspect resource nodes are provided with a map of the interconnection topography for use in routing data. In another aspect, individual ones of the communication nodes are programmed as servers for receiving client requests and scheduling routing of resource data.

Claims

1. A communication internetwork comprising:

a client array of communication nodes each connectable by data transfer link to one or more client stations; and

a resource array of communication nodes opposite the client array and having the same number of nodes as the client array, each resource node connectable by data transfer link to one or more resources;

wherein each node in each array is connected by data transfer link to just one node in the opposite array, and to exactly four nodes in the same array.

2. An internetwork as in claim 1 wherein every communication node comprises a microprocessor and an electronic random access memory, and wherein every data transfer link at each node is coupled to the microprocessor and the memory at that node.

3. An internetwork as in claim 2 wherein each communication node comprises data routing circuitry operable by the microprocessor and interfaced to the data transfer links.

4. An internetwork as in claim 1 wherein the data transfer links between nodes are parallel buses.

5. An internetwork as in claim 1 wherein the data transfer links between nodes are serial links.

6. An internetwork as in claim 1 wherein the communication nodes are implemented as single integrated circuit (IC) chips or chip sets mounted on printed circuit boards, and the data transfer links between nodes are parallel buses on and between the printed circuit boards.

7. An internetwork as in claim 1 wherein the random access memory at each individual node comprises a topology map and an identifier for placing the individual node in the topography.

8. An internetwork as in claim 7 wherein one or more of the communication nodes are configured as addressable routing managers, for receiving client requests and locating and scheduling data transfers from resources to client stages.

9. An internetwork as in claim 8 wherein one or more of the communication nodes are configured as account managers, for tracking and recording data transactions from resources to clients.

10. An internetwork as in claim 6 wherein the printed circuit boards and data transfer links between nodes are housed in an enclosure, and connections to client stations and resource nodes are implemented as connectors through walls of the enclosure, there being one connector per node.

11. A communication internetwork as in claim 1 wherein all the nodes in each array and all of the data transfer links between nodes are implemented on a single application-specific integrated circuit.

12. A method for routing data between resources and client stations comprising steps of:

connecting client stations in a plurality of individual client networks;

connecting each individual client network to a data interface at a client communication node comprising a microprocessor, data routing circuitry, and a random access memory, the client communication nodes forming a client array of communication nodes;

forming a resource array of resource communication nodes having the same number of resource nodes as client nodes in the client array, each resource node comprising a microprocessor, data routing circuitry, and a random access memory;

connecting each client node to exactly four other client nodes by data transfer links and to just one resource communication node by a data transfer link; and

connecting each resource node to exactly four other resource nodes by data transfer links and to just one resource trunk leading to addressable resources by a data transfer link.

13. The method of claim 12 wherein one or more of the communication nodes is configured as a routing manager, and wherein the one or more routing managers receive routing requests from client stations and route data through the networks based on real time busy status of data links between nodes.