# US 10,320,606 B2 · Server connection method and system of a network

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 10,320,606 B2
- Document ID: US10320606B2
- Status: Granted
- Kind: B2
- Application number: 15/014,184
- Filed: 2016-02-03
- Published: 2016-06-16
- Granted: 2019-06-11
- Earliest claimed: 2013-08-09
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Wentao Bao; Binzhang Fu; Mingyu Chen; Lixin Zhang
- Web page: https://patentgrep.com/patent/US10320606B2

## CPC

- H04L 12/42: Loop networks
- H04L 12/44: Star or tree networks
- H04L 12/462: {LAN interconnection over a bridge based backbone}
- H04L 41/0803: Configuration setting
- H04L 41/142: using statistical or mathematical methods
- H04L 41/145: {involving simulating, designing, planning or modelling of a network}
- H04L 43/045: for graphical visualisation of monitoring data
- H04L 45/02: Topology update or discovery
- H04L 41/0823: characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability (for optimising operational conditions of wireless networks H04W24/02)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A server connection method and system, which relates to the field of communications technologies, such that servers of a same specification are used to implement an optimal network, thereby reducing complexity of routing implementation which includes, providing ten servers, where each server includes five nodes, and the five nodes of each server are connected head-to-tail in series in a same connection manner, and connecting five nodes of any server in five of the ten servers to five nodes of each of the remaining five servers in a one-to-one correspondence manner, in order to form an optimal network of a Hoffman-Singleton graph.

## Claims

### Claim 1

A server connection method, comprising:
providing a plurality of servers, each server comprising five nodes, each node of the five nodes comprising two internal connection ports and five external connection ports;
coupling head-to-tail in series, with a processor based on a first network topology, a first five nodes of a selected server using the internal connection ports;
mapping and converting, with the processor, a second network topology of a server of a second five servers to the first network topology when the second network topology differs from the first network topology; and
coupling, with the processor based on the first network topology, the first five nodes of the selected server of a first five servers to second five nodes of each of the second five servers using the external connection ports to provide a Hoffman-Singleton graph with the first network topology that reduces complexity of routing information through the servers.

### Claim 2 (depends on 1)

The server connection method of claim 1, wherein the head-to-tail coupling is a ring connection topology.

### Claim 3 (depends on 2)

The server connection method of claim 2, wherein the servers comprises ten servers, coupling the first five nodes of the selected server to the second five nodes of each of the second five servers to provide the Hoffman-Singleton graph with the first network topology comprising coupling a node x in the selected server whose number is j to another node y in another server whose number is k, a value range of j being one to nine, a value range of k being zero to eight, one of j and k being an odd number and an even number, value ranges of x and y being zero to four according to a connection formula y, the connection formula y being y=((x+[j/2]×[k/2])×3)mod 5 when j is the even number and k is the odd number, and the connection formula y being y=(2×i−6×[j/2]×[k/2])mod 5 when j is the odd number and k is the even number.

### Claim 4 (depends on 3)

The server connection method of claim 3, wherein coupling the first five nodes of the selected server to the second five nodes of each of the second five servers to provide the Hoffman-Singleton graph with the first network topology further comprises coupling, in a connection manner in ascending order of numbers of the plurality of servers, a current server whose number is j to another server whose number is k and which is before the current server whose number is j until connection of ten servers is completed.

### Claim 5

A server connection method, comprising:
providing a plurality of servers, each server comprising ten nodes, each node of the ten nodes comprising three internal connection ports and four external connection ports, the ten nodes of the each server being coupled in a first network topology using the internal connection ports to form a same Petersen graph, the Petersen graph comprising five nodes in an inner cycle and five nodes in an outer cycle, the Petersen graph being a Moore graph with a diameter of two and a node degree of three;
mapping and converting, with a processor, a second network topology of a server in the servers to the first network topology when the second network topology differs from the first network topology; and
coupling, with the processor based on the first network topology, a first five nodes in an inner cycle of a selected server to second five nodes in an outer cycle of the other servers using the external connection ports to provide a network of a Hoffman-Singleton graph comprising the first network topology that reduces complexity of routing information through the servers.

### Claim 6 (depends on 5)

