CN113542038B - Communication processing system for blocking service data in different deployment modes - Google Patents

Communication processing system for blocking service data in different deployment modes Download PDF

Info

Publication number
CN113542038B
CN113542038B CN202111084157.3A CN202111084157A CN113542038B CN 113542038 B CN113542038 B CN 113542038B CN 202111084157 A CN202111084157 A CN 202111084157A CN 113542038 B CN113542038 B CN 113542038B
Authority
CN
China
Prior art keywords
deployment
service data
endpoints
endpoint
service
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
Application number
CN202111084157.3A
Other languages
Chinese (zh)
Other versions
CN113542038A (en
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.)
Global Digital Group Co Ltd
Original Assignee
Global Digital Group 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 Global Digital Group Co Ltd filed Critical Global Digital Group Co Ltd
Priority to CN202111084157.3A priority Critical patent/CN113542038B/en
Publication of CN113542038A publication Critical patent/CN113542038A/en
Application granted granted Critical
Publication of CN113542038B publication Critical patent/CN113542038B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0803Configuration setting
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0896Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities

Abstract

The invention provides a communication processing system for blocking service data in different deployment modes, which is characterized by comprising a plurality of deployment endpoints, a communication module, an analysis processing module and a block recording module, wherein the deployment endpoints are used for generating the service data, the communication module is used for transmitting data between the deployment endpoints and the analysis processing module, the analysis processing module is used for analyzing and processing the service data, and the block recording module is used for packaging and recording the processed service data. The analysis processing module can efficiently process different service data and allocate bandwidth resources of the communication module according to a time chain and a space chain of complete service data, so that the communication efficiency between the deployment endpoints is improved.

Description

