[go: up one dir, main page]

CN101414974A - Data flux management method based on communication terminal - Google Patents

Data flux management method based on communication terminal Download PDF

Info

Publication number
CN101414974A
CN101414974A CNA2008101792680A CN200810179268A CN101414974A CN 101414974 A CN101414974 A CN 101414974A CN A2008101792680 A CNA2008101792680 A CN A2008101792680A CN 200810179268 A CN200810179268 A CN 200810179268A CN 101414974 A CN101414974 A CN 101414974A
Authority
CN
China
Prior art keywords
data
management
terminal
communication terminal
priority
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.)
Granted
Application number
CNA2008101792680A
Other languages
Chinese (zh)
Other versions
CN101414974B (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.)
CRSC Research and Design Institute Group Co Ltd
Original Assignee
BEIJING QUANLU COMMUNICATION SIGNAL RESEARCH DESIGN INST
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 BEIJING QUANLU COMMUNICATION SIGNAL RESEARCH DESIGN INST filed Critical BEIJING QUANLU COMMUNICATION SIGNAL RESEARCH DESIGN INST
Priority to CN2008101792680A priority Critical patent/CN101414974B/en
Publication of CN101414974A publication Critical patent/CN101414974A/en
Application granted granted Critical
Publication of CN101414974B publication Critical patent/CN101414974B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention relates to a method used for managing and controlling data flows based on a communication terminal. The communication terminal with the management function (called management terminal for short) is gained according to prearranged rules; the communication terminal which has no management terminal address sends a request to the management terminal according to the address and waits for gaining priority threshold; if the waiting overtimes, the data to be sent is sequentially read and sent, otherwise the priority values of the data to be sent are sequentially read and compared to the priority threshold fed back by the management terminal; the data with the priority higher than the threshold is sent sequentially; for the data with the priority lower than the threshold, the priority thereof is weighted and improved, and the data is memorized at the tail of the data queue to be sent and waits to be sent in the next period. The method prevents the communication terminal from forming jamming when sending data, avoids the possibility of overtime re-sending caused by that the low priority data is abandoned by network equipment when the network jams, and reduces the occupying on the network resource after the data is sent and before the data is abandoned.

Description

Data flow management method based on communication terminal
Technical Field
The invention relates to a data flow management method based on a communication terminal.
Background
At present, most of the existing communication terminals are not intelligent, and only can complete communication tasks, and tasks such as data traffic and priority management are handed over to service application or management equipment in a network to be completed. Service applications may require marking data according to 802.1p specifications to implement QoS (QoS is a security mechanism of a network and is a technology for solving problems such as network delay and congestion), however, this management mode is implemented by discarding low-priority data in a network management device, so that it has a certain hysteresis, and a data sending end cannot receive a response from a receiving end and delays retransmission, which seriously affects timeliness of communication. Meanwhile, after data is sent, network resources also need to be occupied before the data reaches the network equipment through a route and is discarded, and communication of other terminals is affected.
If the occupation situation of the network bandwidth is grasped in time before the data is sent, priority management is carried out on the current data to be sent, the data flow is controlled at the sending source, and the sending opportunity of the data is controlled, so that the possibility that the data is discarded by network management equipment is reduced to a great extent, and the data transmission efficiency of the network is improved.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a data traffic management method based on a communication terminal, which performs priority management on data to be sent of the communication terminal and controls the sending of the data to be sent. The method reduces the possibility of overtime retransmission caused by the discarding of the low-priority data by the network equipment when the network is congested, reduces the occupation of network resources after the data is sent and before the data is discarded, and improves the efficiency of data transmission.
In order to solve the problems, the invention adopts the following technical scheme: the data flow management control method based on the communication terminal is characterized by comprising the following steps: the communication terminal and the management control program run on the communication terminal specifically comprise the following steps:
the communication terminal acquires a management terminal address through a preset rule;
sending an application to the management terminal by the communication terminal through the address of the management terminal, and waiting for the management terminal to feed back a priority threshold;
if the waiting time is overtime, sequentially reading the data to be sent of the communication terminal and sending the data; if the waiting time is not overtime, namely the communication terminal obtains the priority threshold value fed back by the management terminal, the priority value of the data to be sent of the terminal is read one by one, the data with the priority value higher than the threshold value is sent one by one compared with the fed-back priority threshold value, the data with the priority value lower than the priority threshold value is weighted in priority, the priority is improved, the data is stored in the tail of the data queue to be sent, and the data is sent in the next period.
Preferably, the rule for acquiring the address of the management terminal includes:
when two communication terminals without management terminal addresses communicate, communication terminals with low load are handed to bear management functions according to system load, the two communication terminals form a management group, and the address of the communication terminal with low load is the management terminal address of each communication terminal in the management group, namely the communication terminal has the management terminal address; or,
when the communication terminal without the management terminal address communicates with the communication terminal with the management terminal address, inheriting the management terminal address, and adding a corresponding management group to form the communication terminal with the management terminal address; or,
when two communication terminals with different management terminal addresses communicate, competition is generated, the loads of the communication terminals corresponding to the management terminal addresses are compared, the communication terminals with low loads are handed over to bear the management functions, the communication terminals bearing the management functions compete for winning, the management terminal address of each member in the management group where the communication terminals failing in competition are located is updated to the management terminal address of the competing for winning, and the management terminal addresses are correspondingly added into the management group where the management terminal is located.
Preferably, the method for setting the priority threshold value includes:
the management terminal receives the application sent by the communication terminal, calculates the use bandwidth values of a port and a line through which the communication terminal sends data, and selects the minimum value of the port and the line available bandwidth through which the communication terminal sends data as the bottleneck bandwidth of the communication terminal;
accumulating the length of the data to be sent one by one from high to low according to the priority value of the data to be sent of the communication terminal;
and calculating the lowest priority value which is sent in unit time and the accumulated data length does not exceed the bottleneck bandwidth as the priority threshold value of the communication terminal.
The invention has the beneficial effects that: the method comprises the steps that data to be sent are managed, the address of a management terminal is obtained before the data are sent, a communication terminal sends an application to the management terminal according to the address of the management terminal, the management terminal feeds back a priority threshold value according to the application, and the data with the priority value higher than the priority threshold value fed back by the management terminal are sent preferentially in the communication terminal, so that network blockage is prevented from being formed when the communication terminal sends the data; the data with the priority value lower than the priority threshold value fed back by the management terminal in the data to be sent in the communication terminal is weighted, then the data is waited for and enters the judgment of the next period, the possibility of overtime retransmission caused by the fact that the low-priority data is discarded by the network equipment when the network is congested is avoided, the occupation of network resources after the data is sent and before the data is discarded is reduced, and the availability of the network resources and the timeliness of data transmission are improved.
Drawings
FIG. 1 is a flow chart of an embodiment of a communication terminal transmitting data;
fig. 2 is a flow chart of an embodiment of a communication terminal for data priority management.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below.
As shown in fig. 1, step 101 acquires an address of a management terminal;
when two communication terminals without management terminal address communicate, the management terminal is determined by election and the address of the management terminal is saved. For example, when a communication terminal a (a for short) communicates with a communication terminal B (B for short), both of them do not have a management terminal address, and election is performed to determine that one terminal has a management function. And if the load of A is lower than that of B, the A is the management terminal and performs the management function. A and B both store the address of A, namely own management terminal address.
When a communication terminal having no management terminal address communicates with a communication terminal having a management terminal address, the address of the management terminal is inherited. For example, when a communication terminal D (communication terminal D is abbreviated as D) without a management terminal address communicates with a communication terminal E (communication terminal E is abbreviated as E, assuming that the management terminal address of E is the address of C), D obtains the management terminal address, i.e., the address of C, from E, and inherits the address, i.e., D owns the management terminal address, which is the address of C.
When two communication terminals having different management terminal addresses communicate with each other, competition occurs and the communication terminals with low load of the two management terminals are handed over to the management. The communication terminal with high load no longer has the management function, and the communication terminal with the communication terminal address updates the management terminal address to the address of the management terminal with low load. For example, the management terminal addresses of a and B are addresses of a, and the management terminal addresses of C, D and E are addresses of C; when B and E communicate, because both have management terminal addresses and are different, A and C compete, according to the system load, if the load of A is lower than C, A competes for winning, and continues to undertake the management function. C fails, the corresponding B, C and D own management terminal addresses are updated to the address of a, and a is managed.
102, the communication terminal sends an application to the management terminal according to the address of the management terminal and waits for a priority threshold fed back by the management terminal;
step 103, judging whether waiting overtime exists, if the waiting overtime exists, the priority threshold fed back by the management terminal is not obtained, and in order to maintain the normal operation of the system, step 104 sequentially reads data to be sent of each communication terminal in sequence and sends the data; if waiting is not overtime, namely a priority threshold fed back by the management terminal is obtained, executing step 105 to read the priority values of the data to be sent one by one; step 106, comparing the read priority value of the data to be sent with a priority threshold value fed back by the management terminal, and if the priority value of the data to be sent of the communication terminal is higher than the fed-back priority threshold value, step 107, sending the data of the communication terminal with the priority value higher than the fed-back priority threshold value; if the priority value of the data to be sent of the communication terminal is lower than the fed-back priority threshold, step 108 weights the priority of the data to be sent lower than the priority threshold; step 109, storing the weighted data of the communication terminal into the tail of the data queue to be sent of the communication terminal, and waiting for the cyclic judgment sending processing of the next period; step 110, judging whether the transmission queue of the period is processed, if not, skipping to step 105 for circular processing; if the processing is finished, the process proceeds to step 111, where the process waits for the next processing, and the process proceeds to step 102 after permission is obtained.
As shown in fig. 2, the selection step of the priority threshold on the management terminal is:
step 201, the management terminal obtains the application of the communication terminal and respectively calculates the bandwidth of the port and the line through which each communication terminal passes, and step 202 respectively selects the minimum value of the port and the line available bandwidth through which each communication terminal transmits data as the bottleneck bandwidth value of the communication terminal. For example, data sent by a communication terminal needs to pass through ports, lines, switches and the like, the data traffic allowed by each node is different, that is, the bandwidth is different, and the minimum bandwidth value is selected as the bottleneck bandwidth value, so that the data smaller than the bottleneck bandwidth can be completely sent without being limited by the bandwidth; step 203 respectively accumulates the length of data to be sent of the communication terminal, and step 204 judges whether the accumulated length of the data to be sent exceeds the bottleneck bandwidth value. If the accumulated data length exceeds the bottleneck bandwidth value, step 206, ending the accumulation, and selecting the priority value of the previous group of accumulated data as the priority threshold value; if the length of the accumulated data does not exceed the bottleneck bandwidth value, step 205 judges whether the data to be sent is counted up, if not, step 203 is skipped to continue accumulating the next group of data and continuing the judgment; and if the statistics is finished, selecting the priority value of the last judgment data as a priority threshold value. For example, suppose that in a certain communication process, terminal a needs to send four pieces of data, and the priority and data length of the data are shown in the following table:
serial number Priority level Data length (byte)
1 5 8192
2 3 1024
3 4 1024
4 8 4096
To ensure that the high priority data is sent out as much as possible without occupying the bandwidth, the data length occupied by the high priority data is counted according to the priority level.
Serial number Priority level Data length (byte) Cumulative length (byte)
1 3 1024 1024
2 4 1024 2048
3 5 8192 10240
4 8 4096 12288
It is assumed that the transmission processing period of the communication terminal is exactly one second.
If the bottleneck bandwidth of the communication terminal is 1kbytes/s, only the data with the priority 3 can be sent, and the bandwidth cannot be fully occupied, so that the priority threshold is 3.
If the bottleneck bandwidth of the communication terminal is 9kbytes/s, only the data with the priority levels of 3 and 4 can be transmitted, so that the bandwidth cannot be fully occupied, and therefore the priority threshold value is 4.
If the bottleneck bandwidth of the communication terminal exceeds 12288bytes/s, all data can be transmitted. The corresponding resulting priority threshold is 8.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations should also be regarded as the protection scope of the present invention.

Claims (3)

1. A data flow management control method based on a communication terminal is characterized by comprising the following steps: the communication terminal and the management control program run on the communication terminal specifically comprise the following steps:
the communication terminal acquires a management terminal address through a preset rule;
sending an application to the management terminal by the communication terminal through the address of the management terminal, and waiting for the management terminal to feed back a priority threshold;
if the waiting time is overtime, sequentially reading the data to be sent of the communication terminal and sending the data; if waiting is not overtime, reading the priority values of the data to be sent of the terminal one by one, comparing the priority values with the fed-back priority threshold value, sending the data with the priority values higher than the threshold value one by one, weighting the priority of the data lower than the priority threshold value, improving the priority, storing the data at the tail of the queue of the data to be sent, and waiting for sending in the next period.
2. The method according to claim 1, wherein the rule for acquiring the address of the management terminal comprises:
when two communication terminals without management terminal addresses communicate, communication terminals with low load are handed to bear management functions according to system load, the two communication terminals form a management group, and the address of the communication terminal with low load is the management terminal address of each communication terminal in the management group, namely the communication terminal has the management terminal address; or,
when the communication terminal without the management terminal address communicates with the communication terminal with the management terminal address, inheriting the management terminal address, and adding a corresponding management group to form the communication terminal with the management terminal address; or,
when two communication terminals with different management terminal addresses communicate, competition is generated, the loads of the communication terminals corresponding to the management terminal addresses are compared, the communication terminals with low loads are handed over to bear the management functions, the communication terminals bearing the management functions compete for winning, the management terminal address of each member in the management group where the communication terminals failing in competition are located is updated to the management terminal address of the competing for winning, and the management terminal addresses are correspondingly added into the management group where the management terminal is located.
3. The method for managing and controlling data traffic based on a communication terminal according to claim 1, wherein the method for setting the priority threshold comprises:
the management terminal receives the application sent by the communication terminal, calculates the use bandwidth values of a port and a line through which the communication terminal sends data, and selects the minimum value of the port and the line available bandwidth through which the communication terminal sends data as the bottleneck bandwidth of the communication terminal;
accumulating the length of the data to be sent one by one from high to low according to the priority value of the data to be sent of the communication terminal;
and calculating the lowest priority value which is sent in unit time and the accumulated data length does not exceed the bottleneck bandwidth as the priority threshold value of the communication terminal.
CN2008101792680A 2008-12-04 2008-12-04 Data flow management method based on communication terminal Active CN101414974B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2008101792680A CN101414974B (en) 2008-12-04 2008-12-04 Data flow management method based on communication terminal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2008101792680A CN101414974B (en) 2008-12-04 2008-12-04 Data flow management method based on communication terminal

Publications (2)

Publication Number Publication Date
CN101414974A true CN101414974A (en) 2009-04-22
CN101414974B CN101414974B (en) 2011-04-27

Family

ID=40595293

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2008101792680A Active CN101414974B (en) 2008-12-04 2008-12-04 Data flow management method based on communication terminal

Country Status (1)

Country Link
CN (1) CN101414974B (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103024075A (en) * 2012-12-28 2013-04-03 华为技术有限公司 Method and device for replication group transmission and storage device
CN109150722A (en) * 2017-06-16 2019-01-04 华为技术有限公司 A service forwarding method and network device
CN109612038A (en) * 2018-11-23 2019-04-12 珠海格力电器股份有限公司 Air conditioner parameter processing method and device, computer equipment and storage medium
CN110648535A (en) * 2019-09-26 2020-01-03 国家计算机网络与信息安全管理中心 Rail transit data reporting method and device based on traffic bypass acquisition
CN111148159A (en) * 2019-12-26 2020-05-12 拉扎斯网络科技(上海)有限公司 Data transmission method, apparatus, device, and computer-readable storage medium
CN111937352A (en) * 2018-03-05 2020-11-13 大众汽车股份公司 Method for transmitting data via a communication channel, correspondingly designed device and communication interface, and correspondingly designed computer program
CN114872052A (en) * 2022-06-06 2022-08-09 吉林农业科技学院 Method and system for remotely and automatically controlling intelligent factory mechanical arm
CN115396827A (en) * 2021-05-24 2022-11-25 成都鼎桥通信技术有限公司 Information processing method, device, equipment, storage medium and program product

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1299454C (en) * 2003-06-18 2007-02-07 清华大学 Scheduling method for ensuring service quality of real time operation in OFDM
CN101075963B (en) * 2007-07-02 2012-05-23 中兴通讯股份有限公司 Method and device for controlling dynamically based on network QoS

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103024075B (en) * 2012-12-28 2015-07-29 华为技术有限公司 Copy group transmission method, device and memory device
CN103024075A (en) * 2012-12-28 2013-04-03 华为技术有限公司 Method and device for replication group transmission and storage device
CN109150722A (en) * 2017-06-16 2019-01-04 华为技术有限公司 A service forwarding method and network device
US11777857B2 (en) 2017-06-16 2023-10-03 Huawei Technologies Co., Ltd. Service forwarding method and network device
CN109150722B (en) * 2017-06-16 2021-03-30 华为技术有限公司 A service forwarding method and network device
US11140085B2 (en) 2017-06-16 2021-10-05 Huawei Technologies Co., Ltd. Service forwarding method and network device
US11362858B2 (en) 2018-03-05 2022-06-14 Volkswagen Aktiengesellschaft Method for transmitting data via a communication channel, correspondingly designed device and communication interface, as well as correspondingly designed computer program
CN111937352A (en) * 2018-03-05 2020-11-13 大众汽车股份公司 Method for transmitting data via a communication channel, correspondingly designed device and communication interface, and correspondingly designed computer program
CN111937352B (en) * 2018-03-05 2022-04-26 大众汽车股份公司 Method, device, interface and storage medium for transmitting data via a communication channel
CN109612038A (en) * 2018-11-23 2019-04-12 珠海格力电器股份有限公司 Air conditioner parameter processing method and device, computer equipment and storage medium
CN110648535A (en) * 2019-09-26 2020-01-03 国家计算机网络与信息安全管理中心 Rail transit data reporting method and device based on traffic bypass acquisition
CN111148159B (en) * 2019-12-26 2023-06-09 拉扎斯网络科技(上海)有限公司 Data transmission method, device, equipment and computer-readable storage medium
CN111148159A (en) * 2019-12-26 2020-05-12 拉扎斯网络科技(上海)有限公司 Data transmission method, apparatus, device, and computer-readable storage medium
CN115396827A (en) * 2021-05-24 2022-11-25 成都鼎桥通信技术有限公司 Information processing method, device, equipment, storage medium and program product
CN115396827B (en) * 2021-05-24 2024-01-30 成都鼎桥通信技术有限公司 Information processing method, apparatus, device, storage medium, and program product
CN114872052A (en) * 2022-06-06 2022-08-09 吉林农业科技学院 Method and system for remotely and automatically controlling intelligent factory mechanical arm

Also Published As

Publication number Publication date
CN101414974B (en) 2011-04-27

Similar Documents

Publication Publication Date Title
CN101414974A (en) Data flux management method based on communication terminal
KR101346549B1 (en) Technique for setting network communication parameters
KR100933917B1 (en) Bandwidth guarantee and overload protection method in network switch
US8259576B2 (en) Method and apparatus for performing interrupt coalescing
KR101169594B1 (en) Method for priority based queuing and assembling of packets
CN110267214A (en) A kind of note transmission method, server and storage medium
US8689049B2 (en) Corrective actions based on probabilities
US7177268B2 (en) Packet distributing device
US8891372B2 (en) Application data flow management in an IP network
EP2262181A1 (en) Communication terminal device and communication control method
JP2012039330A (en) Packet relay apparatus and congestion control method
EP2712227B1 (en) Network traffic control method, node and system based on token-ring
CN102934403A (en) Controlling data transmission over a network
JP3687501B2 (en) Transmission queue management system and management method for packet switch
CN112583729B (en) A path traffic distribution method, network equipment and network system
US20160142333A1 (en) Method and apparatus for performing a weighted queue scheduling using a set of fairness factors
CN102075437A (en) Communication method, gateway and network
CN113543209A (en) Token scheduling-based congestion control method and device
JPH07135512A (en) Router equipment
US7106752B2 (en) Apparatus for scheduling packets and method of doing the same
KR20130109211A (en) Transmission apparatus, reception apparatus, communication apparatus, communication system, and transmission method
JPWO2009107713A1 (en) In-vehicle relay connection unit
US8289972B2 (en) Gigabit passive optical network strict priority weighted round robin scheduling mechanism
CN103281258B (en) A kind of data transmission method for uplink and device
US20030072260A1 (en) Multi-dimensional buffer management hierarchy

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
C56 Change in the name or address of the patentee

Owner name: BEIJING QUANLU COMMUNICATION SIGNALS RESEARCH AND

Free format text: FORMER NAME: BEIJING QUANLU COMMUNICATION SIGNAL RESEARCH DESIGN INST.

CP03 Change of name, title or address

Address after: 100073 Huayuan one mile 18 building

Patentee after: BEIJING NATIONAL RAILWAY RESEARCH & DESIGN INSTITUTE OF SIGNAL & COMMUNICATION Co.,Ltd.

Address before: 100073, Beijing, Fengtai District Huayuan one mile No. 18 building

Patentee before: Beijing National Railway Research & Design Institute of Signal & Communication

C56 Change in the name or address of the patentee
CP01 Change in the name or title of a patent holder

Address after: 100073, Beijing, Fengtai District Huayuan one mile No. 18 building

Patentee after: CRSC RESEARCH & DESIGN INSTITUTE GROUP Co.,Ltd.

Address before: 100073, Beijing, Fengtai District Huayuan one mile No. 18 building

Patentee before: BEIJING NATIONAL RAILWAY RESEARCH & DESIGN INSTITUTE OF SIGNAL & COMMUNICATION Co.,Ltd.

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20090422

Assignee: BEIJING RAILWAY SIGNAL Co.,Ltd.

Assignor: CRSC RESEARCH & DESIGN INSTITUTE GROUP Co.,Ltd.

Contract record no.: X2023980035234

Denomination of invention: A Data Flow Management Method Based on Communication Terminals

Granted publication date: 20110427

License type: Common License

Record date: 20230504