The server connection method of claim 5, wherein the servers comprise five servers, numbers of the five servers being zero to four successively, among the ten nodes of the each server, numbers i of the five nodes in the outer cycle being zero to four successively, and numbers of the five nodes in the inner cycle being five to nine successively, a node i being coupled to a node i+5, and coupling the first five nodes in the inner cycle of the selected server to the second five nodes in the outer cycle to provide the network of the Hoffman-Singleton graph with the first network topology comprising:
coupling, a node x in the outer cycle in a first server whose number is j to a node y in the inner cycle of a second server whose number is k, according to a first connection formula, y=(x+(j−k)×k)mod 5+5, j>k; and
coupling, a node x in the inner cycle in the first server whose number is j to a node y in the outer cycle of the second server whose number is k, according to a second connection formula, y=(x−5−(k−j)×j)mod 5, and j>k.

### Claim 7 (depends on 6)

The server connection method of claim 6, wherein coupling, the first five nodes in the inner cycle of the selected server to the second five nodes in the outer cycle of the each server further comprises coupling, a current server to all servers before the current server according to the first connection formula and the second connection formula in ascending order of numbers of the servers, until connection of the five servers is completed.

### Claim 8

A system for a server connection, comprising:
a processor; and
a plurality of servers that are configured to be coupled together in a network of a Hoffman-Singleton graph using the processor, each server comprising five nodes, each node of the five nodes comprising two internal connection ports and five external connection ports, the processor being configured to:
couple head-to-tail in series, in a first network topology, a first five nodes of a selected server using the internal connection ports;
map and convert a second network topology of a server in a second five servers to the first network topology when the second network topology differs from the first network topology; and
couple the first five nodes of the selected server of a first five servers to second five nodes of each of the second five servers using the external connection ports to provide the Hoffman-Singleton graph with the first network topology that reduces complexity of routing information through the servers.

### Claim 9 (depends on 8)

The system of claim 8, wherein the head-to-tail coupling is a ring connection topology.

### Claim 10 (depends on 9)

The system of claim 9, wherein the servers comprises ten servers, the processor being further configured to couple a node x in the selected server whose number is j to another node y in another server whose number is k, a value range of j being one to nine, a value range of k being zero to eight, wherein one of j and k being an odd number and an even number, value ranges of x and y being zero to four, according to a connection formula, the connection formula being y=((x+[j/2]×[k/2])×3)mod 5 when j is the even number and k is the odd number, and the connection formula being y=(2×i−6×[j/2]×[k/2])mod 5 when j is the odd number and k is the even number.

### Claim 11 (depends on 10)

The system of claim 10, wherein the processor is further configured to couple, in a connection manner in ascending order of numbers of the servers, a current server whose number is j to another server whose number is k and which is before the current server whose number is j, until connection of the ten servers is completed.

### Claim 12

A system for a server connection, comprising:
a processor; and
a plurality of servers that are configured to be coupled together in a network of a Hoffman-Singleton graph using the processor, each server comprising ten nodes, each node of the ten nodes comprising three internal connection ports and four external connection ports, the processor being configured to:
couple ten nodes of the each server in a first network topology using the internal connection ports to form a same Petersen graph, the Petersen graph comprising five nodes in an inner cycle and five nodes in an outer cycle, the Petersen graph being a Moore graph with a diameter of two and a node degree of three;
map and convert a second network topology of a server in the servers to the first network topology when the second network topology differs from the first network topology; and
couple a first five nodes in an inner cycle of a selected server to second five nodes in an outer cycle of the other servers using the external connection ports to provide the Hoffman-Singleton graph comprising the first network topology that reduces complexity of routing information through the servers.

### Claim 13 (depends on 12)

The system of claim 12, wherein the servers comprise five servers, numbers of the five servers being zero to four successively, among the ten nodes of the each server, numbers i of the five nodes in the outer cycle being zero to four successively, and numbers of the five nodes in the inner cycle being five to nine successively, a node whose number is i being coupled to a node i+5, and the processor is further configured to:
couple, a node x in the outer cycle that is in a first server whose number is j to a node y in the inner cycle that is in a second server whose number is k, according to a first connection formula, y=(x+(j−k)×k)mod 5+5, wherein j>k; and
couple, a node x in the inner cycle that is in the first server whose number is j to a node y in the outer cycle that is in the second server whose number is k, according to a second connection formula, y=(x−5−(k−j)×j)mod 5, wherein j>k.

### Claim 14 (depends on 13)

The system of claim 13, wherein the processor is further configured to couple, a current server to all servers before the current server according to the first connection formula and the second connection formula in ascending order of numbers of the servers, until connection of the five servers is completed.