Communication processing system for blocking service data in different deployment modes
Technical Field
The invention relates to the technical field of data processing, in particular to a communication processing system for blocking service data in different deployment modes.
Background
Most of the current service data processing is performed in a system in the same area, and when the service data needs to be processed across ranges or in different deployment modes, the processing efficiency of the service data is greatly reduced, and meanwhile, the integration of the service data and how to perform blocking become a big problem.
Now, many communication processing systems have been developed, and through a lot of search and reference, it is found that the existing communication processing systems are disclosed as KR100333052B1, KR100994240B1, CN102595380B and KR100671506B1, and the method comprises: the communication equipment acquires equipment information corresponding to each user equipment; each piece of equipment information comprises equipment identification; setting one user device as a master device and other user devices as slave devices; triggering a main data channel to be established between the main equipment and the network side equipment, and sending a first enhanced service request to the network side equipment through the main data channel; the first enhanced service request comprises a device identification corresponding to the slave device; and after receiving a first enhanced service authorization message sent by the network side equipment in response to the first enhanced service request through the main data channel, triggering the slave equipment and the network side equipment to establish a slave data channel. However, the system has greatly reduced service data processing efficiency in different deployment modes, and meanwhile, the integration speed of the service data is low, and the block correlation degree is not high.
Disclosure of Invention
The invention aims to provide a communication processing system for blocking service data under different deployment modes aiming at the existing defects,
the invention adopts the following technical scheme:
a communication processing system for blocking service data in different deployment modes comprises a plurality of deployment endpoints, a communication module, an analysis processing module and a block recording module, wherein the deployment endpoints are used for generating service data, the communication module is used for transmitting data between the deployment endpoints and the analysis processing module, the analysis processing module is used for analyzing and processing the service data, and the block recording module is used for packaging and recording the processed service data;
the analysis processing module calculates the coupling degree k from the deployment endpoint A to the deployment endpoint B according to the time chain and the space chain:
Figure 100002_DEST_PATH_IMAGE001
wherein n iszRepresenting the total times of the A deployment endpoints appearing in the spatial chain, n representing the total times of the B deployment endpoints in the spatial chain immediately after the A deployment endpoints, t (i) representing the time interval of the ith time of the B deployment endpoint and the A deployment endpoint for sending the service data, t' being a standard time interval, the A deployment endpoint and the B deployment endpoint being any two different deployment endpoints;
the analysis processing module distributes bandwidth resources Z' (xm, ym) between each deployment endpoint in the communication module according to the coupling degree:
Figure 262899DEST_PATH_IMAGE002
wherein, Z (D)xm,Dym) Represents DxmDeployment endpoint and DymDeploying bandwidth resources of an endpoint direct connection, Zmax(xm, ym) denotes DxmDeployment endpoint and DymMaximum theoretical bandwidth resources for deployment endpoints, { Dxm,,DymDenotes a pair of deployment endpoints, k, that are in progress for data transmissionmIs { Dxm,,DymThe coupling degree of the deployment end point pairs is arranged in descending order, n is the number of the deployment end point pairs which are in data transmission, and the value range of m is [1, n ]];
Further, the deployment end point sends a service packet in the end point network, the other deployment end points send feedback packets after receiving the service packet, the deployment end point for performing subsequent service processing is determined according to the processing time in the feedback packets, and the deployment end point sending the service packet sends detailed service data to the deployment end point sending the feedback packets;
further, when the service packet sent by the deployment endpoint includes an end mark, the service packet is the last part of data in the whole service data, and the rest deployment endpoints do not send a feedback packet after receiving the service packet;
further, the deployment endpoint DiTo deployment endpoint DjTheoretical maximum bandwidth resource ZmaxThe calculation formula of (i, j) is:
Figure 100002_DEST_PATH_IMAGE003
wherein the min (a, b) function represents taking the smaller of a and b;
further, the block recording module judges whether the blocks need to be packed according to the calculation result of the following formula:
Figure 382794DEST_PATH_IMAGE004
wherein S isiSize of the ith unpacked service data set, T, representing backlogiGeneration time, T, of the ith unpacked service data set representing backlognowRepresenting the current time, wherein T' is a time threshold, n is the number of backlogged service data sets which are not packed, and P is an urgent value;
when P is present>
Figure 100002_DEST_PATH_IMAGE005
In time, it means that all service data sets that are not packed need to be packed, where S' is a spatial threshold.
The beneficial effects obtained by the invention are as follows:
the deployment endpoint of the system can add characteristic information when sending a data packet, the characteristic information is used for determining the deployment endpoint of subsequent processing service and facilitating the analysis processing module to integrate a large amount of data information, the analysis processing module can count time chains and space chains of integrated complete service data, calculate the coupling degree from one deployment endpoint to another deployment endpoint according to the time chains and the space chains, distribute bandwidth resources according to the coupling degree, improve the communication efficiency in a deployment endpoint network and accelerate the processing speed of the service information, and the system can record the complete service data by using a block chain and facilitate the tracing of workers.
Drawings
The invention will be further understood from the following description in conjunction with the accompanying drawings. The components in the figures are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the embodiments. Like reference numerals designate corresponding parts throughout the different views.
FIG. 1 is a schematic view of an overall structural framework;
fig. 2 is a schematic diagram of a service data receiving process;
FIG. 3 is a schematic diagram of a time chain and a space chain of complete service data;
FIG. 4 is a diagram of theoretical maximum bandwidth resources;
fig. 5 is a schematic diagram illustrating the effect of bandwidth resource allocation.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail below with reference to embodiments thereof; it should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. Other systems, methods, and/or features of the present embodiments will become apparent to those skilled in the art upon review of the following detailed description. It is intended that all such additional systems, methods, features and advantages be included within this description, be within the scope of the invention, and be protected by the accompanying claims. Additional features of the disclosed embodiments are described in, and will be apparent from, the detailed description that follows.
The same or similar reference numerals in the drawings of the embodiments of the present invention correspond to the same or similar components; in the description of the present invention, it should be understood that if there is an orientation or positional relationship indicated by terms such as "upper", "lower", "left", "right", etc., based on the orientation or positional relationship shown in the drawings, it is only for convenience of description and simplification of description, but it is not indicated or implied that the device or component referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore, the terms describing the positional relationship in the drawings are only used for illustrative purposes and are not to be construed as limitations of the present patent, and specific meanings of the terms may be understood by those skilled in the art according to specific situations.
The first embodiment.
The embodiment provides a communication processing system for blocking service data in different deployment modes, which, with reference to fig. 1, includes a plurality of deployment endpoints, a communication module, an analysis processing module and a block recording module, where the deployment endpoints are used to generate service data, the communication module is used to transmit data between the deployment endpoints and the analysis processing module, the analysis processing module is used to analyze and process the service data, and the block recording module is used to package and record the processed service data;
the analysis processing module calculates the coupling degree k from the deployment endpoint A to the deployment endpoint B according to the time chain and the space chain:
Figure 321800DEST_PATH_IMAGE006
wherein n iszRepresenting the total times of the A deployment endpoints appearing in the spatial chain, n representing the total times of the B deployment endpoints in the spatial chain immediately after the A deployment endpoints, t (i) representing the time interval of the ith time of the B deployment endpoint and the A deployment endpoint for sending the service data, t' being a standard time interval, the A deployment endpoint and the B deployment endpoint being any two different deployment endpoints;
the analysis processing module distributes bandwidth resources Z' (xm, ym) between each deployment endpoint in the communication module according to the coupling degree:
Figure DEST_PATH_IMAGE007
wherein, Z (D)xm,Dym) Represents DxmDeployment endpoint and DymDeploying bandwidth resources of an endpoint direct connection, Zmax(xm, ym) denotes DxmDeployment endpoint and DymMaximum theoretical bandwidth resources for deployment endpoints, { Dxm,,DymDenotes a pair of deployment endpoints, k, that are in progress for data transmissionmIs { Dxm,,DymThe coupling degree of the deployment end point pairs is in descending order, n is the number of the deployment end point pairs which are in data transmission, and the value range of m is[1,n];
The deployment end points send service packets in the end point network, the other deployment end points send feedback packets after receiving the service packets, the deployment end points which carry out subsequent service processing are determined according to the processing time in the feedback packets, and the deployment end points which send the service packets send detailed service data to the deployment end points which send the feedback packets;
when the service packet sent by the deployment end point contains an end mark, the service packet is represented as the last part data in the whole service data, and the rest deployment end points do not send a feedback packet after receiving the service packet;
the deployment endpoint DiTo deployment endpoint DjTheoretical maximum bandwidth resource ZmaxThe calculation formula of (i, j) is:
Figure 301519DEST_PATH_IMAGE008
wherein the min (a, b) function represents taking the smaller of a and b;
the block recording module judges whether the blocks need to be packed according to the calculation result of the following formula:
Figure DEST_PATH_IMAGE009
wherein S isiSize of the ith unpacked service data set, T, representing backlogiGeneration time, T, of the ith unpacked service data set representing backlognowRepresenting the current time, wherein T' is a time threshold, n is the number of backlogged service data sets which are not packed, and P is an urgent value;
when P is present>
Figure 224345DEST_PATH_IMAGE010
In time, it means that all service data sets that are not packed need to be packed, where S' is a spatial threshold.
Example two.
The embodiment includes all contents of the first embodiment, and provides a communication processing system for blocking service data in different deployment modes, which includes a plurality of deployment endpoints, a communication module, an analysis processing module and a block recording module, wherein the deployment endpoints are used for generating service data, the service data is sent to the analysis processing module through the communication module, the analysis processing module sends highly-correlated service data to the block recording module after processing the service data, the block recording module packs the received service data into blocks and stores the blocks, and all the deployment endpoints and the communication module form an endpoint network;
the service data generated by the deployment endpoint has discreteness, wherein the discreteness refers to the discreteness that part of service data forming a complete service data is generated by different deployment endpoints at different time intervals, and is in a spatial and temporal dual level, and the deployment endpoint and the generation time of the part of service data generated after the part of service data generated firstly cannot be determined;
with reference to fig. 2, when the deployment endpoint sends service data to the analysis processing module, a service packet is broadcast in the endpoint network, where the service packet includes two parts of content, one part is a packet header, the other part is necessary information of the service data, after the rest of the deployment endpoints receive the service packet, if it is determined to perform subsequent processing, a feedback packet is broadcast in the endpoint network, where the feedback packet includes two parts of content, one part is a packet header, the other part is processing time, the packet header of the feedback packet is consistent with the packet header of the service packet to be processed, if the processing time of receiving the other feedback packet by one deployment endpoint is earlier than the processing time of the feedback packet sent by itself, the deployment endpoint does not process the corresponding service packet any more, and the service packet is processed by the deployment endpoint that sends the feedback packet with the earliest processing time, and if the deployment endpoint sends the last part of the complete service data, the service package broadcast by the deployment endpoint in the endpoint network also includes an end marker;
the deployment endpoint sending the service package obtains deployment endpoint information for processing subsequent services according to the information of the feedback package within a certain time after sending the service package, and sends detailed information required for processing the subsequent services to the corresponding deployment endpoint;
the deployment endpoint comprises a packet header library, wherein the packet header library records the packet headers of all service packets broadcasted in an endpoint network, when the deployment endpoint needs to broadcast a new service packet, the used packet header needs not to be repeated with the packet headers in the packet header library, meanwhile, the new packet header is added into the packet header library after broadcasting, and when the deployment endpoint receives the service packet containing an end mark, the packet header of the service packet is deleted in the packet header library;
the difference between the information packet sent by the deployment endpoint to the analysis processing module and the service packet broadcast in the endpoint network is that: the service data in the service packet is necessary information, the service data in the information packet is all information, the analysis processing module applies for an area for storing the information packet when receiving a new packet header information packet, all subsequently received information packets with the same packet header are stored in the area, and when receiving an information packet with an end mark, all information packets in the corresponding area are sent to the block recording module, and the storage area is cancelled;
the block recording module deletes the packet header information in the received information packet and processes the packet header information to obtain a service data set, simultaneously packing a plurality of service data sets into a block, wherein each service data set has a respective size S and a generation time T, when the sum of the sizes of the backlogged service data sets, which are not packed into blocks, is larger, the urgency of packing into blocks is higher, when the generation time of the backlogged service data set which is not packed into blocks is earlier, the urgency of packing into blocks is higher, wherein, the block recording module is provided with two thresholds S ' and T ', when the sum of the sizes of the backlogged service data sets which are not packed into blocks exceeds S ', the blocks need to be packed immediately, when the difference between the generation time of the backlogged oldest service data set unpacked into chunks and the current time exceeds T', and (3) packing immediately, and judging whether packing is needed according to the calculation result of the following formula under other conditions:
Figure DEST_PATH_IMAGE011
wherein S isiSize of the ith unpacked service data set, T, representing backlogiGeneration time, T, of the ith unpacked service data set representing backlognowRepresenting the current time, wherein n is the number of backlogged service data sets which are not packed, and P is an urgent value;
when P is present>
Figure 95349DEST_PATH_IMAGE010
When so, the package is required;
with reference to fig. 3, the analysis processing module analyzes the information packets of the complete service data to obtain two pieces of chain data, one piece of chain data is time chain data and records the sending time interval of two adjacent information packets of the complete service data, and the other piece of chain data is space chain data and records the sequence of the deployment endpoints participating in the complete service data, for example, the time chain of one complete service data is (t) t1,t2) The space chain is (D)1,D2,D3) Denotes D1If the deployment end point sends the first service packet at the moment t first, D2The deployment endpoint processes the first service packet at (t + t)1) Sending a second service packet at a time, D3The deployment endpoint processes the second service packet at (t + t)1+t2) Sending a third service packet at all times;
the analysis processing module performs summary statistics on the two-link data of all complete service data to obtain a coupling coefficient k between two deployment endpoints, for example, D1Deploying endpoints to D2The formula for calculating the coupling coefficient k between the deployment endpoints is:
Figure 980872DEST_PATH_IMAGE012
wherein n iszRepresenting the occurrence of D in a spatial chain1Total number of times endpoints are deployed, n represents D in the space chain2Deploying end point immediately D1The total number of times after the endpoint was deployed, t (i), represents the ith time D2Deployment endpoint and D1Deploying an information packet sending time interval of an endpoint, wherein t' is a standard time interval;
with reference to fig. 4, the communication module allocates bandwidth resources between deployment endpoints through the coupling coefficient, and is directly connected to Di,DjThe bandwidth resources of the two deployment endpoints are denoted as Z (D)i,Dj) From said D, theniDeploying endpoints to DjTheoretical maximum bandwidth resource Z of deployment endpointsmax(i, j) is:
Figure DEST_PATH_IMAGE013
wherein the min (a, b) function represents taking the smaller of a and b;
referring to FIG. 5, when data transmission between the deployed endpoints is required, R (D) is usedi,Dj) Representing the transfer of data from Di deployment endpoint to DjThe task of deploying the end point, if only one task exists at the same time, directly using the maximum bandwidth resource for data transmission, if a plurality of tasks exist at the same time, the bandwidth resource needs to be allocated according to the coupling coefficient, and the allocation method comprises the following steps:
s1, sorting all tasks from top to bottom according to the coupling coefficients of the two corresponding deployment endpoints, wherein the sorted tasks are R (D)x1,Dy1)、R(Dx2,Dy2)、...、R(Dxn,Dyn) The corresponding coupling coefficient is denoted as k1、k2、...、knWherein n is the number of simultaneous tasks;
s2, selecting the first task R (D) in the sequencexm,Dym) The occupied bandwidth resource Z' (xm, ym) includes DxmAnd DymAll of the remaining bandwidth resources between the deployed endpoints and a portion of the bandwidth resources between the remaining deployed endpoints are formulated as:
Figure 380760DEST_PATH_IMAGE014
wherein k is0=0;
S3, deleting the first task in the sequence, and the bandwidth resource occupied by the task is not participated in the subsequent calculation processing any more;
and S4, repeating the step S2 and the step S3 until the bandwidth resources of all the tasks are completely allocated.
Although the invention has been described above with reference to various embodiments, it should be understood that many changes and modifications may be made without departing from the scope of the invention. That is, the methods, systems, and devices discussed above are examples. Various configurations may omit, substitute, or add various procedures or components as appropriate. For example, in alternative configurations, the methods may be performed in an order different than that described, and/or various components may be added, omitted, and/or combined. Moreover, features described with respect to certain configurations may be combined in various other configurations, as different aspects and elements of the configurations may be combined in a similar manner. Further, elements therein may be updated as technology evolves, i.e., many elements are examples and do not limit the scope of the disclosure or claims.
Specific details are given in the description to provide a thorough understanding of the exemplary configurations including implementations. However, configurations may be practiced without these specific details, for example, well-known circuits, processes, algorithms, structures, and techniques have been shown without unnecessary detail in order to avoid obscuring the configurations. This description provides example configurations only, and does not limit the scope, applicability, or configuration of the claims. Rather, the foregoing description of the configurations will provide those skilled in the art with an enabling description for implementing the described techniques. Various changes may be made in the function and arrangement of elements without departing from the spirit or scope of the disclosure.
In conclusion, it is intended that the foregoing detailed description be regarded as illustrative rather than limiting, and that it be understood that these examples are illustrative only and are not intended to limit the scope of the invention. After reading the description of the invention, the skilled person can make various changes or modifications to the invention, and these equivalent changes and modifications also fall into the scope of the invention defined by the claims.

