[go: up one dir, main page]

WO2016078071A1 - Système de communication, nœud de commande et procédé de communication - Google Patents

Système de communication, nœud de commande et procédé de communication Download PDF

Info

Publication number
WO2016078071A1
WO2016078071A1 PCT/CN2014/091847 CN2014091847W WO2016078071A1 WO 2016078071 A1 WO2016078071 A1 WO 2016078071A1 CN 2014091847 W CN2014091847 W CN 2014091847W WO 2016078071 A1 WO2016078071 A1 WO 2016078071A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
cluster
data packet
control node
information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2014/091847
Other languages
English (en)
Chinese (zh)
Inventor
黄勤业
李扬
宋昆鹏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to PCT/CN2014/091847 priority Critical patent/WO2016078071A1/fr
Priority to CN201480037573.XA priority patent/CN105900383B/zh
Publication of WO2016078071A1 publication Critical patent/WO2016078071A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • Embodiments of the present invention relate to the field of communications and, more particularly, to communication systems, control nodes, and communication methods.
  • NoC Network-on-Chip
  • the route adaptation mechanism usually includes two parts: the first part calculates a plurality of optional routing paths between the source node and the destination node, and the second part selects one route from the multiple optional routing paths according to the network status information and the specific selection policy. path.
  • the routing policy in the prior art generally adopts a local area selection policy or a Neighbors on Path (NoP) policy. Specifically, taking the node (0, 0) shown in FIG. 1 as the source node and the node (3, 3) as the destination node as an example, the source node (0, 0) has two optional routing paths: the eastward direction Path and path to the south.
  • NoP Neighbors on Path
  • the source node (0, 0) In the local selection strategy, the source node (0, 0) only considers the state of the neighboring nodes when selecting the path, that is, only considers the state of the node (0, 1) and the node (1, 0). Since the node only considers the state of the possible next hop node when routing, congestion cannot be avoided at other nodes than the next hop node. In the NoP policy, the source node (0, 0) ignores the state of its neighbors (0, 1) and (1, 0) when selecting a path, and only considers the second hop node on the possible routing path. State, the state of nodes (0, 2) and (2, 0). The NoP strategy can avoid a deadlock at the corner in some scenarios, but since the NoP still only considers the state of some nodes and cannot balance the state of the whole network, the performance in the global scope is poor.
  • Embodiments of the present invention provide a communication system, a control node, and a communication method, which can improve overall performance of the system.
  • an embodiment of the present invention provides a communication system, including: a first node cluster and a second node cluster, where the first node cluster includes a first control node and at least one other node, and the second node cluster A second control node is included, wherein the first control node is not adjacent to the second control node; the first control node has a first transmission link with each of the at least one other node, The first transmission link is used to transmit state information of the node; the first control node and the second control node have a second transmission link, and the second transmission link is used to transmit state information of the node cluster.
  • the first transmission link is a wired transmission link
  • the second transmission link is a wireless transmission link
  • the first control node is configured to: receive each of the at least one other node sent by each of the other nodes on the corresponding first transmission link State information of other nodes; determining state information of the first node cluster according to state information of each of the other nodes; transmitting the number to the second control node on the second transmission link Status information of a node cluster.
  • the first control node is specifically configured to broadcast state information of the first node cluster on the second transmission link.
  • the status information includes a maximum cache occupancy rate BFM; the first control node is specifically configured to: the at least one other node and the first control node BFM The sum is determined as the BFM of the first node cluster.
  • each of the at least one other node is configured to: receive a status information reporting indication sent by the first control node, where the status information is reported Instructing each of the other nodes to send status information of each of the other nodes to the first control node; and transmitting status information of each of the other nodes to the first control node according to the status information reporting indication.
  • the first control node is further configured to: determine a third node cluster to which the destination node of the first data packet belongs, where the communication system further includes different a third node cluster of the first node cluster; determining a plurality of selectable routing paths of the first data packet from the first node cluster to the third node cluster, wherein each of the plurality of selectable routing paths
  • the optional routing path includes at least one node cluster; determining a target routing path from the plurality of optional routing paths according to state information of at least one node cluster included in each of the plurality of selectable routing paths .
  • the first data packet belongs to a first other node of the at least one other node; the first control node is further configured to determine the first data packet Before receiving the third node cluster to which the destination node belongs, receiving a path determination request sent by the first other node, where the path determination request is used to request the first control node to determine a routing path of the first data packet; the first control node Specifically, the third node cluster is determined according to the path determination request; the first control node is further configured to send the target to the first other node after determining the target routing path from the multiple optional routing paths. Routing path information.
  • the first other node is configured to: receive information about the target routing path sent by the first control node; add the target in the first data packet The information of the routing path; the first data packet of the information to which the target routing path is added is sent.
  • the first node cluster includes a forwarding node, the at least one other node includes the forwarding node, or the forwarding node is the first control node;
  • Receiving a second data packet where the second data packet carries information of a routing path of the second data packet, where information of the routing path includes information of at least one node cluster; and according to information about a routing path of the second data packet, Determining a next hop node cluster of the second data packet; determining, according to state information of the next hop node cluster of the second data packet and the plurality of neighboring nodes of the second other node, determining a next packet of the second data packet Jumping the node; sending the second data packet to the next hop node of the second data packet.
  • the at least one other node includes a second other node adjacent to the first control node; and between the first control node and the second other node There is also a third transmission link for transmitting data.
  • the at least one other node includes a third other node and a fourth other node adjacent to the third other node; the third other node and the There is a fourth transmission link between the fourth other nodes, and the fourth transmission link is used for transmitting data and status information of the node.
  • the first control node and the second control node have a wireless transceiver; any other node of the at least one other node does not have a wireless transceiver.
  • a control node including: a first transceiver unit, configured to receive status information of each of the other nodes sent by each of the at least one other node, where The first node cluster to which the control node belongs includes the at least one other node; the processing unit is configured to determine the first node cluster according to status information of each of the other nodes of the at least one other node received by the first transceiver unit The second transceiver unit is configured to send, to the second control node, status information of the first node cluster determined by the processing unit.
  • the second transceiver unit is specifically configured to broadcast state information of the first node cluster determined by the processing unit.
  • the second transceiver unit is further configured to: receive a token sent by the third control node, and send the first to the second control node according to the token State information of a node cluster; or the second transceiver unit is further configured to: after transmitting the state information of the first node cluster, send a token to the fourth control node, so that the fourth control node sends the token according to the token Status information of the node cluster to which the fourth control node belongs.
  • control node has a first wired transmission link with each of the other nodes
  • first transceiver unit is specifically configured to: Status information for each of the other nodes is received on a first wired transmission link with each of the other nodes.
  • the at least one other node includes a first other node adjacent to the control node, and the control node is different from the first other node. a second wired transmission link of the first wired transmission link; the first transceiver unit is further configured to send and receive data on the second wired transmission link.
  • the status information includes a maximum cache occupancy rate BFM, where the processing unit is specifically configured to determine the sum of the at least one other node and the BFM of the control node as the BFM of the first node cluster.
  • the first transceiver unit is further configured to: before receiving status information of each of the other nodes sent by each of the at least one other node, And transmitting, to each of the at least one other node, a status information reporting indication, the status information reporting indication for indicating that each of the other nodes sends its own status information.
  • the second transceiver unit is further configured to receive, by the second control node, status information of the second node cluster to which the second control node belongs;
  • the node further includes: a first storage unit, configured to store state information of the second node cluster received by the second transceiver unit.
  • the processing unit is further configured to: determine a third node cluster to which the destination node of the first data packet belongs; determine that the data packet is sent by the first node cluster a plurality of selectable routing paths of the third node cluster, wherein each of the plurality of selectable routing paths includes at least one node cluster; each optional route according to the plurality of selectable routing paths State information of at least one node cluster included in the path, and a target routing path is determined from the plurality of selectable routing paths.
  • the processing unit is specifically configured to: according to status information of at least one node cluster included in each optional routing path of the multiple optional routing paths, Determining the congestion status of each of the optional routing paths; determining the optional routing path with the least congestion in the plurality of optional routing paths as the target routing path.
  • the first data packet belongs to the control node, and the processing unit is further configured to add information of the target routing path to the first data packet;
  • a transceiver unit is further configured to send the first data packet to which the information of the target routing path is added.
  • the processing unit is further configured to acquire the control before the first transceiver unit sends the first data packet to which the information of the target routing path is added. State information of a plurality of neighboring nodes of the node, and determining a next hop node of the first data packet according to state information of the multiple neighboring nodes; the first transceiver unit is specifically configured to determine the The next hop node of the first data packet transmits the first data packet.
  • the processing unit is specifically configured to: determine, according to the status information of the multiple neighboring nodes, the uncongested state from the multiple neighboring nodes. At least one neighboring node; if the number of the at least one neighboring node is multiple, determining a next hop node cluster corresponding to the first node cluster in the target routing path, and the at least one neighboring node The next hop node cluster is determined to be the next hop node of the first data packet from the nearest neighbor node.
  • the first data packet belongs to a second other node of the at least one other node; the first transceiver unit is further configured to determine the first data Before receiving the third node cluster to which the destination node of the packet belongs, receiving a path determination request sent by the second other node, where the path determination request is used to request the control node to determine a routing path of the first data packet; the processing unit is specifically configured to: Determining, according to the path determination request received by the first transceiver unit, the third node cluster; the first transceiver unit is further configured to send the location to the second other node The information of the target routing path determined by the unit.
  • the path determining request carries information of the destination node of the first data packet;
  • the control node further includes: a second storage unit, configured to store the node and Corresponding relationship between the node clusters;
  • the processing unit is specifically configured to determine the third node cluster according to the information of the destination node and the correspondence between the node and the node cluster stored by the second storage unit.
  • the first transceiver unit is further configured to receive a second data packet, where the second data packet carries information about a routing path of the second data packet, where The information of the routing path of the second data packet includes information of the at least one node cluster; the processing unit is further configured to determine, according to the information of the routing path of the second data packet received by the first transceiver unit, the second data packet Determining a cluster of nodes, and determining a next hop node of the second data packet according to state information of a next hop node cluster of the second data packet and a plurality of neighboring nodes of the control node; the first transceiver unit further The second hop node for the second data packet determined by the processing unit transmits the second data packet.
  • a third aspect provides a communication method, including: a control node receiving status information of each of the other nodes sent by each of the at least one other node, wherein the first node cluster to which the control node belongs includes the At least one other node; determining state information of the first node cluster according to state information of each of the other nodes; and transmitting state information of the first node cluster to the second control node.
  • the sending the status information of the first node cluster to the second control node includes: broadcasting status information of the first node cluster.
  • the method before the sending, by the second control node, the status information of the first node cluster, the method further includes: receiving a token sent by the third control node;
  • the sending the status information of the first node cluster to the second control node includes: sending, according to the token, status information of the first node cluster to the second control node.
  • the status information includes a maximum cache occupancy rate BFM; and determining the first node cluster according to status information of each of the other nodes in the at least one other node.
  • the status information includes: determining a sum of BFM of the at least one other node and the control node as a BFM of the first node cluster.
  • the method before receiving, by each of the other nodes, the status information of each of the other nodes.
  • the method also includes transmitting a status information reporting indication to each of the at least one other node, the status information reporting indication for indicating that each of the other nodes transmits its own status information; the receiving at least one of the other nodes
  • the status information of each of the other nodes sent by the other nodes includes: receiving status information of each of the other nodes sent by each of the at least one other node according to the status information reporting indication.
  • the method further includes:
  • the method further includes: determining a third node cluster to which the destination node of the first data packet belongs; determining that the data packet is from the first node cluster to the first a plurality of optional routing paths of the three-node cluster, wherein each of the plurality of selectable routing paths includes at least one node cluster; according to each of the plurality of selectable routing paths The status information of the at least one node cluster is included, and the target routing path is determined from the plurality of optional routing paths.
  • the status information of the at least one node cluster included in each optional routing path of the multiple optional routing paths is selected from the multiple Determining a target routing path in the routing path, including: determining, according to state information of the at least one node cluster included in each of the plurality of optional routing paths, a congestion status of each optional routing path; An optional routing path with the least congestion in the multiple optional routing paths is determined as the target routing path.
  • the first data packet belongs to the control node; after the target routing path is determined from the multiple optional routing paths, the method further includes: Adding information of the target routing path to the first data packet; and transmitting the first data packet to which the information of the target routing path is added.
  • the method before the sending the first data packet to which the information of the target routing path is added, the method further includes: acquiring multiple neighbors of the control node Status information of the node; determining, according to the status information of the multiple neighboring nodes, a next hop node of the first data packet; sending the first data packet that adds information of the target routing path, including: to the first The next hop node of a data packet transmits the first data packet.
  • determining, according to the status information of the multiple neighboring nodes, determining a next hop node of the first data packet including: according to the multiple Determining the status information of the neighboring node, determining at least one neighboring node in the non-congested state from the plurality of neighboring nodes; if the number of the at least one neighboring node is multiple, determining the first in the target routing path a next hop node cluster corresponding to the node cluster, and determining a neighboring node that is closest to the next hop node cluster among the at least one neighboring node as a next hop node of the first data packet.
  • the method further includes: receiving a path determination request sent by the second other node, where the path determination request is used to request the control node to determine a routing path of the first data packet; determining the first data packet
  • the third node cluster to which the destination node belongs includes: determining the third node cluster according to the path determination request; after determining the target routing path from the multiple optional routing paths, the method further includes: Other nodes send information about the target routing path.
  • the path determining request carries the information of the destination node of the first data packet; determining the third node cluster according to the path determining request, including: Determining a correspondence between the node and the node cluster; determining the third node cluster according to the information of the destination node and the correspondence between the node and the node cluster.
  • the method further includes: receiving a second data packet, where the second data packet carries information about a routing path of the second data packet, and the second data packet The information of the routing path includes information of at least one node cluster; determining, according to information of the routing path of the second data packet, a next hop node cluster of the second data packet; and a next hop node cluster according to the second data packet And determining, by the status information of the multiple neighboring nodes of the control node, the next hop node of the second data packet; and sending the second data packet to the next hop node of the second data packet.
  • the communication system, the control node, and the communication method provided by the embodiment of the present invention include a first node cluster and a second node cluster, where the first control node and each of the other nodes in the first node cluster Having a first transmission link for transmitting state information of the node, and the first control node and the second control node not adjacent to the first control node have a state information for transmitting the cluster of nodes a second transmission link, such that the first control node can not only obtain the state information of each node included in the first node cluster, but also can obtain the state information of the second node cluster, thereby facilitating consideration of the selection of the output channel.
  • Local state information and global state information thereby avoiding the occurrence of congestion and improving the overall performance of the system.
  • FIG. 1 is a schematic diagram of a network architecture in the prior art.
  • FIG. 2 is a schematic diagram of a communication system according to an embodiment of the present invention.
  • FIG. 3 is a schematic diagram of an example of a communication system according to an embodiment of the present invention.
  • FIG. 4 is a schematic block diagram of a control node according to an embodiment of the present invention.
  • FIG. 5 is a schematic block diagram of another control node according to an embodiment of the present invention.
  • FIG. 6 is a schematic flowchart of a communication method according to an embodiment of the present invention.
  • an interconnection communication system of an on-chip network such as an on-chip network composed of a processor unit and a memory unit, but may also be applied to a non-chip.
  • the network is not limited in this embodiment of the present invention.
  • a node may be in one-to-one correspondence with a router. Therefore, the description of a node in the embodiment of the present invention is equally applicable to a router.
  • FIG. 2 shows a schematic diagram of a communication system 100 in accordance with an embodiment of the present invention.
  • the communication system 100 includes:
  • first node cluster 110 includes a first control node 111 and at least one other node
  • second node cluster 120 includes a second control node 121, wherein the first node
  • the control node 111 is not adjacent to the second control node 121;
  • the first control node 111 has a first transmission link L1 between each of the at least one other node, and the first transmission link L1 is used to transmit state information of the node;
  • a communication system includes a first node cluster and a second node cluster, wherein the first control node and each of the other nodes in the first node cluster have state information for the transmission node a first transmission link, and the second control link between the first control node and the second control node not adjacent to the first control node has a second transmission link for transmitting state information of the node cluster, such that the A control node can not only obtain state information of each node included in the first node cluster, but also can obtain state information of the second node cluster, thereby facilitating consideration of local state information and global state information when selecting an output channel. In turn, congestion is avoided and the overall performance of the system is improved.
  • the state information of a node is a granularity of a node, and is used to indicate the state of the node.
  • the state information of the node cluster is used to indicate the state of the node cluster, and the state information of the node cluster may be granular by the node cluster.
  • the state of a node cluster may be determined according to the state of some or all of the nodes included in the node cluster.
  • the first node cluster 110 can include the first control node 111 and at least one other node, wherein the at least one other node can include a node that is not adjacent to the first control node 111.
  • the first control node 111 can have a first transmission link with each of the other nodes of the at least one other node.
  • the first transmission link L1 may be a wired link or a wireless link.
  • Each of the at least one other node may transmit its own status information to the first control node 111 via the first transmission link L1 with the first control node 111.
  • the first control node 111 may receive status information of each of the other nodes transmitted by the other node of the at least one other node on the corresponding first transmission link L1, and store the at least one other node.
  • the state information of each of the other nodes is determined, and/or the state information of the first node cluster is determined according to the state information of the at least one other node, but the embodiment of the present invention is not limited thereto.
  • the first control node 111 is located at the center of the first node cluster 110.
  • the first control node 111 may also be located at other locations of the first node cluster 110. This is not limited.
  • the first node cluster 110 also includes at least one other node, and FIG. 2 exemplarily shows eight other nodes, namely nodes 112-119.
  • the first control node 111 not only has a first transmission link L1 (represented by a long dashed line) for transmitting state information of the node, respectively, between the nodes 115, 113, 116 and 118 adjacent to the first control node, Further, there is also a first transmission link L1 between the nodes 112, 114, 117 and 119 which are not adjacent to the first control node.
  • L1 represented by a long dashed line
  • the first control node 111 and a node (eg, node 112) not adjacent to the first control node may have only one transmission link, that is, the first transmission link.
  • the first transmission link between the first control node 111 and a node not adjacent to the first control node cannot transmit data, such that the first control node 111 and a node not adjacent to the first control node Data cannot be transferred directly between.
  • the first control node 111 and the node adjacent to the first control node may have one or more transmission links, which is not limited in this embodiment of the present invention.
  • the at least one other node includes a second other node adjacent to the first control node 111, where the first control node 111 and the second other node are further used.
  • a third transmission link for transmitting data may be provided.
  • the first control node 111 has four adjacent nodes, namely, node 115, node 116, node 113, and node 118.
  • the first control node 111 and each of the four neighboring nodes may also have a third transmission link (represented by a short dashed line) for transmitting data.
  • the third transmission link may be dedicated to transmitting data
  • the first transmission link L1 between the first control node 111 and the four neighboring nodes may be dedicated to transmitting state information of the node, and It may be further used to transmit a route related message, for example, a neighboring node sends a path determination request to the first control node 111 through the first transmission link L1.
  • the first transmission link between the first control node 111 and the at least one neighboring node of the first control node 111 and the first control node 111 are adjacent to the at least one
  • the third transmission link between the nodes is the same link, for example, the first transmission link between the first control node 111 and the second other node, and the first control node 111 and the second other node
  • the third transmission link between the two is a same link or a different link, which is not limited by the embodiment of the present invention.
  • the second node cluster 120 can include the second control node 121 and can optionally further include at least one second other node.
  • the number of nodes included in the second node cluster 120 may be the same as or different from the number of nodes included in the first node cluster.
  • the configuration of the second node cluster 120 may be the same as or different from the configuration of the first node cluster 110.
  • the second control node 121 and some or all of the second other nodes of the at least one second other node may also have a first transmission link for transmitting state information of the node, and the second control node
  • the status information of each of the at least one second other node is obtained by the first transmission link, but is not limited by the embodiment of the present invention.
  • first control node 111 and the second control node 121 are further configured to transmit A second transmission link L2 (indicated by a long-short dashed line) of the status information of the node cluster, wherein the first control node 111 and the second control node 121 may not be adjacent.
  • the first control node 111 may send the state information of the first node cluster to the second control node 121 through the second transmission link L2, and receive the second control node 121 to send the second control node 121.
  • Status information of the second node cluster may be a wired or wireless link, but the embodiment of the present invention is not limited thereto.
  • the first transmission link L1 is a wired transmission link
  • the second transmission link L2 is a wireless transmission link.
  • only the first control node may have a wireless transceiver among all the nodes included in the first node cluster, and similarly, the second control node may also have Wireless transceiver. Accordingly, the first control node 111 and the second control node 121 have a wireless transceiver; any other of the at least one other node does not have a wireless transceiver.
  • the at least one other node includes a third other node and a fourth other node adjacent to the third other node, where the third other node and the fourth other node are between There is a fourth transmission link for transmitting data and status information of the node.
  • the first node cluster 110 may include the first control node 111 and a plurality of other nodes, wherein any two adjacent nodes of the plurality of other nodes may have a fourth transmission link (in a short
  • the dashed line indicates that the fourth transmission link can be used to transmit data, and can also be used to transmit state information of the node, for example, congestion information of the node.
  • node 113 and node 112 and node 114 respectively have a fourth transmission link, and node 113 can transmit itself to the node 112 through a fourth transmission link with the node 112.
  • Status information and/or data packets may also receive status information and/or data packets of the node 112 sent by the node 112 through a fourth transmission link with the node 112, but the embodiment of the present invention is not limited thereto. .
  • the third other node and the fourth other node may also have two transmission links, where one transmission link is used to transmit status information of the node, and another transmission link is used. It is used to transmit data, but the embodiment of the present invention is not limited thereto.
  • the communication network 100 may further include other node clusters than the first node cluster 110 and the second node cluster 120, wherein FIG. 3 exemplarily shows the node cluster 130. -190, but the embodiment of the invention is not limited thereto.
  • the node cluster 130-190 can be configured with the first
  • the node clusters 110 are the same or different, which is not limited by the embodiment of the present invention.
  • the communication network 100 can include M nodes, and the M nodes are divided into L node clusters, wherein the L node clusters can include the first node cluster and the second node cluster.
  • Each of the M nodes belongs to only one node cluster, and each of the L node clusters includes one or more nodes, 1 ⁇ L ⁇ M.
  • the number of the nodes of the two node clusters may be equal or different, which is not limited in this embodiment of the present invention.
  • the communication system 100 includes 81 nodes, and the 81 nodes are divided into nine node clusters (110-190), and each of the nine node clusters includes nine nodes.
  • the nine node clusters may have the same configuration.
  • the second node cluster 120 includes a node (3, 0), a node (3, 1), a node (3, 2), a node (4, 1), and a node (4, 2).
  • One hop node of the side (S) or the north side (N) is adjacent, for example, the neighboring nodes of the node (4, 1) include: a node (3, 1), a node (5, 1), a node (4, 0) ) and nodes (4, 2).
  • adjacent clusters of nodes may represent clusters of nodes that physically or logically satisfy an adjacent relationship.
  • adjacent node clusters of the first node cluster 110 include: a second node cluster 120 and a node cluster 140.
  • the first node cluster 110 and the second node cluster 120 may not be adjacent to each other, which is not limited by the embodiment of the present invention.
  • the node clusters can be divided in various ways.
  • the network may be divided into L physical areas, where each physical area corresponds to one node cluster.
  • at least one node located in the physical area belongs to a node cluster corresponding to the physical area, but the present invention further
  • the node clusters may be divided according to other manners, which is not limited by the embodiment of the present invention.
  • each of the L node clusters may include one control node.
  • the control node in a node cluster may be a node at a specific location among the multiple nodes included in the node cluster, for example, the control node is a node in the node cluster at the center of all nodes; or
  • the control node is a node in the cluster of nodes having a specific function or including a specific device, for example, the control node is a node including a wireless transceiver among all the nodes included in the node cluster, and the like, This is not limited.
  • the first node cluster may include a plurality of other nodes.
  • the first control node and the at least one other node of the plurality of other nodes may respectively have a first transmission link, wherein the first transmission link is used to transmit state information of the node.
  • the first control node may acquire state information of each of the other nodes, and according to each of the other nodes Status information, the first control node may determine status information of the node cluster.
  • the first control node may receive status information of the node sent by each neighboring node on the corresponding first transmission link with each of the at least one neighboring node, where The status information sent by the second other node adjacent to the first control node may include status information of the second other node, or further include status information of the third other node, where the third other node and the first control node Not adjacent.
  • the first control node may send status information of the node received by the first control node to the neighboring node of the first control node, or aggregate the status information of the received node with the status information of the first control node. And transmitting status information of the aggregated node to the neighboring node of the first control node. In this way, the first control node can acquire state information of all other nodes in the first node cluster except the first control node.
  • the first control node can have a first transmission link with each of the plurality of other nodes. At this time, the first control node may have a first transmission link with other nodes not adjacent to the first control node. The first control node may receive status information of each of the other nodes sent by the other node of the plurality of other nodes on a transmission link with the first control node, but the embodiment of the present invention is not limited thereto. this.
  • the first control node 111 is configured to:
  • the status information may include congestion information, for example, a maximum buffer occupancy rate (BFM), a virtual channel occupancy rate, and the like.
  • BFM maximum buffer occupancy rate
  • the status information may also include other information, which is not limited by the embodiment of the present invention.
  • Each of the at least one other node may periodically or triggerably transmit its own status information to the first control node.
  • the first control node may send a status information reporting indication to each of the at least one other node, where the status information reporting indication is used to send status information to the first control node; correspondingly, the At least one other node
  • Each of the other nodes is configured to send status information of each of the other nodes to the first control node according to the status information reporting indication.
  • the status information includes a maximum cache occupancy rate BFM; correspondingly, the first control node is specifically configured to: determine a sum of the BFM of the at least one other node and the first control node as the first BFM of the node cluster.
  • the first control node may determine a sum of BFMs of all nodes included in the first node cluster 110 as a BFM of the first node cluster.
  • the first control node may also use the mathematical mean value or other function value of the BFM of all the nodes included in the first node cluster 110 as the BFM of the first node cluster 110, but Embodiments of the invention are not limited thereto.
  • the first control node may determine status information of the first node cluster according to status information of a part of the nodes included in the first node cluster. For example, the first control node may first determine whether a BFM of each node included in the first node cluster satisfies a preset condition, and according to at least one node of all nodes included in the first node cluster that meets the preset condition Determining, by the BFM, the BFM of the first node cluster, for example, the first control node may use a sum of BFMs of at least one node that meets the preset condition, or a mathematical average of BFMs of at least one node that meets the preset condition Or other function values, as the BFM of the first node cluster 110, but the embodiment of the present invention is not limited thereto.
  • the at least one node that satisfies the preset condition may include the first control node and/or at least one other node.
  • the preset condition may include at least one of the following conditions: the BFM value of the node itself is greater than a certain threshold, and the difference between the BFM value of the node and the BFM value of at least one other node other than the node in the node cluster is greater than a certain threshold.
  • the embodiment of the present invention does not limit this.
  • the first control node may periodically send the status information of the first node cluster, where the period value may be preset; or the first control node may also trigger the status information of the first node cluster. For example, when receiving the request for requesting the state information of the first node cluster sent by the second control node, the first control node sends the state information of the first node cluster to the second control node; or The first control node sends the state information of the first node cluster when receiving the token sent by the third control node, and after transmitting the state information of the first node cluster, sends the token to the second control node, so that The second control node sends the status information of the second node cluster according to the token, but the embodiment of the present invention does not limit this.
  • each of the (L-1) other node clusters other than the first node cluster 110 may include one control node, and the (L-1) Other
  • the control nodes included in each of the other node clusters in the node cluster may be referred to as other control nodes.
  • the first control node may have a second transmission link with at least one other control node of the (L-1) other control nodes, and the at least one other control node includes the second control node.
  • the second transmission link is configured to transmit state information of the node cluster.
  • the first control node may determine each of the other clusters of the (L-1) other node clusters by receiving state information of the node clusters sent by the at least one other control node on the corresponding second transmission link status information.
  • only the adjacent node clusters include a second transmission link between the control nodes.
  • the first control node may receive state information of a node cluster transmitted by each of the at least one other control node through a second transmission link with the first control node, wherein the at least one other control node A node cluster to which each other control node belongs is adjacent to the first node cluster, and the at least one other control node may include the second control node.
  • the state information of the node cluster sent by the second control node may include state information of the second node cluster, or further include state information of a third node cluster different from the second node cluster, where the third node cluster
  • the status information may be from the third control node, where the node cluster to which the third control node belongs may be adjacent to the second node cluster, and the node cluster to which the third control node belongs may be different from the first node cluster. Neighbor, but the embodiment of the invention is not limited thereto.
  • the first control node may send status information of the node cluster received by the first control node to the at least one other control node, for example, as shown in FIG.
  • the first control node (1, 1) may Transmitting, to the control node (4, 1), status information of the node cluster transmitted by the control node (1, 4) received by the first control node, and transmitting, to the control node (1, 4), the first control node Controls the status information of the node cluster sent by the node (4, 1).
  • the first control node may first aggregate the state information of the node cluster received by the first control node with the state information of the first node cluster, and into the other node clusters adjacent to the first node cluster. The control node sends the status information of the aggregated node cluster. In this way, the first control node can acquire state information of (L-1) other node clusters other than the first node cluster.
  • the communication system 100 includes a second transmission link between any two of the L control nodes.
  • the state information of the node cluster sent by a certain control node to other control nodes may include only the state information of the node cluster to which the certain control node belongs.
  • the first control node may receive the other of the (L-1) other control nodes that are sent by the other control node on the second transmission link with the first control node.
  • the state information of the node cluster, and the first control node may send the state information of the first node cluster to the (L-1) other control nodes, but the embodiment of the present invention does not limit this.
  • the second transmission link is a wireless link.
  • the state information of the first node cluster 110 may be broadcasted to save signaling overhead.
  • the first control node is specifically configured to broadcast state information of the first node cluster on the second transmission link.
  • the first control node may also receive the state information of the node cluster to which the other control node is broadcasted by the other control node, and the embodiment of the present invention is not limited thereto.
  • the first control node is further configured to:
  • the state information of the second node cluster is stored.
  • the first control node may update the stored state information of the second node cluster.
  • the first control node may also use the stored state information of the second node cluster before receiving the state information of the second node cluster again, but the embodiment of the present invention is not limited thereto.
  • the first control node may also store state information of the first node cluster.
  • the first control node is further configured to:
  • the communication system 100 further includes a third node cluster, and the third node cluster may be adjacent to or not adjacent to the first node cluster 110.
  • the first control node may determine a plurality of selectable routing paths from the first node cluster to the third node cluster, each optional routing path including at least one node cluster.
  • the multiple optional routing paths may be coarse-grained routing paths, that is, the basic granularity of the multiple optional routing paths is a node cluster.
  • each of the plurality of optional routing paths may start with the first node cluster and end with the third node cluster. In the middle, you can go through zero, one or more node clusters.
  • each of the plurality of optional routing paths may not include the first node cluster and the third node cluster, and at least one node cluster included in each optional routing path a node cluster other than the first node cluster and the third node cluster in the communication system 100; or each of the plurality of selectable routing paths may also include the third node cluster, or The first node cluster is further included, or further includes at least one node cluster other than the first node cluster and the third node cluster, but the embodiment of the present invention is not limited thereto.
  • the first control node may acquire state information of each node cluster in at least one node cluster included in each optional routing path, and according to a state of each node cluster in at least one node cluster included in each optional routing path Information, selecting a target routing path from the plurality of optional routing paths.
  • the first control node is specifically configured to:
  • the optional routing path with the smallest degree of congestion in the plurality of optional routing paths is determined as the target routing path.
  • the status information of the node cluster may include the BFM of the node cluster, and the congestion status of the optional routing path may be represented by the BFM corresponding to the optional routing path.
  • the BFM corresponding to an optional routing path may be determined by the BFM of some or all of the node clusters included in the optional routing path.
  • the first control node determines the BFM corresponding to the first optional routing path of the multiple optional routing paths as the sum or mathematical mean of the BFMs of all the node clusters included in the first optional routing path.
  • the first control node may determine the BFM corresponding to the first optional routing path as the sum or mathematical average of the BFMs of the partial node clusters included in the first optional routing path, but the embodiment of the present invention is not limited thereto. this.
  • the first control node can determine the target routing path by a plurality of selection criteria.
  • the first control node may consider only the congestion status of each optional routing path, for example, the first control node may minimize congestion among the multiple optional routing paths ( The optional routing path with the lowest degree of congestion is determined as the target routing path.
  • the first control node may determine the target routing path according to the congestion status of each optional routing path and other parameters of each optional routing path.
  • the first control node may determine the target routing path according to a congestion state and a path length of each of the plurality of selectable routing paths.
  • the path length of an optional routing path may adopt a node cluster included in the optional routing path.
  • the number of the node clusters corresponds to the number of times the data packet is in the optional routing path, but the embodiment of the present invention does not limit this.
  • the first control node is specifically configured to: according to a congestion state of each of the plurality of selectable routing paths, and a number of node clusters included in each of the selectable routing paths, The target routing path is determined from the plurality of selectable routing paths.
  • the congestion state of the optional routing path may correspond to the first weight value
  • the number of node clusters included in the optional routing path may correspond to the second weight value.
  • the total weight value of an optional routing path may be determined according to the first weight value, the congestion status of the optional routing path, the second weight value, and the number of node clusters included in the optional routing path.
  • the total weight value may also have other functional forms, which are not limited by the embodiment of the present invention.
  • the first control node may determine a total weight value of each of the plurality of selectable routing paths, and determine an optional routing path having the smallest total weight value among the plurality of optional routing paths.
  • the path is routed to the target, but embodiments of the present invention are not limited thereto.
  • the first node of the at least one other node is a source node of the first data packet.
  • the first data packet belongs to the first other node of the at least one other node; correspondingly, the first control node is further configured to:
  • the information of the target routing path is sent to the first other node.
  • the path determination request may carry information of the destination node and/or information of the third node cluster.
  • the first control node may determine the third node cluster according to the path determination request.
  • the path determination request may carry information of the destination node, for example, an IP address or a device identifier of the destination node, and the like.
  • the first control node may determine the third node cluster according to the information of the destination node.
  • the first control node may acquire a correspondence between the node and the node cluster, and determine the third node cluster according to the information of the destination node and the obtained correspondence between the node and the node cluster, where The correspondence may be pre-stored by the first control node or
  • the embodiments of the present invention are not limited thereto.
  • the first control node may also send a request for carrying information of the destination node to another network device, where the other network device determines the third node cluster according to the information of the destination node, and Sending information of the third node cluster to the first control node.
  • the first other node may determine the third node cluster, and carry information of the third node cluster, for example, the number of the third node cluster, in the path determination request.
  • the first other node may pre-store or have a correspondence between the node and the node cluster, or the first other node may acquire a correspondence between the node and the node cluster from the first control node, and according to the node and the node cluster The corresponding relationship and the information of the destination node determine the third node cluster, but the embodiment of the present invention does not limit this.
  • the information of the target routing path may include identification information of each node cluster in the at least one node cluster included in the target routing path, or may further include information indicating an order of the at least one node cluster.
  • the first data packet passes through the at least one node cluster in this order, but the embodiment of the present invention is not limited thereto.
  • the first other node is used to:
  • the first data packet to which the information of the target routing path is added is sent.
  • the first other node may add the information of the target routing path to the packet header of the first data packet, but the embodiment of the present invention is not limited thereto.
  • the target routing path corresponds to the coarse-grained routing path of the first data packet, and the first other node may further determine a fine-grained routing path of the first data packet, where the fine-grained routing path has a node as a basic granularity.
  • the first other node is further configured to:
  • the status information of the plurality of neighboring nodes may include status information of some or all of the plurality of neighboring nodes.
  • the status information may include congestion information.
  • the first other node may have a fourth transmission chain for transmitting status information of the node with each of the plurality of neighboring nodes Correspondingly, the first other node may receive, by using a fourth transmission link corresponding to each adjacent one of the multiple neighboring nodes, status information of each of the neighboring nodes, but the present invention implements The example is not limited to this.
  • the first other node may determine, according to the target routing path, a next hop node cluster of the first data packet, and determine a distance between the multiple neighbor nodes of the first other node and the next hop node cluster
  • the nearest at least one neighboring node, wherein the at least one neighboring node that is closest to the cluster of the next hopping node may mean that the number of hops passed by the at least one neighboring node to the cluster of the next hopping node is the least.
  • the first other node may determine state information of each of the at least one neighboring node, and determine the next hop node according to state information of each of the at least one neighboring node .
  • the first other node may determine whether each of the at least one neighboring node is in a congested state, wherein the node that is not in the congestion state is in a non-congested state, if congestion is included in the state information of the node If the information meets the preset condition, the node is in a congested state, and the preset condition may include that the BFM of the node is greater than a certain threshold, or the difference between the BFM of the node and the average BFM of the first node cluster is greater than a certain threshold, etc., but Embodiments of the invention are not limited thereto.
  • the first other node may determine at least one neighbor of the plurality of neighboring nodes that is next to the next hop node cluster The node determines whether the at least one neighboring node that is next in the distance is in a congested state, and reciprocates until an adjacent node in a non-congested state is found. If the at least one neighboring node closest to the cluster of the next hop node has a neighboring node in a non-congested state, the first other node may be adjacent to the at least one neighboring node in a non-congested state. The node is determined to be the next hop node.
  • the first other node may determine the node with the least degree of congestion among the neighboring nodes in the non-congested state as the node
  • the next hop node wherein the neighboring node with the least degree of congestion may refer to the neighboring node corresponding to the smallest BFM value among the plurality of neighboring nodes in the non-congested state, but the embodiment of the present invention is not limited thereto.
  • the first other node may also first determine at least one neighboring node in the non-congested state among the multiple neighboring nodes, if the at least one neighboring node in the non-congested state If the number is one, the first other node may determine the neighboring node in the non-congested state as the next hop node. If the number of the at least one neighboring node in the non-congested state is multiple, the first other node may be according to the at least one neighboring node and the next hop The distance between the clusters of nodes determines the next hop node. At this time, the status information of the plurality of neighboring nodes may include status information of each of the plurality of neighboring nodes. Correspondingly, the first other node is specifically used for:
  • the nearest neighbor node is determined to be the next hop node.
  • the first other node may determine the nearest neighbor node as the next hop node. If the number of neighboring nodes that are closest to the next hop node cluster in the at least one neighboring node is multiple, the first other node may determine the neighboring node with the least congestion degree as the next hop. Node, but the embodiment of the invention is not limited thereto.
  • the first control node may also be similar.
  • the manner determines the next hop node of the first data packet, but the embodiment of the present invention is not limited thereto.
  • the first node cluster 110 includes a forwarding node, the at least one other node includes the forwarding node, or the forwarding node is the first control node;
  • the forwarding node is used to:
  • the second data packet carries information of a routing path of the second data packet, where the information of the routing path includes information of at least one node cluster;
  • the forwarding node may be the first control node, or may be a node in the at least one other node, and the manner in which the forwarding node determines the next hop node of the second data packet may refer to the foregoing description. I won't go into details here.
  • a communication system includes a first node cluster and a second node cluster, wherein a first control node in the first node cluster and another node have a node for transmitting a first transmission link of status information, and a second transmission link between the first control node and the second control node in the second node cluster for transmitting status information of the node cluster, such that the first
  • the control node can not only obtain the state information of each node included in the first node cluster, but also can obtain the state information of the second node cluster, thereby facilitating consideration of the local state information and the global state information when selecting the output channel, and further Avoid congestion and improve the overall performance of the system.
  • the load of each node cluster in the network can be balanced, thereby avoiding congestion.
  • the phenomenon occurs.
  • the node determines the next hop node of the first data packet according to the state information of the multiple neighboring nodes, and can further balance the load of each node in the source node cluster, thereby Balance the load of all nodes in the network to further avoid congestion.
  • FIG. 4 schematically illustrates a control node 200 in accordance with an embodiment of the present invention.
  • the control node 200 includes:
  • the first transceiver unit 210 is configured to receive status information of each of the other nodes sent by each of the at least one other node, where the first node cluster to which the control node belongs includes the at least one other node;
  • the processing unit 220 is configured to determine status information of the first node cluster according to status information of each of the at least one other node received by the first transceiver unit 210;
  • the second transceiver unit 230 is configured to send, to the second control node, status information of the first node cluster determined by the processing unit 220.
  • the control node receives status information of the other node through the first transmission link between the control node and other nodes, and determines status information of the first node cluster according to status information of each other node. And transmitting the state information of the first node cluster to the second control node by using a second transmission link with the second control node, thereby facilitating consideration of local state information and global state information when selecting an output channel In order to avoid the occurrence of congestion and improve the overall performance of the system.
  • control node 200 and the second control node may have a wireless link.
  • the second transceiver unit 230 is specifically configured to broadcast status information of the first node cluster determined by the processing unit 220.
  • the second transceiver unit 230 may periodically send status information of the first node cluster, where the period value may be preset; or the second transceiver unit 230 may also send the trigger information.
  • Status information of the first node cluster for example, when the second transceiver unit 230 receives the request for requesting status information of the first node cluster sent by the second control node, sending the first node to the second control node Status information of a node cluster; or, the second transceiver unit 230 transmits status information of the first node cluster when receiving the token sent by the third control node, where the third control node may generate the token or The third control node acquires the token from the other control node.
  • the second transceiver unit 230 may further send the token to the fourth control node, so as to facilitate The fourth control node sends the state information of the node cluster to which the fourth node belongs according to the token, but the embodiment of the present invention does not limit this.
  • the second transceiver unit 230 is further configured to: receive a token sent by the third control node, and send, according to the token, status information of the first node cluster to the second control node. ;or
  • the second transceiver unit 230 is further configured to: after transmitting the state information of the first node cluster, send a token to the fourth control node, so that the fourth control node sends, according to the token, the fourth control node belongs to Status information of the node cluster.
  • control node 200 has a first wired transmission link with each of the at least one other node;
  • the first transceiver unit 210 is specifically configured to receive status information of each of the other nodes on a first wired transmission link with each of the other nodes.
  • the at least one other node includes a first other node adjacent to the control node 200, and the control node 200 and the first other node further have a different difference from the first wired transmission. a second wired transmission link of the link;
  • the first transceiver unit 210 is further configured to send and receive data on the second wired transmission link.
  • the status information includes a maximum cache occupancy rate BFM
  • the processing unit 220 is specifically configured to determine a sum of BFMs of the at least one other node and the control node as a BFM of the first node cluster.
  • the processing unit may also use the at least one other node and other function values of the BFM of the control node as the BFM of the first node cluster, such as a mathematical average of the at least one other node and the BFM of the control node, and the like, Embodiments of the invention are not limited thereto.
  • the first transceiver unit 210 is further configured to:
  • the status information reporting indication is used to indicate that each of the other nodes sends its own status information.
  • Each of the at least one other node may send its own state information, such as congestion information, to the control node according to the status information reporting indication.
  • the second transceiver unit 230 is further configured to receive status information of the second node cluster to which the second control node belongs, sent by the second control node;
  • control node 200 further includes:
  • the first storage unit is configured to store state information of the second node cluster received by the second transceiver unit 230.
  • the first storage unit may update the stored state information of the second node cluster.
  • processing unit 220 is further configured to:
  • each of the plurality of optional routing paths includes at least one node cluster
  • the processing unit 220 can determine a plurality of selectable routing paths from the first node cluster to the third node cluster, each optional routing path including at least one node cluster.
  • the multiple optional routing paths may be coarse-grained routing paths, that is, the basic granularity of the multiple optional routing paths is a node cluster.
  • each of the plurality of optional routing paths may start with the first node cluster, and the third node cluster ends with zero, one or more nodes in sequence. cluster.
  • each of the plurality of optional routing paths may not include the first node cluster and the third node cluster, and at least one node cluster included in each optional routing path a node cluster other than the first node cluster and the third node cluster; or each of the plurality of selectable routing paths may also include the third node cluster, or further include the first The node cluster, or further includes at least one node cluster other than the first node cluster and the third node cluster, but the embodiment of the present invention is not limited thereto.
  • the state information of the node cluster may include the BFM of the node cluster, and the congestion state of the optional routing path may be represented by the BFM corresponding to the optional routing path.
  • the BFM corresponding to an optional routing path may be determined by the BFM of some or all of the node clusters included in the optional routing path.
  • the processing unit 220 may correspond to the first selectable routing path of the plurality of selectable routing paths.
  • the BFM determines the sum or mathematical mean of the BFMs of all the node clusters included in the first optional routing path, but the embodiment of the present invention is not limited thereto.
  • the processing unit 220 can determine the target routing path by a plurality of selection criteria.
  • the processing unit 220 may only consider the congestion status of each optional routing path when determining the target routing path, for example, the first control node may be the least congested among the multiple optional routing paths (ie, The optional routing path with the lowest degree of congestion is determined as the target routing path.
  • the processing unit 220 may determine the target routing path according to the congestion status of each optional routing path and other parameters of each optional routing path. For example, the target routing path is determined according to a congestion state and a path length of each of the plurality of selectable routing paths.
  • the path length of an optional routing path may be represented by the number of node clusters included in the optional routing path, and the number of the node clusters corresponds to the number of times the data packet is hopped in the optional routing path, but This embodiment of the present invention does not limit this.
  • the congestion state of the optional routing path may correspond to the first weight value
  • the number of node clusters included in the optional routing path may correspond to the second weight value.
  • the total weight value of an optional routing path may be determined according to the first weight value, the congestion status of the optional routing path, the second weight value, and the number of node clusters included in the optional routing path.
  • the total weight value may also have other functional forms, which are not limited by the embodiment of the present invention.
  • the processing unit 220 may determine a total weight value of each of the plurality of selectable routing paths, and determine an optional routing path having the smallest total weight value among the plurality of optional routing paths as The target routing path, but the embodiment of the present invention is not limited thereto.
  • processing unit 220 is specifically configured to:
  • the optional routing path with the smallest degree of congestion in the plurality of optional routing paths is determined as the target routing path.
  • the first data packet belongs to the control node 200, that is, the control node 200 is a source node of the first data packet.
  • the processing unit 220 is further configured to add information of the target routing path to the first data packet;
  • the first transceiver unit 210 is further configured to send information that adds the target routing path. The first packet of this.
  • the information of the target routing path may include identification information of each node cluster in the at least one node cluster included in the target routing path, or may further include information indicating an order of the at least one node cluster.
  • the first data packet passes through the at least one node cluster in this order, but the embodiment of the present invention is not limited thereto.
  • the processing unit 220 is further configured to acquire multiple neighbors of the control node before the first transceiver unit 210 sends the first data packet to which the information of the target routing path is added. Status information of the node, and determining a next hop node of the first data packet according to status information of the multiple neighboring nodes;
  • the first transceiver unit 210 is specifically configured to send the first data packet to the next hop node of the first data packet determined by the processing unit 220.
  • the processing unit 220 may determine, according to the target routing path, a next hop node cluster of the first data packet, and determine that a plurality of neighboring nodes of the control node 200 are closest to the next hop node cluster.
  • At least one neighboring node, wherein at least one neighboring node that is closest to the cluster of the next hopping node may mean that the number of hops passed by the at least one neighboring node to the cluster of the next hopping node is the least.
  • the processing unit 220 may determine status information of each of the at least one neighboring node, and determine the next hop node according to status information of each of the at least one neighboring node.
  • the first other node may determine whether each adjacent node of the at least one neighboring node is in a congestion state, where the node is in congestion if the congestion information included in the state information of the node meets a preset condition
  • the preset condition may include that the BFM of the node is greater than a certain threshold, or the difference between the BFM of the node and the average BFM of the first node cluster is greater than a certain threshold, etc., but the embodiment of the present invention is not limited thereto.
  • the processing unit 220 may determine at least one neighboring node of the plurality of neighboring nodes that is closest to the next hopping node cluster And determining whether the at least one neighboring node next to the distance is in a congested state, and reciprocating until a neighboring node in a non-congested state is found. If there is a neighboring node in a non-congested state among the at least one neighboring node closest to the next hop node cluster, the processing unit 220 may be a neighboring node in the non-congested state of the at least one neighboring node. Determined as the next hop node.
  • the processing unit 220 may determine the node with the smallest degree of congestion among the neighboring nodes in the non-congested state as the lower node.
  • a hop node wherein the neighboring node with the least congestion can refer to The plurality of adjacent nodes in the non-congested state correspond to the neighboring nodes of the smallest BFM value, but the embodiment of the present invention is not limited thereto.
  • the processing unit 220 may further determine, at least one neighboring node that is in a non-congested state among the multiple neighboring nodes, if the at least one neighboring node in the non-congested state If the number is one, the processing unit 220 may determine the neighboring node in the non-congested state as the next hop node. If the number of the at least one neighboring node in the non-congested state is multiple, the processing unit 220 may determine the next hop node according to the distance between the at least one neighboring node and the next hop node cluster. .
  • processing unit 220 is specifically configured to:
  • the nearest neighbor node is determined to be the next hop node of the first data packet.
  • the first data packet belongs to a second other node of the at least one other node, that is, the second other node is a source node of the first data packet.
  • the first transceiver unit 210 is further configured to: before determining the third node cluster to which the destination node of the first data packet belongs, receive a path determination request sent by the second other node, where the path determination request is used to request the The control node determines a routing path of the first data packet;
  • the processing unit 220 is specifically configured to determine the third node cluster according to the path determination request received by the first transceiver unit 210;
  • the first transceiver unit 210 is further configured to send information of the target routing path determined by the processing unit 220 to the second other node.
  • the path determination request may carry information of the destination node of the first data packet and/or information of the third node cluster, and the processing unit 220 may determine the third node cluster according to the path determination request.
  • the path determining request carries information of the destination node of the first data packet.
  • the control node 200 further includes: a second storage unit, configured to store a correspondence between the node and the node cluster;
  • the processing unit 220 is specifically configured to determine the third node cluster according to the information of the destination node and the correspondence between the node and the node cluster stored by the second storage unit.
  • the first transceiver unit 210 is further configured to receive the second data packet.
  • the second data packet carries information of a routing path of the second data packet, and the information of the routing path of the second data packet includes information of at least one node cluster;
  • the processing unit 220 is further configured to determine, according to information about a routing path of the second data packet received by the first transceiver unit 210, a next hop node cluster of the second data packet, and according to the next data packet. Determining state information of the node cluster and the plurality of neighboring nodes of the control node, and determining a next hop node of the second data packet;
  • the first transceiver unit 210 is further configured to send the second data packet to the next hop node of the second data packet determined by the processing unit 220.
  • the manner in which the processing unit 220 determines the next hop node of the second data packet may be similar to the manner in which the processing unit 210 determines the next hop node of the first data packet. For brevity, details are not described herein again.
  • the control node 200 can correspond to the first control node 110 in the communication system 100 described above, and the description of the control node 200 and the first control node 110 can be cross-referenced.
  • the control node receives status information of the other node through the first transmission link between the control node and other nodes, and determines status information of the first node cluster according to status information of each other node. And transmitting the state information of the first node cluster to the second control node by using a second transmission link with the second control node, thereby facilitating consideration of local state information and global state information when selecting an output channel In order to avoid the occurrence of congestion and improve the overall performance of the system.
  • the load of each node cluster in the network can be balanced, thereby avoiding congestion.
  • the phenomenon occurs.
  • the node determines the next hop node of the first data packet according to the state information of the multiple neighboring nodes, and can further balance the load of each node in the source node cluster, thereby Balance the load of all nodes in the network to further avoid congestion.
  • FIG. 5 schematically illustrates a control node 300 in accordance with an embodiment of the present invention.
  • the control node 300 includes:
  • a first transceiver 310 configured to receive status information of each of the other nodes sent by each of the at least one other node, where the first node cluster to which the control node belongs includes the at least one other node;
  • the processor 320 is configured to receive, according to the at least one other node, the first transceiver 310 State information of each of the other nodes, determining state information of the first node cluster;
  • the second transceiver 330 is configured to send, to the second control node, status information of the first node cluster determined by the processor 320.
  • the control node receives status information of the other node through the first transmission link between the control node and other nodes, and determines status information of the first node cluster according to status information of each other node. And transmitting the state information of the first node cluster to the second control node by using a second transmission link with the second control node, thereby facilitating consideration of local state information and global state information when selecting an output channel In order to avoid the occurrence of congestion and improve the overall performance of the system.
  • the processor 320 may be a central processing unit (“CPU"), and the processor 320 may also be other general-purpose processors, digital signal processors (DSPs). , an application specific integrated circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware component, and the like.
  • the general purpose processor may be a microprocessor or the processor or any conventional processor or the like.
  • the second transceiver 330 is a wireless transceiver.
  • the second transceiver 330 is specifically configured to broadcast status information of the first node cluster determined by the processor 320.
  • the second transceiver 330 may periodically send status information of the first node cluster, where the period value may be preset; or the second transceiver 330 may also trigger the status of the first node cluster.
  • the information for example, the second transceiver 330 sends the status information of the first node cluster to the second control node when receiving the request for requesting the status information of the first node cluster sent by the second control node.
  • the second transceiver 330 sends the status information of the first node cluster when receiving the token sent by the third control node, where the third control node may generate the token or the third control node The other control node obtains the token.
  • the second transceiver 330 may further send the token to the fourth control node, so that the fourth control node is configured according to the fourth control node.
  • the token sends the state information of the node cluster to which the fourth node belongs, but the embodiment of the present invention does not limit this.
  • the second transceiver 330 is further configured to: receive a token sent by the third control node, and send, according to the token, status information of the first node cluster to the second control node. ;or
  • the second transceiver 330 is further configured to: after sending the state information of the first node cluster, send a token to the fourth control node, so that the fourth control node sends the fourth control section according to the token Status information of the node cluster to which the point belongs.
  • control node 300 has a first wired transmission link with each of the other nodes
  • first transceiver 310 is a wired transceiver.
  • the first transceiver 310 is specifically configured to receive status information of each of the other nodes on a first wired transmission link with each of the other nodes.
  • the at least one other node includes a first other node adjacent to the control node 300, and the control node 300 and the first other node further have a different difference from the first wired transmission.
  • the second wired transmission link of the link; correspondingly, the first transceiver 310 is further configured to send and receive data on the second wired transmission link.
  • the status information includes a maximum cache occupancy rate BFM
  • the processor 320 is specifically configured to determine a sum of BFMs of the at least one other node and the control node as a BFM of the first node cluster.
  • the processing unit may also use the at least one other node and other function values of the BFM of the control node as the BFM of the first node cluster, such as a mathematical average of the at least one other node and the BFM of the control node, and the like, Embodiments of the invention are not limited thereto.
  • the first transceiver 310 is further configured to:
  • Each of the at least one other node may send its own state information, such as congestion information, to the control node according to the status information reporting indication.
  • the second transceiver 330 is further configured to receive, by the second control node, state information of a second node cluster to which the second control node belongs;
  • control node 300 further includes:
  • a memory configured to store state information of the second node cluster received by the second transceiver 330.
  • the memory can include read only memory and random access memory and provides instructions and data to processor 320.
  • a portion of the memory may also include a non-volatile random access memory.
  • the memory can also store information of the device type.
  • the memory may update the stored state information of the second node cluster.
  • the processor 320 is further configured to:
  • each of the plurality of optional routing paths includes at least one node cluster
  • the processor 320 can determine a plurality of selectable routing paths from the first node cluster to the third node cluster, each optional routing path including at least one node cluster.
  • the multiple optional routing paths may be coarse-grained routing paths, that is, the basic granularity of the multiple optional routing paths is a node cluster.
  • each of the plurality of optional routing paths may start with the first node cluster, and the third node cluster ends with zero, one or more nodes in sequence. cluster.
  • each of the plurality of selectable routing paths may include a node cluster other than the first node cluster and the third node cluster, or further include the third node cluster, or further The first node cluster is included, but the embodiment of the present invention is not limited thereto.
  • the state information of the node cluster may include the BFM of the node cluster, and the congestion state of the optional routing path may be represented by the BFM corresponding to the optional routing path.
  • the BFM corresponding to an optional routing path may be determined by the BFM of some or all of the node clusters included in the optional routing path.
  • the processor 320 may determine the BFM corresponding to the first optional routing path of the multiple optional routing paths as the sum or mathematical mean of the BFMs of all the node clusters included in the first optional routing path,
  • embodiments of the invention are not limited thereto.
  • the congestion state of the optional routing path may correspond to the first weight value
  • the number of node clusters included in the optional routing path may correspond to the second weight value.
  • the total weight value of an optional routing path may be determined according to the first weight value, the congestion status of the optional routing path, the second weight value, and the number of node clusters included in the optional routing path.
  • the total weight value may also have other functional forms, which are not limited by the embodiment of the present invention.
  • the processor 320 may determine a total weight value of each of the plurality of selectable routing paths, and determine an optional routing path having the smallest total weight value among the plurality of selectable routing paths as The target routing path, but the embodiment of the present invention is not limited thereto.
  • the processor 320 is specifically configured to:
  • the optional routing path with the smallest degree of congestion in the plurality of optional routing paths is determined as the target routing path.
  • the first data packet belongs to the control node 300, that is, the control node is a source node of the first data packet.
  • the processor 320 is further configured to add information of the target routing path to the first data packet;
  • the first transceiver 310 is further configured to send the first data packet to which the information of the target routing path is added.
  • the information of the target routing path may include identification information of each node cluster in the at least one node cluster included in the target routing path, or may further include information indicating an order of the at least one node cluster.
  • the first data packet passes through the at least one node cluster in this order, but the embodiment of the present invention is not limited thereto.
  • the processor 320 is further configured to acquire multiple neighbors of the control node before the first transceiver 310 sends the first data packet to which the information of the target routing path is added. Status information of the node, and determining a next hop node of the first data packet according to status information of the multiple neighboring nodes;
  • the first transceiver 310 is specifically configured to send the first data packet to a next hop node of the first data packet determined by the processor 320.
  • the processor 320 may determine, according to the target routing path, a next hop node cluster of the first data packet, and determine that the neighboring nodes of the control node 200 are closest to the next hop node cluster.
  • At least one neighboring node, wherein at least one neighboring node that is closest to the cluster of the next hopping node may mean that the number of hops passed by the at least one neighboring node to the cluster of the next hopping node is the least.
  • the processor 320 may determine state information of each of the at least one neighboring node, and determine the next hop node according to state information of each of the at least one neighboring node.
  • the first other node may determine whether each adjacent node of the at least one neighboring node is in a congestion state, where the node is in congestion if the congestion information included in the state information of the node meets a preset condition
  • the preset condition may include that the BFM of the node is greater than a certain threshold, or the difference between the BFM of the node and the average BFM of the first node cluster is greater than a certain threshold, etc., but the embodiment of the present invention is not limited thereto.
  • the processor 320 may determine at least one of the plurality of neighboring nodes that is closest to the next hop node cluster Adjacent nodes, and determining whether at least one neighboring node next to the distance is in a congested state, and reciprocating until a neighboring node in a non-congested state is found. If there is a neighboring node in a non-congested state among the at least one neighboring node closest to the next hop node cluster, the processor 320 may be a neighboring node in the non-congested state of the at least one neighboring node. Determined as the next hop node.
  • the processor 320 may determine the node with the smallest degree of congestion among the neighboring nodes in the non-congested state as the lower one.
  • a hop node, wherein the neighboring node with the least degree of congestion may refer to the neighboring node corresponding to the smallest BFM value among the plurality of neighboring nodes in the non-congested state, but the embodiment of the present invention is not limited thereto.
  • the processor 320 may further determine, at least one neighboring node that is in a non-congested state among the multiple neighboring nodes, if the at least one neighboring node in the non-congested state If the number is one, the processor 320 can determine the neighboring node in the non-congested state as the next hop node. If the number of the at least one neighboring node in the non-congested state is multiple, the processor 320 may determine the next hop node according to the distance between the at least one neighboring node and the next hop node cluster. .
  • the processor 320 is specifically configured to:
  • the nearest neighbor node is determined to be the next hop node of the first data packet.
  • the first data packet belongs to a second other node of the at least one other node.
  • the first transceiver 310 is further configured to: before determining the third node cluster to which the destination node of the first data packet belongs, receive a path determination request sent by the second other node, where the path determination request is used to request the The control node determines a routing path of the first data packet;
  • the processor 320 is specifically configured to determine the third node cluster according to the path determination request received by the first transceiver 310.
  • the first transceiver 310 is further configured to send information of the target routing path determined by the processor 320 to the second other node.
  • the path determination request may carry information of the destination node of the first data packet and/or information of the third node cluster, and the processor 320 may determine the third node cluster according to the path determination request.
  • the path determining request carries information of the destination node of the first data packet.
  • the control node 300 further includes: a memory, configured to store a correspondence between the node and the node cluster;
  • the processor 320 is specifically configured to determine the third node cluster according to the information of the destination node and the correspondence between the node and the node cluster stored in the memory.
  • the first transceiver 310 is further configured to receive a second data packet, where the second data packet carries information about a routing path of the second data packet, and a routing path of the second data packet.
  • Information includes information of at least one cluster of nodes;
  • the processor 320 is further configured to determine, according to information about a routing path of the second data packet received by the first transceiver 310, a next hop node cluster of the second data packet, and according to the next data packet. Determining state information of the node cluster and the plurality of neighboring nodes of the control node, and determining a next hop node of the second data packet;
  • the first transceiver 310 is further configured to send the second data packet to a next hop node of the second data packet determined by the processor 320.
  • the manner in which the processor 320 determines the next hop node of the second data packet may be similar to the manner in which the processing unit 210 determines the next hop node of the first data packet. For brevity, no further details are provided herein.
  • the control node 300 can correspond to the first control node 110 in the communication system 100 described above, and the description of the control node 300 and the first control node 110 can be cross-referenced.
  • the control node receives status information of the other node through the first transmission link between the control node and other nodes, and determines status information of the first node cluster according to status information of each other node. And transmitting the state information of the first node cluster to the second control node by using a second transmission link with the second control node, thereby facilitating consideration of local state information and global state information when selecting an output channel In order to avoid the occurrence of congestion and improve the overall performance of the system.
  • the load of each node cluster in the network can be balanced, thereby avoiding congestion.
  • the phenomenon occurs.
  • the node determines the next hop node of the first data packet according to the state information of the multiple neighboring nodes, and can further balance the load of each node in the source node cluster, thereby Balance the load of all nodes in the network to further avoid congestion.
  • FIG. 6 illustrates a communication method 400 that may be performed by a control node in accordance with an embodiment of the present invention. As shown in FIG. 6, the method 400 includes:
  • S410 Receive status information of each of the other nodes sent by each of the at least one other node, where the first node cluster to which the control node belongs includes the at least one other node;
  • S420 Determine status information of the first node cluster according to status information of each of the other nodes.
  • S430 Send status information of the first node cluster to the second control node.
  • the communication method determines status information of the first node cluster according to status information of the at least one other node by receiving status information of each of the other nodes, and
  • the second control node sends the state information of the first node cluster, which is beneficial to consider the local state information and the global state information when selecting the output channel, thereby avoiding the occurrence of congestion and improving the overall performance of the system.
  • the S430 sends the status information of the first node cluster to the second control node, including:
  • Broadcasting status information of the first node cluster Broadcasting status information of the first node cluster.
  • the method 400 further includes: receiving a token sent by the third control node;
  • S430 sending, to the second control node, status information of the first node cluster, including:
  • the status information includes a maximum cache occupancy BFM.
  • S420 determining status information of the first node cluster according to status information of each of the other nodes of the at least one other node, including:
  • the sum of the BFM of the at least one other node and the control node is determined as the BFM of the first node cluster.
  • the control node determines the sum of BFMs of all nodes of the first node cluster as the BFM of the first node cluster.
  • the control node may further determine a mathematical mean value or other function value of the BFM of all nodes of the first node cluster as the BFM of the first node cluster, which is used by the embodiment of the present invention. Not limited.
  • the method 400 further includes:
  • S410 receiving status information of each of the other nodes sent by each of the other nodes, including:
  • Each of the other nodes receiving the at least one other node reports the status information of the each of the other nodes that are sent according to the status information.
  • the control node may have a first transmission link with each of the at least one other node, wherein the at least one other node may include a node adjacent to and/or not adjacent to the control node,
  • the first transmission link may be dedicated to the status related message of the transmitting node, for example, the status information reporting indication and status information of the node, and the like. In this way, the control node can receive status information directly sent by the at least one other node through the first transmission link.
  • the method 400 further includes:
  • the state information of the second node cluster is stored.
  • the first control node and the second control node may also have a second transmission link, where the first control node and the second control node may not be adjacent, and the second transmission link may also be used exclusively.
  • a status-related message is transmitted, for example, status information of a cluster of nodes.
  • the first control node and the second control node can directly interact with the state information of the node cluster through the second transmission link.
  • the method 400 further includes:
  • each of the plurality of optional routing paths includes at least one node cluster
  • the target routing path is determined from the multiple optional routing paths according to state information of at least one node cluster included in each of the plurality of selectable routing paths.
  • the optional routing path with the smallest degree of congestion in the plurality of optional routing paths is determined as the target routing path.
  • Each of the plurality of selectable routing paths includes at least one node cluster, which is more
  • the optional routing path includes multiple node clusters.
  • the at least one node cluster included in each of the plurality of selectable routing paths may include a forwarding node cluster other than the first node cluster and the third node cluster, or may further include the
  • the third node cluster may further include the first node cluster, which is not limited by the embodiment of the present invention.
  • the control node may acquire state information of each of the plurality of node clusters included in the plurality of selectable routing paths.
  • the control node may pre-store state information of multiple node clusters included in the multiple optional routing paths, or the control node may acquire multiple nodes included in the multiple optional routing paths from other control nodes.
  • the state information of the cluster is not limited in this embodiment of the present invention.
  • the first data packet belongs to the control node, that is, the control node is a source node of the first data packet.
  • the method 400 further includes:
  • the first data packet to which the information of the target routing path is added is sent.
  • the information of the target routing path may include information of at least one node cluster included in the target routing path.
  • the information of the target routing path may include identification information of the at least one node cluster and an order indicating the at least one node cluster.
  • the information of the first data packet is sequentially passed through the at least one node cluster in this order, but the information of the target routing path may also include other parameters, which is not limited by the embodiment of the present invention.
  • the node that receives the first data packet can determine the next hop of the first data packet according to the information of the target routing path carried by the first data packet, because the information of the target routing path is carried in the first data packet. And forwarding the first data packet to the next hop node.
  • the method 400 before the sending the first data packet to which the information of the target routing path is added, the method 400 further includes:
  • the sending the first data packet that adds the information of the target routing path includes:
  • the control node and the node not adjacent to the control node can directly transmit state-related information, such as state information of the node, but cannot directly transmit data.
  • any of the first node clusters may be directly transmitted between two adjacent nodes, and the data may be directly transmitted.
  • the link for transmitting the status information of the node may be the same link as the link for transmitting data.
  • determining, according to the status information of the multiple neighboring nodes, the next hop node of the first data packet including:
  • the nearest neighbor node is determined to be the next hop node of the first data packet.
  • the control node may determine whether the node is in a non-congested state according to status information of a node, where the status information may include congestion information, for example, BFM. For example, if the BFM of the node is greater than a certain threshold, the embodiment of the present invention is not limited thereto.
  • the control node may directly use the one neighboring node as the next hop node of the first data packet. If the number of the at least one neighboring node is multiple, the control node may determine a next hop node cluster corresponding to the first node cluster in the target routing path, and determine the middle and the lower of the at least one neighboring node The one-hop node cluster is the closest node, and if the number of nodes closest to the cluster of the next hop node is one, the control node can use the node as the next hop node.
  • control node may determine the node with the least congestion degree among the plurality of nodes closest to the next hop node cluster as the next hop.
  • a node, wherein the minimum degree of congestion may correspond to a minimum BFM, but embodiments of the present invention are not limited thereto.
  • the first data packet belongs to a second other node of the at least one other node, that is, the second other node is a source node of the first data packet.
  • the method 400 further includes:
  • determining the third node cluster to which the destination node of the first data packet belongs includes:
  • the method further includes:
  • the path determining request carries information of the destination node of the first data packet.
  • determining the third node cluster includes:
  • the third node cluster is determined according to the information of the destination node and the correspondence between the node and the node cluster.
  • the path determining request may also carry information about the third node cluster, for example, a number of the third node cluster.
  • the control node may determine the third node cluster according to the information of the three-node cluster in the local area.
  • the method 400 further includes:
  • the second data packet carries information of a routing path of the second data packet, where information of the routing path of the second data packet includes information of at least one node cluster;
  • control node determines the next hop node of the second data packet.
  • the communication method 400 may be performed by the control node 200, the control node 300, or the first control node 111 in the communication system 100 of the embodiment of the present invention, and the control node 200, the control node 300, or the first control node 111
  • the above and other operations and/or functions of the respective modules in the above are respectively to implement the corresponding processes of the respective methods in FIG. 6. Therefore, the various embodiments of the present invention may be referred to each other, and are not described herein again for brevity.
  • the communication method determines status information of the first node cluster according to status information of the at least one other node by receiving status information of each of the other nodes, and
  • the second control node sends the state information of the first node cluster, which is beneficial to consider the local state information and the global state information when selecting the output channel, thereby avoiding the occurrence of congestion and improving the overall performance of the system.
  • the load of each node cluster in the network can be balanced, thereby avoiding congestion.
  • the phenomenon occurs.
  • the node determines the next hop node of the first data packet according to the state information of the multiple neighboring nodes, and can further balance the load of each node in the source node cluster, thereby Balance the load of all nodes in the network to further avoid congestion.
  • association relationship describing the associated object indicates that there may be three relationships.
  • a and/or B may indicate that A exists separately, and A and B exist simultaneously, and B cases exist alone.
  • the character / in this paper generally indicates that the contextual object is an OR relationship.
  • the disclosed systems, devices, and methods may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of the unit is only a logical function division.
  • there may be another division manner for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, or an electrical, mechanical or other form of connection.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the embodiments of the present invention.
  • each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.
  • the integrated unit if implemented in the form of a software functional unit and sold or used as a standalone product, may be stored in a computer readable storage medium.
  • the technical solution of the present invention contributes in essence or to the prior art, or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium.
  • a number of instructions are included to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present invention.
  • the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, which can store program codes. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention concerne un système de communication, un nœud de commande et un procédé de communication. Le système comprend un premier groupe de nœuds et un second groupe de nœuds. Le premier groupe de nœuds comprend un premier nœud de commande et un ou plusieurs autres nœuds, le second groupe de nœuds comprend un second nœud de commande, et le premier nœud de commande n'est pas adjacent au second nœud de commande. Une première liaison de transmission existe entre le premier nœud de commande et chacun du ou des autres nœuds, et la première liaison de transmission est utilisée pour transmettre des informations d'état des nœuds. Une seconde liaison de transmission existe entre le premier nœud de commande et le second nœud de commande, et la seconde liaison de transmission est utilisée pour transmettre des informations d'état des groupes de nœuds. Grâce au système de communication proposé par la présente invention, des informations d'état local et des informations d'état global sont toutes deux prises en compte lorsqu'un canal de sortie est sélectionné, de sorte que le phénomène de congestion soit évité et que les performances globales du système soient améliorées.
PCT/CN2014/091847 2014-11-21 2014-11-21 Système de communication, nœud de commande et procédé de communication Ceased WO2016078071A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2014/091847 WO2016078071A1 (fr) 2014-11-21 2014-11-21 Système de communication, nœud de commande et procédé de communication
CN201480037573.XA CN105900383B (zh) 2014-11-21 2014-11-21 通信系统、控制节点和通信方法

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2014/091847 WO2016078071A1 (fr) 2014-11-21 2014-11-21 Système de communication, nœud de commande et procédé de communication

Publications (1)

Publication Number Publication Date
WO2016078071A1 true WO2016078071A1 (fr) 2016-05-26

Family

ID=56013094

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/091847 Ceased WO2016078071A1 (fr) 2014-11-21 2014-11-21 Système de communication, nœud de commande et procédé de communication

Country Status (2)

Country Link
CN (1) CN105900383B (fr)
WO (1) WO2016078071A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021143239A1 (fr) * 2020-01-13 2021-07-22 腾讯科技（深圳）有限公司 Procédé et appareil de commande de routage, dispositif électronique et support de stockage
WO2024060730A1 (fr) * 2022-09-20 2024-03-28 华为技术有限公司 Procédé et dispositif de régulation de trafic
CN118740708A (zh) * 2024-06-07 2024-10-01 北京开源芯片研究院 数据广播方法、装置、电子设备及可读存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120233496A1 (en) * 2011-03-11 2012-09-13 Microsoft Corporation Fault tolerance in a parallel database system
CN103220216A (zh) * 2013-04-22 2013-07-24 南京邮电大学 一种基于区域划分的无线体域网路由方法
CN103889020A (zh) * 2014-03-14 2014-06-25 上海交通大学 一种基于动态路由的无线传感网络系统及其方法

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101420355B (zh) * 2008-11-28 2011-06-01 西安邮电学院 一种星簇双环片上网络拓扑结构装置
CN102387585B (zh) * 2010-08-30 2015-05-13 富士通株式会社 用于无线通信网络的通信方法及节点
WO2013171867A1 (fr) * 2012-05-16 2013-11-21 富士通株式会社 Dispositif de nœud et procédé de communication
CN105450555B (zh) * 2014-09-26 2018-11-30 杭州华为数字技术有限公司 一种片上网络系统，及片上网络通信链路的建立方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120233496A1 (en) * 2011-03-11 2012-09-13 Microsoft Corporation Fault tolerance in a parallel database system
CN103220216A (zh) * 2013-04-22 2013-07-24 南京邮电大学 一种基于区域划分的无线体域网路由方法
CN103889020A (zh) * 2014-03-14 2014-06-25 上海交通大学 一种基于动态路由的无线传感网络系统及其方法

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021143239A1 (fr) * 2020-01-13 2021-07-22 腾讯科技（深圳）有限公司 Procédé et appareil de commande de routage, dispositif électronique et support de stockage
US12101250B2 (en) 2020-01-13 2024-09-24 Tencent Technology (Shenzhen) Company Limited Methods and apparatus for routing control in a cloud network
WO2024060730A1 (fr) * 2022-09-20 2024-03-28 华为技术有限公司 Procédé et dispositif de régulation de trafic
CN118740708A (zh) * 2024-06-07 2024-10-01 北京开源芯片研究院 数据广播方法、装置、电子设备及可读存储介质

Also Published As

Publication number Publication date
CN105900383A (zh) 2016-08-24
CN105900383B (zh) 2019-05-24

Similar Documents

Publication Publication Date Title
JP6485671B2 (ja) マルチホップ異種無線ネットワークにおけるリソースアウェアマルチタスクルーティング
JP5276220B2 (ja) バス制御装置およびバス制御装置に指示を出力する制御装置
US8743866B2 (en) Method and apparatus to reduce cumulative effect of dynamic metric advertisement in smart grid/sensor networks
US9154407B2 (en) Maintained message delivery during routing domain migration
Sergiou et al. Congestion control in wireless sensor networks through dynamic alternative path selection
JP5296803B2 (ja) 処理メトリック情報のノード間における交換
US8000239B2 (en) Method and system for bandwidth allocation using router feedback
US8982708B1 (en) Priority aware dynamic routing protocol for ad-hoc networks
US20160112502A1 (en) Distributed computing based on deep packet inspection by network devices along network path to computing device
US8885501B2 (en) Reachability rate computation without link layer acknowledgments
CN107148768A (zh) 用于数据路径确认与验证的系统和方法
WO2016078070A1 (fr) Procédé d'acheminement de paquet de données, nœud, et système de communication
WO2016078071A1 (fr) Système de communication, nœud de commande et procédé de communication
US8009570B2 (en) Router device for efficient routing with congestion minimized
CN112770301B (zh) 无线网络中节点故障后的按需表和路由更新
CN109379283A (zh) 基于物联网异构设备的自组网通信方法、装置及自组网
KR20170078425A (ko) 네트워크에서의 부하 분산 방법
Parthiban et al. Maximizing the network life time based on energy efficient routing in ad hoc networks
CN104038436A (zh) 一种解决有线网络拥塞的路由选择方法
Thongpook Load balancing of adaptive zone routing in ad hoc networks
CN110719618B (zh) 一种无线自组网的路由选择方法、装置、终端及存储介质
CN117978737A (zh) 报文传输方法、设备、存储介质和程序产品
Chaudet et al. A model to evaluate brokers overlays for publish/subscribe in wireless sensor networks
Khan et al. Data rate adaptation strategy to avoid packet loss in MANETs
US20190140936A1 (en) Method for Transmitting Path Load Information and Network Node

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14906327

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14906327

Country of ref document: EP

Kind code of ref document: A1