Data transfer network

• US 20060268910A1
• Filed: 05/26/2006
• Published: 11/30/2006
• Est. Priority Date: 05/26/2005
• Status: Active Grant

• Current Assignee: OKI Electric Industry Company Limited
• Original Assignee: OKI Electric Industry Company Limited
• Inventors: Kawahara, Masato, Okayama, Hideaki
• Granted Patent: US 7,684,328 B2
• Time in Patent Office: Days
• US Class Current: 370/406
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/14 Routing performance; Theoretical aspects

Abstract

The present invention provides a data transfer network receiving a higher evaluation overall than conventional ones from various perspectives such as the number of effective nodes, the required number of links, and the required maximum node capacity. The present invention is a data transfer network of a hyper configuration in which each node is an element of m (m is 2 or more) different local networks. Further, at least one of the local networks to which the respective nodes belong is a hub network and, when a node belongs to a local network other than a hub network, the local network is a full mesh network.

Claims

1. A data transfer network of a hyper structure in which each node is an element of m (m is 2 or more) different local networks,

wherein at least one local network of the respective nodes is a hub network;

and

local networks other than the hub network are full mesh networks.

2. The data transfer network according to claim 1,

wherein the respective nodes are functionally disposed in a matrix shape and

the local network of each row and each column is a hub network.

3. The data transfer network according to claim 2,

wherein a core node of the hub network of each row is connected to the core nodes of the hub networks of all the columns, and

the core node of the hub network of each column is connected to the core nodes of the hub networks of all the rows.

4. The data transfer network according to claim 1,

wherein the respective nodes are functionally disposed in a matrix shape,

the local network of each row is a hub network, and

the local network of each column is a full mesh network.