Claims (4)

1. A communication processing system for blocking service data in different deployment modes is characterized by comprising a plurality of deployment endpoints, a communication module, an analysis processing module and a block recording module, wherein the deployment endpoints are used for generating service data, the communication module is used for transmitting data between the deployment endpoints and the analysis processing module, the analysis processing module is used for analyzing and processing the service data, and the block recording module is used for packaging and recording the processed service data;
the analysis processing module calculates the coupling degree k from the deployment endpoint A to the deployment endpoint B according to the time chain and the space chain:
Figure DEST_PATH_IMAGE001
wherein n iszRepresenting the total times of the A deployment endpoints appearing in the spatial chain, n representing the total times of the B deployment endpoints in the spatial chain immediately after the A deployment endpoints, t (i) representing the time interval of the ith time of the B deployment endpoint and the A deployment endpoint for sending the service data, t' being a standard time interval, the A deployment endpoint and the B deployment endpoint being any two different deployment endpoints;
the analysis processing module distributes bandwidth resources Z' (xm, ym) between each deployment endpoint in the communication module according to the coupling degree:
Figure 451626DEST_PATH_IMAGE002
wherein, Z (D)xm,Dym) Represents DxmDeployment endpoint and DymDeploying bandwidth resources of an endpoint direct connection, Zmax(xm, ym) denotes DxmDeployment endpoint and DymMaximum theoretical bandwidth resources for deployment endpoints, { Dxm,,DymDenotes a pair of deployment endpoints, k, that are in progress for data transmissionmIs { Dxm,,DymThe coupling degree of the deployment end point pairs is arranged in descending order, n is the number of the deployment end point pairs which are in data transmission, and the value range of m is [1, n ]];
The block recording module deletes the packet header information in the received information packet and processes the packet header information to obtain a service data set, simultaneously packing a plurality of service data sets into a block, wherein each service data set has a respective size S and a generation time T, when the sum of the sizes of the backlogged service data sets, which are not packed into blocks, is larger, the urgency of packing into blocks is higher, when the generation time of the backlogged service data set which is not packed into blocks is earlier, the urgency of packing into blocks is higher, wherein, the block recording module is provided with two thresholds S ' and T ', when the sum of the sizes of the backlogged service data sets which are not packed into blocks exceeds S ', the blocks need to be packed immediately, when the difference between the generation time of the backlogged oldest service data set unpacked into chunks and the current time exceeds T', and (3) packing immediately, and judging whether packing is needed according to the calculation result of the following formula under other conditions:
Figure DEST_PATH_IMAGE003
wherein S isiSize of the ith unpacked service data set, T, representing backlogiGeneration time, T, of the ith unpacked service data set representing backlognowRepresenting the current time, wherein n is the number of backlogged service data sets which are not packed, and P is an urgent value;
when P is present>
Figure 40870DEST_PATH_IMAGE004
When, it indicates that packing is required.
2. The communication processing system for blocking service data in different deployment modes according to claim 1, wherein the deployment endpoints send service packets in an endpoint network, the other deployment endpoints send feedback packets after receiving the service packets, the deployment endpoints for performing subsequent service processing are determined according to processing time in the feedback packets, and the deployment endpoints sending the service packets send detailed service data to the deployment endpoints sending the feedback packets.
3. The communication processing system for blocking service data in different deployment modes according to claim 2, wherein when a service packet sent by the deployment endpoint includes an end flag, the service packet is the last part of the entire service data, and the remaining deployment endpoints do not send any feedback packet after receiving the end flag.
4. The communication processing system for blocking service data in different deployment modes according to claim 3, wherein the deployment endpoint DiTo deployment endpoint DjTheoretical maximum bandwidth resource ZmaxThe calculation formula of (i, j) is:
Figure DEST_PATH_IMAGE005
wherein the min (a, b) function represents taking the smaller of a and b.
CN202111084157.3A 2021-09-16 2021-09-16 Communication processing system for blocking service data in different deployment modes Active CN113542038B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111084157.3A CN113542038B (en) 2021-09-16 2021-09-16 Communication processing system for blocking service data in different deployment modes

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111084157.3A CN113542038B (en) 2021-09-16 2021-09-16 Communication processing system for blocking service data in different deployment modes

Publications (2)

Publication Number Publication Date
CN113542038A CN113542038A (en) 2021-10-22
CN113542038B true CN113542038B (en) 2021-11-26

Family

ID=78092712

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111084157.3A Active CN113542038B (en) 2021-09-16 2021-09-16 Communication processing system for blocking service data in different deployment modes

Country Status (1)

Country Link
CN (1) CN113542038B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108494812A (en) * 2018-01-22 2018-09-04 北京工业大学 A kind of NDN network communication methods for supporting block chain business
CN108805704A (en) * 2018-05-16 2018-11-13 深圳市网心科技有限公司 Block chain service implementation method, audiomonitor, storage medium and system

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102595380B (en) * 2012-01-06 2015-04-08 华为终端有限公司 Data service processing method, equipment and communication system
CN103491545B (en) * 2013-09-09 2017-01-25 京信通信系统(中国)有限公司 Inter-base station coupling degree measuring method and system and radio resource distribution method and system
US10348572B1 (en) * 2018-01-20 2019-07-09 Facebook, Inc. Dynamic bandwidth allocation for wireless mesh networks
US10630378B2 (en) * 2018-02-09 2020-04-21 Lockheed Martin Corporation Bandwidth optimizing range adjustments among satellites

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108494812A (en) * 2018-01-22 2018-09-04 北京工业大学 A kind of NDN network communication methods for supporting block chain business
CN108805704A (en) * 2018-05-16 2018-11-13 深圳市网心科技有限公司 Block chain service implementation method, audiomonitor, storage medium and system

Also Published As

Publication number Publication date
CN113542038A (en) 2021-10-22

Similar Documents

Publication Publication Date Title
US6449267B1 (en) Method and apparatus for medium access control from integrated services packet-switched satellite networks
CN107682434B (en) Underwater sensor network architecture and implementation method thereof
CN101808033B (en) Method and apparatus for allocating reservation bandwidth of traffic
He et al. Minimizing age of correlated information for wireless camera networks
CN110418376A (en) Data transmission method and device
CN105210438A (en) Wireless communication system, mobile station, base station, and wireless communication method
CN108924205A (en) Data transmission method, device, electronic equipment, gateway adapter
CN112989894B (en) Target detection method, task processing method, device, equipment and storage medium
CN106941457B (en) The method and device of IP packet frament reassembling based on multi-core processor
CN114827028A (en) Multi-layer computation network integrated routing system and method
CN109379764A (en) File transmitting method and device
CN113542038B (en) Communication processing system for blocking service data in different deployment modes
CN102572706A (en) Method, equipment and system for detecting transmission time delays in wireless multi-cast system
CN116489019B (en) Intelligent visual signaling channel management method, system and medium
CN110399210B (en) Task scheduling method and device based on edge cloud
CN109558442B (en) Real-time data aggregation method and system
CN116708562A (en) Data transmission management system and method applied to terminal of Internet of things
CN101640600B (en) Method and device for ensuring transfer quality of multicast group
US7620050B2 (en) Communication control device and communication control method
CN115933818A (en) Docking station integrated system and external communication method
CN107529190B (en) User data acquisition system and method
US8036251B2 (en) Packet transmission device and control method thereof
CN107634914A (en) A kind of frame method of flow control and device
US10484647B1 (en) Bandwidth estimation of a network connection
CN102420755B (en) Transmission processing method of data message, communication device 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