CN116318561B - Orthogonal sequence processing method, device, equipment and chip of wireless data center - Google Patents
Orthogonal sequence processing method, device, equipment and chip of wireless data center Download PDFInfo
- Publication number
- CN116318561B CN116318561B CN202310580174.9A CN202310580174A CN116318561B CN 116318561 B CN116318561 B CN 116318561B CN 202310580174 A CN202310580174 A CN 202310580174A CN 116318561 B CN116318561 B CN 116318561B
- Authority
- CN
- China
- Prior art keywords
- orthogonal sequence
- nodes
- data center
- node
- orthogonal
- 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.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 22
- 238000013507 mapping Methods 0.000 claims abstract description 81
- 238000000034 method Methods 0.000 claims abstract description 37
- 230000008569 process Effects 0.000 claims abstract description 9
- 230000005540 biological transmission Effects 0.000 claims description 42
- 238000004364 calculation method Methods 0.000 claims description 15
- 230000007246 mechanism Effects 0.000 claims description 9
- 238000010586 diagram Methods 0.000 description 20
- 230000009467 reduction Effects 0.000 description 6
- 239000002699 waste material Substances 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 2
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005314 correlation function Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 238000013179 statistical model Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0015—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
- H04L1/0007—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format by modifying the frame length
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The application provides an orthogonal sequence processing method, device, equipment and chip of a wireless data center, which are applied to the technical field of the wireless data center, wherein the wireless data center comprises a plurality of nodes, any node updates the length and mapping relation of an orthogonal sequence according to the number of identified index keywords and the current orthogonal sequence in the wireless data center, and informs all nodes of the updated orthogonal sequence and mapping relation, and the mapping relation represents the one-to-one correspondence between the index keywords and the orthogonal sequence; and all the nodes adopt the updated orthogonal sequence and mapping relation to transmit and process data. The application realizes dynamic adjustment and configuration of the orthogonal sequences, and distributes the orthogonal sequences as required, thereby ensuring the efficient operation of the wireless data center system.
Description
Technical Field
The present application relates to the field of wireless data centers, and in particular, to a method, an apparatus, a device, and a chip for processing an orthogonal sequence in a wireless data center.
Background
A traditional big data mapping-reduction (Map-Reduce) calculation model is based on a data center formed by a wired network, each node in the numerical center is provided with a wired network card, all nodes are connected together through the wired network, and standard Map-Reduce calculation can be performed on the traditional wired data center. Map-Reduce is a distributed computing model based on an index keyword-Value (Key-Value) structure, and is particularly suitable for data processing of an offline statistical model.
In the Map-Reduce process flow, data transmission of each key-value pair is realized in the form of a wired network packet. Therefore, there is a lot of overhead related to network packets, and calculation needs to be performed on the server, resulting in a problem of low Map-Reduce calculation efficiency.
In order to solve the above problem, the transmission and calculation of the data can be implemented in the air interface through the wireless transmission technology, that is, the transmission and calculation are integrated, however, in one implementation manner of implementing the transmission and calculation by the wireless transmission technology, the sender and the receiver need to allocate the orthogonal sequences in advance, but the length of the orthogonal sequences is related to the number of the orthogonal sequences, and in many practical scenarios, the allocation according to the fixed length of the orthogonal sequences often causes the waste of resources or the insufficiency of resources due to the flexible and changeable characteristics of the network topology and the traffic itself.
Therefore, a new technical solution for allocating orthogonal sequences in wireless transmission is needed.
Disclosure of Invention
In view of this, the embodiments of the present disclosure provide a method, an apparatus, a device, and a chip for processing an orthogonal sequence in a wireless data center, so as to solve the problem of resource waste or resource insufficiency caused by allocation according to a fixed orthogonal sequence length in the existing wireless transmission technology.
The embodiment of the specification provides the following technical scheme:
the embodiment of the present disclosure provides an orthogonal sequence processing method for a wireless data center, where the wireless data center includes a plurality of nodes, including:
any node updates the length and the mapping relation of the orthogonal sequences according to the number of the identified index keywords and the current orthogonal sequences in the wireless data center, informs all nodes of the updated orthogonal sequences and the mapping relation, and the mapping relation represents one-to-one correspondence between the index keywords and the orthogonal sequences;
and all the nodes adopt the updated orthogonal sequence and mapping relation to transmit and process data.
Preferably, any node updates the length and mapping relation of the orthogonal sequence according to the identified index keyword and the number of the current orthogonal sequences in the wireless data center, including:
after any node recognizes the index key words, judging whether to increase the length of the orthogonal sequences according to the number of the current orthogonal sequences;
if not, an orthogonal sequence is allocated for the index key words;
if yes, the length of the orthogonal sequence is increased, the space of the orthogonal sequence is reconstructed, and the mapping relation is updated.
Preferably, after any node recognizes the index keyword, determining whether to increase the length of the orthogonal sequence according to the number of the current orthogonal sequences includes:
when any node recognizes the index key word, judging whether the current orthogonal sequence is used completely;
if yes, the length of the orthogonal sequence is increased;
if not, the length of the orthogonal sequence does not need to be increased.
Preferably, the nodes comprise Reduce nodes;
the Reduce node updates the length and the mapping relation of the orthogonal sequence according to the use condition and the time threshold value of the orthogonal sequence, and informs all nodes of the updated orthogonal sequence and the updated mapping relation;
and all the nodes adopt the updated orthogonal sequence and mapping relation to transmit and process data.
Preferably, the use cases of the orthogonal sequences include: the method comprises the steps that when the method is not used, the Reduce node updates the length and the mapping relation of the orthogonal sequence according to the use condition and the time threshold value of the orthogonal sequence, and the method comprises the following steps:
when the Reduce node judges that the orthogonal sequence is not used, judging whether the time of the unused orthogonal sequence is larger than a time threshold value or not;
if not, not processing;
if so, the length of the orthogonal sequence is reduced, the space of the orthogonal sequence is reconstructed, and the mapping relation is updated.
Preferably, the nodes comprise a plurality of Map nodes and a Reduce node, each Map node is the same distance from the Reduce node, and the Map nodes form a circular topology with equal intervals around the Reduce node;
the Map nodes and the Reduce nodes are connected through a wireless connection link and a wired connection link;
the wired connection link is used for realizing the updating of the orthogonal sequence and the mapping relation;
the wireless connection link is used for realizing the transmission and processing of data.
Preferably, the nodes comprise a plurality of Map nodes and a Reduce node, each Map node is the same distance from the Reduce node, and the Map nodes form a circular topology with equal intervals around the Reduce node;
the Map nodes and a Reduce node are connected through two wireless connection links;
one wireless connection link is used for realizing the updating of the orthogonal sequence and the mapping relation, and the other wireless connection link is used for realizing the transmission and the processing of data.
Preferably, the nodes comprise a plurality of Map nodes and a Reduce node, each Map node is the same distance from the Reduce node, and the Map nodes form a circular topology with equal intervals around the Reduce node;
the Map nodes and the Reduce nodes are connected through a wireless connection link;
adding a wireless control link in the wireless connection link of each node, wherein the wireless control link and the wireless connection link work simultaneously;
the wireless connection link is used for realizing the updating of the orthogonal sequence and the mapping relation and the transmission and the processing of data;
the wireless control link is used for suspending wireless transmission channels of all nodes through a relevant identification mechanism so that all nodes can update the orthogonal sequence and the mapping relation.
Preferably, the relevant recognition mechanism comprises:
and performing correlation calculation on the special identification sequence in the wireless control link and the received signal received by any node to obtain a correlation result, wherein the special identification sequence represents the orthogonal sequence and/or the mapping relation needs to be updated.
The embodiment of the specification also provides an orthogonal sequence processing device of the wireless data center, which is suitable for the orthogonal sequence processing method of the wireless data center.
The embodiment of the specification also provides an electronic device, including: at least one processor; and a memory communicatively coupled to the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the orthogonal sequence processing method of the wireless data center.
The embodiment of the present specification also provides a chip, including: at least one processor; and a memory communicatively coupled to the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the orthogonal sequence processing method of the wireless data center.
Compared with the prior art, the beneficial effects that above-mentioned at least one technical scheme that this description embodiment adopted can reach include at least: the method and the device realize dynamic adjustment and configuration of the orthogonal sequences, and allocate the orthogonal sequences as required, thereby ensuring efficient operation of the wireless data center system.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic structural diagram of a first topology of a wireless data center according to an embodiment of the present application;
fig. 2 is a schematic diagram of a first topology orthogonal sequence processing method of a wireless data center according to an embodiment of the present application;
fig. 3 is a schematic diagram of another method for processing orthogonal sequences in a first topology of a wireless data center according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of a second topology of a wireless data center according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a third wireless data center topology according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of adding a radio control link to a radio connection link according to an embodiment of the present application;
fig. 7 is a schematic diagram of a wireless network transmission according to an embodiment of the present application;
fig. 8 is a schematic diagram of data transmission after adding a radio control link to a radio connection link according to an embodiment of the present application;
fig. 9 is a schematic diagram of a third topology orthogonal sequence processing method of a wireless data center according to an embodiment of the present application;
fig. 10 is a schematic diagram of another method for processing an orthogonal sequence in a third topology of a wireless data center according to an embodiment of the present application.
Detailed Description
Embodiments of the present application will be described in detail below with reference to the accompanying drawings.
Other advantages and effects of the present application will become apparent to those skilled in the art from the following disclosure, which describes the embodiments of the present application with reference to specific examples. It will be apparent that the described embodiments are only some, but not all, embodiments of the application. The application may be practiced or carried out in other embodiments that depart from the specific details, and the details of the present description may be modified or varied from the spirit and scope of the present application. It should be noted that the following embodiments and features in the embodiments may be combined with each other without conflict. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
It is noted that various aspects of the embodiments are described below within the scope of the following claims. It should be apparent that the aspects described herein may be embodied in a wide variety of forms and that any specific structure and/or function described herein is merely illustrative. Based on the present disclosure, one skilled in the art will appreciate that one aspect described herein may be implemented independently of any other aspect, and that two or more of these aspects may be combined in various ways. For example, apparatus may be implemented and/or methods practiced using any number and aspects set forth herein. In addition, such apparatus may be implemented and/or such methods practiced using other structure and/or functionality in addition to one or more of the aspects set forth herein.
It should also be noted that the illustrations provided in the following embodiments merely illustrate the basic concept of the present application by way of illustration, and only the components related to the present application are shown in the drawings and are not drawn according to the number, shape and size of the components in actual implementation, and the form, number and proportion of the components in actual implementation may be arbitrarily changed, and the layout of the components may be more complicated.
In addition, in the following description, specific details are provided in order to provide a thorough understanding of the examples. However, it will be understood by those skilled in the art that the present application may be practiced without these specific details.
In a wireless data center scenario, one implementation method is to implement "pass-through" integration through wireless technology. However, the transmission and calculation are all in one, that is, the sender and the receiver need to allocate orthogonal sequences in advance, each orthogonal sequence needs to be bound with a node, or a data field to be processed (i.e. Key) and allocated in advance, and the sender and the receiver are known and can work only after that.
The length of the orthogonal sequence is closely related to the number of the orthogonal sequences accommodated in the wireless data center, and the longer the orthogonal sequence is, the more the number of the orthogonal sequences is, and vice versa, the fewer the number of the orthogonal sequences is. Therefore, in many practical scenarios, since the network topology and the traffic flow have flexible characteristics, allocation according to the fixed orthogonal sequence length often causes waste of resources or insufficient resources, for example, excessive or insufficient allocated sequences.
Based on this, the embodiment of the present specification proposes a processing scheme: in the scene of 'transmission and calculation' integrated in the wireless data center, the orthogonal sequences are dynamically regulated and configured, and the orthogonal sequences are distributed according to the needs, so that the new efficient operation in the wireless data is ensured.
The following describes the technical scheme provided by each embodiment of the present application with reference to the accompanying drawings.
The embodiment of the specification provides an orthogonal sequence processing method of a wireless data center, wherein the wireless data center comprises a plurality of nodes, and can comprise a Map Node (Map Node) and a Reduce Node (Reduce Node) by way of example.
In the embodiment of the present specification, any node updates the length and the mapping relation of the orthogonal sequence according to the identified index Key (Key) and the number of the current orthogonal sequences in the wireless data center, and notifies all nodes of the updated orthogonal sequence and mapping relation.
Wherein, the mapping relation represents a one-to-one correspondence relation between the index key words and the orthogonal sequences, and the length of the orthogonal sequences is related to the number of the orthogonal sequences.
Specifically, after any node recognizes a new Key, it detects whether the orthogonal sequence in the wireless data center is enough, and determines whether there is an idle orthogonal sequence, if so, allocates an orthogonal sequence to the newly recognized Key, and informs other nodes of the mapping relationship between the Key and the orthogonal sequence, if there is no idle orthogonal sequence, that is, the number of orthogonal sequences is insufficient, the length of the orthogonal sequence can be increased, and the space of the orthogonal sequence is reconstructed, and then informs all nodes of the updated orthogonal sequence and mapping relationship.
Further, since the space of the entire orthogonal sequence has been reconstructed, the mapping relation of the original orthogonal sequence also needs to be reported again.
In the application, all nodes adopt the updated orthogonal sequence and mapping relation to transmit and process data.
The following describes in detail the case where any node updates the length and mapping relation of the orthogonal sequences according to the identified index key words and the number of the current orthogonal sequences in the wireless data center.
Specifically, after any node identifies an index keyword, judging whether to increase the length of an orthogonal sequence according to the number of the current orthogonal sequences; if not, an orthogonal sequence is allocated for the index key words; if yes, the length of the orthogonal sequence is increased, the space of the orthogonal sequence is reconstructed, and the mapping relation is updated.
Further, after any node identifies the index keyword, determining whether to increase the length of the orthogonal sequence according to the number of the current orthogonal sequences, including: when any node recognizes the index key word, judging whether the current orthogonal sequence is used completely; if yes, the length of the orthogonal sequence is increased; if not, the length of the orthogonal sequence does not need to be increased.
Through the steps, after any node recognizes a new Key, if the number of the orthogonal sequences is insufficient, the length of the orthogonal sequences is dynamically adjusted, so that the efficient operation of the wireless data center can be ensured.
In the present embodiment, the nodes include Reduce nodes. The Reduce node can update the length and the mapping relation of the orthogonal sequence according to the use condition and the time threshold value of the orthogonal sequence, and notify all nodes of the updated orthogonal sequence and the mapping relation; and all the nodes adopt the updated orthogonal sequence and mapping relation to transmit and process data.
The use cases of the orthogonal sequences may include: is in use and unused.
In the embodiment of the present disclosure, by setting the time threshold, when the time of the orthogonal sequence being unused exceeds the preset threshold, the mapping relationship between the corresponding Key and the orthogonal sequence may be recovered, the length of the orthogonal sequence may be reduced, the space of the orthogonal sequence may be reconstructed, and all nodes may be notified of the updated orthogonal sequence and mapping relationship, so that all nodes may perform data transmission and processing using the updated orthogonal sequence and mapping relationship.
Specifically, the use cases of orthogonal sequences include: the method comprises the steps that when the method is not used, the Reduce node updates the length and the mapping relation of the orthogonal sequence according to the use condition and the time threshold value of the orthogonal sequence, and the method comprises the following steps: when the Reduce node judges that the orthogonal sequence is not used, judging whether the time of the unused orthogonal sequence is larger than a time threshold value or not; if not, not processing; if so, the length of the orthogonal sequence is reduced, the space of the orthogonal sequence is reconstructed, and the mapping relation is updated.
In the embodiment of the application, because different keys are related to different tasks, after the network runs for a long time, due to the lack of some tasks, some keys and corresponding orthogonal sequences can be used in a stagnation mode. At this time, the mapping relation between the unused keys and the orthogonal sequences needs to be recovered, so as to avoid the problem of resource waste caused by allocation according to the fixed length of the orthogonal sequences, and ensure the efficient operation of the wireless data center.
The orthogonal sequence processing method of the line data center provided by the embodiment of the application can be applied to wireless data centers with various topological structures, and the following description is given by taking three topological structures as examples, and it is known that the three topological structures provided by the application do not cause any limitation to the content of the application.
In the embodiment of the specification, the nodes comprise a plurality of Map nodes and a Reduce node, the distance between each Map node and the Reduce node is the same, and the Map nodes form a circular topology with equal intervals around the Reduce node; the Map nodes and the Reduce nodes are connected through a wireless connection link and a wired connection link.
The wired connection link is used for realizing the updating of the orthogonal sequence and the mapping relation, and the wireless connection link is used for realizing the transmission and the processing of data.
Fig. 1 is a schematic structural diagram of a first topology structure of a wireless data center according to an embodiment of the present application, as shown in fig. 1, taking 5 nodes as an example, including four Map nodes (Map nodes), which are respectively: m1, M2, M3 and M4; one reduction Node (reduction Node), denoted R in fig. 1. All nodes have two links, one is a Wireless Link and one is a Wired Link.
In the present application, any node (including Map node and Reduce node) has two links, one is a Wired Link (Wired Link) indicated by a solid line and the other is a Wireless Link (Wireless Link) indicated by a broken line.
The allocation operation of the dynamic orthogonal sequence is called a control plane, and the data processing operation of the wireless transmission and calculation is called a data plane. At this time, the control plane is completed on the wired link side, and the data plane is completed on the wireless link side.
Allocation and addition mechanism of orthogonal sequences: in the working stage of the wireless data center, when the Key and the orthogonal sequence do not form a one-to-one mapping relation, the information of the Key, the orthogonal sequence and the mapping relation can be aligned on a control plane through the assistance of a wired connection link.
Fig. 2 is a schematic diagram of a first topology orthogonal sequence processing method of a wireless data center according to an embodiment of the present application, where, as shown in fig. 2, the method includes:
step S101: any node recognizes a new Key.
Step S102: judging whether there is enough orthogonal sequence, if yes, executing steps S103-S104, and if not, executing steps S105-S107.
Step S103: orthogonal sequences are assigned to keys.
Step S104: and notifying all nodes of the mapping relation between the Key and the orthogonal sequence through a wired connection link.
Step S105: the length of the orthogonal sequence is increased.
Step S106: the orthogonal sequence is updated for all keys.
Step S107: and notifying all nodes of the mapping relation between the Key and the orthogonal sequence through a wired connection link.
Specifically, after any node recognizes a new Key, it detects whether there is enough and idle orthogonal sequence. If so, immediately allocating an orthogonal sequence, and notifying other nodes of the mapping relation between the Key and the orthogonal sequence through a wired connection link. If the number of orthogonal sequences is insufficient, that is, if there is no free orthogonal sequence, it is necessary to increase the length of the orthogonal sequence and reconstruct the space of the orthogonal sequence, and then to reconstruct the mapping relation of all the updated orthogonal sequences (that is, the mapping relation of the original orthogonal sequences needs to be re-notified since the space of the entire orthogonal sequence is already reconstructed), and to notify all nodes to update through the wired connection link.
Fig. 3 is a schematic diagram of another method for processing an orthogonal sequence of a first topology structure of a wireless data center according to an embodiment of the present application, where, as shown in fig. 3, the method includes:
step S108: judging whether the orthogonal sequence is unused and whether the unused time is greater than a time threshold, if so, executing the steps S109-S111, and if not, executing the step S112.
Step S109: the length of the orthogonal sequence is reduced.
Step S110: the orthogonal sequence is updated for all keys.
Step S111: and notifying all nodes of the updated mapping relation between the Key and the orthogonal sequence through the wired connection link.
Step S112: the orthogonal sequences are not processed.
Specifically, since different keys are associated with different tasks, after a long period of network operation, due to the lack of some tasks, some keys and their corresponding orthogonal sequences may be stalled. In this case, it is necessary to collect the mapping relationship between these unused keys and orthogonal sequences. The recovery determination is performed by the Reduce node, and when the Reduce node determines that the orthogonal sequence is unused, the time for the use is greater than the time threshold. The whole network is informed of the need to reduce the length of the orthogonal sequences and reconstruct the space of the orthogonal sequences through the wired connection link. After that, it notifies the full network node of the updated orthogonal sequence and its mapping relation through the wired connection link.
In the embodiment of the specification, the nodes comprise a plurality of Map nodes and a Reduce node, the distance between each Map node and the Reduce node is the same, and the Map nodes form a circular topology with equal intervals around the Reduce node; the Map nodes and a Reduce node are connected through two wireless connection links; one wireless connection link is used for realizing the updating of the orthogonal sequence and the mapping relation, and the other wireless connection link is used for realizing the transmission and the processing of data.
Fig. 4 is a schematic structural diagram of a second wireless data center topology structure according to an embodiment of the present application, as shown in fig. 4, taking 5 nodes as an example, including four Map nodes (Map nodes), which are respectively: m1, M2, M3 and M4; one reduction Node (reduction Node), denoted R in fig. 4. All nodes are provided with two wireless connection links, namely a first wireless connection link (WirelessLink 1) and a second wireless connection link (WirelessLink 2).
In the embodiment of the present disclosure, any one node (including a Map node and a Reduce node) is provided with two wireless connection links. The two wireless connection links operate in the same manner as one wired connection link and one wireless connection link in the first topology described above, except that one wired connection link is replaced with a wireless connection link. The control plane is now completed on one radio link and the data plane is completed on the other radio link.
In the embodiment of the specification, the nodes comprise a plurality of Map nodes and a Reduce node, the distance between each Map node and the Reduce node is the same, and the Map nodes form a circular topology with equal intervals around the Reduce node; the Map nodes and the Reduce node are connected through a wireless connection link.
Wherein, a wireless control link is added in the wireless connection link of each node, and the wireless control link and the wireless connection link work simultaneously; the wireless connection link is used for realizing the updating of the orthogonal sequence and the mapping relation and the transmission and the processing of data; the wireless control link is used for suspending wireless transmission channels of all nodes through a relevant identification mechanism so that all nodes can update the orthogonal sequence and the mapping relation.
Wherein the relevant recognition mechanism comprises: and performing correlation calculation on the special identification sequence in the wireless control link and the received signal received by any node to obtain a correlation result, wherein the special identification sequence represents the orthogonal sequence and/or the mapping relation needs to be updated.
Fig. 5 is a schematic structural diagram of a third wireless data center topology structure provided in an embodiment of the present application, where, as shown in fig. 5, taking 5 nodes as an example, four Map nodes (Map nodes) are respectively: m1, M2, M3 and M4; one reduction Node (reduction Node), denoted R in fig. 5. All nodes have only one wireless connection link (WirelessLink).
In the embodiment of the present application, a radio control link is added to a radio connection link of each node, and fig. 6 is a schematic structural diagram of adding a radio control link to a radio connection link provided in the embodiment of the present application, and as shown in fig. 6, taking any node as an example, on hardware, a radio control link is additionally added to a radio connection link of a node, where the additional radio control link can work simultaneously with a conventional radio link, and a special identification sequence identifier is provided in the radio control link, so as to implement identification of a special identification sequence. The wireless control link adopts a wireless correlation recognition mechanism, and can recognize a special recognition sequence under the condition of very low signal-to-noise ratio (namely under the condition that the wireless control link is interfered by the traditional wireless connection link.
The basic principle is that for a special identification sequence (Sign) adopted by a wireless control link, correlation calculation is carried out, and the process of the correlation calculation can be represented by a formula (1):
； （1）
wherein Corr represents a correlation function; y represents a received signal; sign represents the sample signal value corresponding to the Sign sequence; l represents a coordinate index; l (L) Sign Representing the length of the Sign sequence;representative shift sample offset.
； （2）
In the formula (2), when the special recognition sequence (Sign) to be recognized is included in Y, the formula (1) may be further split into three terms to obtain the formula (3), and as shown in the formula (3), the three terms obtained after the splitting represent the target sequence to be recognized by Sign, SI represents self-interference (Self Interference), and Noise (Noise), respectively. Thus, equation (1) can be calculated as:
； （3）
when the Sign sequence is long enough, the correlation results are close to 0, i.e. since the SI, noise and Sign sequences are independent，. Only the target Sign signal, itself and itself being relatedThe result of this term corresponds in effect to the received power. In the cross-correlation spectrum, if the receiver is in a state of receiving Sign at the moment, a jump peak occurs; if no signal of Sign sequence is contained in the received signal at this time, the correlation result is close to 0. With the above aspects, the special sequence Sign can be identified in the presence of self-interference.
Further, unlike the wired connection link assistance, in the embodiment of the present application, an additional wireless control link is added to the wireless connection link. First, a default state of wireless network transmission will be described, where all nodes do not contend for transmission according to a standard carrier sense multiple access with collision avoidance (Carrier Sense Multiple Access with Collision Avoid, CSMA/CA) mechanism, but transmit in a fixed time slice, slotted manner. Fig. 7 is a schematic diagram of a wireless network transmission according to an embodiment of the present application, as shown in fig. 7, including 3 slots: time slot 1, time slot 2 and time slot 3, 4 nodes M1, M2, M3 and M4 in each time slot simultaneously transmit data, and when the wireless network works, all Map nodes are senders, and a Reduce node is a receiver. And the Map nodes transmit data simultaneously in a time slot-by-time slot mode. The channel does not have any idle state or time when it is idle to be accessed. Therefore, when the wireless network has a case where the similar Key is insufficient, it is impossible to update information in a state where the channel is occupied.
The embodiment of the application introduces the wireless control link. Fig. 8 is a schematic diagram of data transmission after adding a radio control link to a radio connection link, in which, as shown in fig. 8, a Sign sequence is sent when a node finds that an orthogonal sequence is insufficient. The special identification sequence can be identified by any node in the time when M1-M4 are transmitted in the channel. After the identification, the node stops the transmission at the next time, pauses and releases the channel. The usage rights of the channel are then acquired by the update node and updated mapping information about the orthogonal sequences is transmitted.
The procedure for realizing the updating of the orthogonal sequence and the mapping relation by the special identification sequence in the radio control link will be described below.
It can be known that Sign is mainly used for suspending and releasing channels to complete the updating of the orthogonal sequence and the mapping relation when the mapping relation needs to be updated in the situations of insufficient use of the orthogonal sequence or Key, etc.
In an alternative embodiment, after identifying the Sign sequence, the node stops transmission at the next time, pauses and releases the channel. Then, the usage rights of the channels are acquired by the update node, the orthogonal sequence and the mapping relation are updated, and the update regarding the orthogonal sequence and the mapping relation is transmitted.
In another alternative embodiment, sign sequences are used to suspend the current channel transmission.
Fig. 9 is a schematic diagram of a third topology orthogonal sequence processing method of a wireless data center according to an embodiment of the present application, where, as shown in fig. 9, the method includes:
step S201: any node recognizes a new Key.
Step S202: whether there is enough orthogonal sequence is determined, if yes, step S203 to step S205 are executed, and if not, step S206 to step S209 are executed.
Step S203: orthogonal sequences are assigned to keys.
Step S204: the transmission of the special identification sequence (Sign) pauses the current channel transmission.
Step S205: and notifying all nodes of the updated mapping relation through the wireless connection link.
Step S206: the length of the orthogonal sequence is increased.
Step S207: and updating the orthogonal sequence for all keys and updating the mapping relation.
Step S208: the transmission of the special identification sequence (Sign) pauses the current channel transmission.
Step S209: and notifying all nodes of the updated mapping relation through the wireless connection link.
The above-mentioned step of adding orthogonal sequences differs from the first topology only in that the transmission of the current channel is suspended by adding a special identification sequence (Sign) and all nodes are informed about the update of the mapping relationship by using the wireless connection link.
Further, fig. 10 is a schematic diagram of another method for processing an orthogonal sequence of a third topology structure of a wireless data center according to an embodiment of the present application, as shown in fig. 10, including:
step S210: judging whether the orthogonal sequence is unused and whether the unused time is greater than a time threshold, if so, executing steps S211-S214, and if not, executing step S215.
Step S211: the length of the orthogonal sequence is reduced.
Step S212: the orthogonal sequence is updated for all keys.
Step S213: the transmission of the special identification sequence (Sign) pauses the current radio channel transmission.
Step S214: and notifying all nodes of the updated mapping relation between the Key and the orthogonal sequence through the wireless connection link.
Step S215: the orthogonal sequences are not processed.
The above-described step of reducing the orthogonal sequence differs from the first topology only in that a transmission special identification sequence (Sign) is added to suspend the current channel transmission and all nodes are notified of the update of the mapping relationship using the wireless connection link.
The length of the orthogonal sequences and the number of sequences accommodated in the orthogonal sequences are closely related in the wireless data center, and the longer the sequences are, the more the number of the orthogonal sequences are, and the fewer the number of the orthogonal sequences are, conversely. Therefore, in many practical scenarios, since the network topology and the traffic flow have flexible characteristics, allocation according to the fixed orthogonal sequence length often causes waste of resources or insufficient resources, for example, excessive or insufficient allocated sequences.
The application provides a method for dynamically adjusting and configuring orthogonal sequences, which realizes the allocation of the orthogonal sequences according to the needs, thereby ensuring the efficient operation of a system.
The embodiment of the specification also provides an orthogonal sequence processing device of the wireless data center, which is suitable for the orthogonal sequence processing method of the wireless data center.
The embodiment of the specification also provides an electronic device, including: at least one processor; and a memory communicatively coupled to the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the orthogonal sequence processing method of the wireless data center.
The embodiment of the present specification also provides a chip, including: at least one processor; and a memory communicatively coupled to the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the orthogonal sequence processing method of the wireless data center.
In this specification, identical and similar parts of the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the product embodiments described later, since they correspond to the methods, the description is relatively simple, and reference is made to the description of parts of the system embodiments.
The foregoing is merely illustrative of the present application, and the present application is not limited thereto, and any changes or substitutions easily contemplated by those skilled in the art within the scope of the present application should be included in the present application. Therefore, the protection scope of the application is subject to the protection scope of the claims.
Claims (12)
1. An orthogonal sequence processing method of a wireless data center, the wireless data center including a plurality of Map nodes and a Reduce node, comprising:
any one node updates the length and the mapping relation of the orthogonal sequence according to the number of the identified index keywords and the current orthogonal sequence in the wireless data center, and informs all nodes of the updated orthogonal sequence and the mapping relation, wherein the mapping relation represents one-to-one correspondence between the index keywords and the orthogonal sequence, and different index keywords are related to different tasks;
and all the nodes adopt the updated orthogonal sequence and the mapping relation to transmit and process data.
2. The orthogonal sequence processing method of the wireless data center according to claim 1, wherein the updating the length and the mapping relation of the orthogonal sequences by any one of the nodes according to the identified index key words and the number of the current orthogonal sequences in the wireless data center comprises:
after any one of the nodes identifies the index key words, judging whether to increase the length of the orthogonal sequences according to the number of the orthogonal sequences at present;
if not, allocating one orthogonal sequence for the index key word;
if yes, the length of the orthogonal sequence is increased, the space of the orthogonal sequence is reconstructed, and the mapping relation is updated.
3. The method for processing the orthogonal sequence in the wireless data center according to claim 2, wherein after the node identifies the index key word, determining whether to increase the length of the orthogonal sequence according to the number of the orthogonal sequences currently comprises:
when any one of the nodes identifies the index key words, judging whether all the orthogonal sequences are used currently;
if yes, the length of the orthogonal sequence is increased;
if not, the length of the orthogonal sequence does not need to be increased.
4. The method of orthogonal sequence processing for a wireless data center of claim 1, wherein the node comprises a Reduce node;
the Reduce node updates the length of the orthogonal sequence and the mapping relation according to the use condition and the time threshold value of the orthogonal sequence, and informs all nodes of the updated orthogonal sequence and the mapping relation;
and all the nodes adopt the updated orthogonal sequence and the mapping relation to transmit and process data.
5. The method for processing the orthogonal sequence of the wireless data center according to claim 4, wherein the use case of the orthogonal sequence comprises: the Reduce node updates the length of the orthogonal sequence and the mapping relation according to the use condition of the orthogonal sequence and a time threshold value, and comprises the following steps:
when the Reduce node determines that the orthogonal sequence is not used, determining whether the time when the orthogonal sequence is not used is greater than the time threshold;
if not, not processing;
if yes, the length of the orthogonal sequence is reduced, the space of the orthogonal sequence is reconstructed, and the mapping relation is updated.
6. The method of orthogonal sequence processing in a wireless data center according to any one of claims 1 to 5, wherein the nodes include a plurality of Map nodes and a Reduce node, each Map node is located at the same distance from the Reduce node, and the Map nodes form a circular topology with equal intervals around the Reduce node;
the Map nodes and the Reduce nodes are connected through a wireless connection link and a wired connection link;
the wired connection link is used for realizing the updating of the orthogonal sequence and the mapping relation;
the wireless connection link is used for realizing the transmission and the processing of the data.
7. The method of orthogonal sequence processing in a wireless data center according to any one of claims 1 to 5, wherein the nodes include a plurality of Map nodes and a Reduce node, each Map node is located at the same distance from the Reduce node, and the Map nodes form a circular topology with equal intervals around the Reduce node;
the Map nodes and one Reduce node are connected through two wireless connection links;
one wireless connection link is used for realizing the updating of the orthogonal sequence and the mapping relation, and the other wireless connection link is used for realizing the transmission and the processing of the data.
8. The method of orthogonal sequence processing in a wireless data center according to any one of claims 1 to 5, wherein the nodes include a plurality of Map nodes and a Reduce node, each Map node is located at the same distance from the Reduce node, and the Map nodes form a circular topology with equal intervals around the Reduce node;
the Map nodes and the Reduce nodes are connected through a wireless connection link;
adding a wireless control link to the wireless connection link of each node, wherein the wireless control link and the wireless connection link work simultaneously;
the wireless connection link is used for realizing the updating of the orthogonal sequence and the mapping relation, and the transmission and the processing of the data;
the wireless control link is used for suspending wireless transmission channels of all the nodes through a relevant identification mechanism so that all the nodes update the orthogonal sequence and the mapping relation.
9. The orthogonal sequence processing method of a wireless data center according to claim 8, wherein the correlation recognition mechanism comprises:
and carrying out correlation calculation on a special identification sequence in the wireless control link and a received signal received by any node to obtain a correlation result, wherein the special identification sequence characterizes the orthogonal sequence and/or the mapping relation needs to be updated.
10. An orthogonal sequence processing apparatus for a wireless data center, characterized by being adapted to the orthogonal sequence processing method for a wireless data center according to any one of claims 1 to 9.
11. An electronic device, comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the orthogonal sequence processing method of the wireless data center of any one of claims 1-9.
12. A chip, comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the orthogonal sequence processing method of the wireless data center of any one of claims 1-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310580174.9A CN116318561B (en) | 2023-05-23 | 2023-05-23 | Orthogonal sequence processing method, device, equipment and chip of wireless data center |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310580174.9A CN116318561B (en) | 2023-05-23 | 2023-05-23 | Orthogonal sequence processing method, device, equipment and chip of wireless data center |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116318561A CN116318561A (en) | 2023-06-23 |
| CN116318561B true CN116318561B (en) | 2023-09-19 |
Family
ID=86815311
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310580174.9A Active CN116318561B (en) | 2023-05-23 | 2023-05-23 | Orthogonal sequence processing method, device, equipment and chip of wireless data center |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116318561B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101218775A (en) * | 2005-09-30 | 2008-07-09 | 华为技术有限公司 | Multi-user access system MIMO-OFDM resource distributing method |
| CN101521849A (en) * | 2008-02-25 | 2009-09-02 | 上海华为技术有限公司 | Method for assigning resources as well as system and device thereof |
| CN102869096A (en) * | 2011-07-06 | 2013-01-09 | 上海贝尔股份有限公司 | Method and device for transmitting demodulation reference signals in communication network |
| CN103269258A (en) * | 2008-01-07 | 2013-08-28 | Lg电子株式会社 | Method for scheduling distributed virtual resource blocks |
| CN103857045A (en) * | 2014-03-06 | 2014-06-11 | 南京理工大学 | Resource distribution method of cognition OFDM network based on spectrum lining and filling |
| CN103973629A (en) * | 2014-05-27 | 2014-08-06 | 电子科技大学 | SLM (selective mapping) method for reducing PAPR (peak to average power ratio) of MIMO-OFDM (multiple input multiple output-orthogonal frequency division multiplexing) system |
| CN104794231A (en) * | 2015-05-04 | 2015-07-22 | 罗敬宁 | Unstructured data processing method and device based on Map/Reduce |
| CN106954272A (en) * | 2016-01-07 | 2017-07-14 | 中兴通讯股份有限公司 | A kind of resource regulating method, apparatus and system |
| CN107947892A (en) * | 2017-12-27 | 2018-04-20 | 西安科锐盛创新科技有限公司 | A kind of orthogonal sequence set construction method based on semi bent functions |
| CN113660187A (en) * | 2021-07-02 | 2021-11-16 | 湖南艾科诺维科技有限公司 | Orthogonal multi-carrier sending method, receiving method and device based on random phase rotation |
| CN115474237A (en) * | 2021-06-11 | 2022-12-13 | 华为技术有限公司 | Data transmission method and device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009130280A2 (en) * | 2008-04-23 | 2009-10-29 | Nokia Siemens Networks Oy | Flexible map coding for wireless networks |
| US20210160021A1 (en) * | 2019-11-27 | 2021-05-27 | Electronics And Telecommunications Research Institute | Method and apparatus for transmitting and receiving signal using orthogonal sequence in communication system |
| US11728918B2 (en) * | 2020-04-10 | 2023-08-15 | Qualcomm Incorporated | Multi-bit payload transmission with orthogonal sequences |
-
2023
- 2023-05-23 CN CN202310580174.9A patent/CN116318561B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101218775A (en) * | 2005-09-30 | 2008-07-09 | 华为技术有限公司 | Multi-user access system MIMO-OFDM resource distributing method |
| CN103269258A (en) * | 2008-01-07 | 2013-08-28 | Lg电子株式会社 | Method for scheduling distributed virtual resource blocks |
| CN101521849A (en) * | 2008-02-25 | 2009-09-02 | 上海华为技术有限公司 | Method for assigning resources as well as system and device thereof |
| CN102869096A (en) * | 2011-07-06 | 2013-01-09 | 上海贝尔股份有限公司 | Method and device for transmitting demodulation reference signals in communication network |
| CN103857045A (en) * | 2014-03-06 | 2014-06-11 | 南京理工大学 | Resource distribution method of cognition OFDM network based on spectrum lining and filling |
| CN103973629A (en) * | 2014-05-27 | 2014-08-06 | 电子科技大学 | SLM (selective mapping) method for reducing PAPR (peak to average power ratio) of MIMO-OFDM (multiple input multiple output-orthogonal frequency division multiplexing) system |
| CN104794231A (en) * | 2015-05-04 | 2015-07-22 | 罗敬宁 | Unstructured data processing method and device based on Map/Reduce |
| CN106954272A (en) * | 2016-01-07 | 2017-07-14 | 中兴通讯股份有限公司 | A kind of resource regulating method, apparatus and system |
| CN107947892A (en) * | 2017-12-27 | 2018-04-20 | 西安科锐盛创新科技有限公司 | A kind of orthogonal sequence set construction method based on semi bent functions |
| CN115474237A (en) * | 2021-06-11 | 2022-12-13 | 华为技术有限公司 | Data transmission method and device |
| CN113660187A (en) * | 2021-07-02 | 2021-11-16 | 湖南艾科诺维科技有限公司 | Orthogonal multi-carrier sending method, receiving method and device based on random phase rotation |
Non-Patent Citations (1)
| Title |
|---|
| Huawei, HiSilicon.R1-1708141 "Common UL/DL DMRS design".3GPP tsg_ran\WG1_RL1.2017,(第TSGR1_89期),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116318561A (en) | 2023-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2316228B1 (en) | Methods and apparatus for communicating discovery information | |
| US8630307B2 (en) | Methods and apparatus for traffic contention resource allocation | |
| CN111148240B (en) | Resource allocation method and device | |
| US8385826B2 (en) | Methods and apparatus for supporting communication over different ranges in a wireless network | |
| WO2019033609A1 (en) | Resource selection method and apparatus for device-to-device/vehicle-to-everything communication supporting carrier aggregation | |
| CN108462999B (en) | Method and equipment for resource allocation | |
| US8902903B2 (en) | Assigning slots in a mesh network | |
| EP3952323B1 (en) | Frequency spectrum allocation method and apparatus | |
| EP4102920A1 (en) | Communication method and related apparatus | |
| Batta et al. | A distributed weight-based tdma scheduling algorithm for latency improvement in iot | |
| CN116318561B (en) | Orthogonal sequence processing method, device, equipment and chip of wireless data center | |
| EP2730142B1 (en) | Method and apparatus for supporting multicast communications | |
| CN113163510B (en) | Communication networking method, device and storage medium | |
| CN104009937A (en) | Enhanced-transmission-selection configuration information transmission method and device | |
| CN112004232A (en) | LTE (Long term evolution) and NR (noise reduction) resource sharing method and device | |
| KR20170040733A (en) | Apparatus and method of communicating for allocating non-orthogonal resource | |
| CN109076594B (en) | Method and device for accessing low-power-consumption terminal to network | |
| CN116261125A (en) | Energy collection D2D communication resource allocation method based on energy efficiency optimization | |
| CN111065160B (en) | Resource allocation method and device, storage medium and electronic device | |
| CN114521025B (en) | Time slot allocation method and device for wireless ad hoc network and electronic equipment | |
| WO2021033762A1 (en) | Wireless communication device and notification method | |
| EP4346288A1 (en) | Method for determining service access point, and information sending method, communication node and storage medium | |
| CN115699657B (en) | Information transmission method and device | |
| Yoo et al. | N-Dimensional Markov Chain Analysis of the Starvation Issue for IEEE 802.15. 6 Slotted Aloha Algorithm | |
| CN115348132A (en) | Data transmission method, equipment node, industrial intelligent bus and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |