CN1297097C - Method for raising data transmission performance when the network is congested - Google Patents
Method for raising data transmission performance when the network is congested Download PDFInfo
- Publication number
- CN1297097C CN1297097C CNB031100430A CN03110043A CN1297097C CN 1297097 C CN1297097 C CN 1297097C CN B031100430 A CNB031100430 A CN B031100430A CN 03110043 A CN03110043 A CN 03110043A CN 1297097 C CN1297097 C CN 1297097C
- Authority
- CN
- China
- Prior art keywords
- data
- priority
- formation
- burst
- send
- 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.)
- Expired - Fee Related
Links
Abstract
The present invention relates to a method for improving data transmission performance when a network is congested. In the method, when a low-speed link is congested, large data packages are divided into segments in a link layer so as to reduce the length of the data packages, and the data package segments are transferred to a segment temporary queue, data with a high transmitting priority is transferred to a high priority queue so that high priority data, such as real-time business datum business data, etc. is transmitted by being crossed in the segments so as to prevent the real-time business data from being delayed and shook because of waiting for the transmission of the large data packages, guarantee the service quality aiming at the real-time business data, maximally reduce the disorder of segment messages, and simultaneously guarantee the priority scheduling of the high priority data of the real-time business data, etc.
Description
Technical field
The present invention relates to network communications technology field, relate in particular to a kind of method of data transmission performance when improving network congestion.
Background technology
Along with the development of the network communications technology, to the also raising day by day of requirement of the data transmission performance in the network service.In order to guarantee data transmission performance in the network service, promptly guarantee the reliable transmission of data, to satisfy the user's communications demand, usually adopt PQ congestion management techniques such as (Priority Queues) that the transmission course of data is managed at present, when output interface takes place when congested, can classify to data stream according to the significance level of transmission data, the service quality rating that needs provide etc., be generally transmission priority according to data message loaded service attribute specified data; Then sorted data are sent into the formation of different priorities respectively, this method has guaranteed to have in the network higher priority to a certain extent and has promptly required the higher height of service quality rating to send the reliable transmission of the data service of priority, for example for requiring the higher real time business data of service quality rating in the network service, can send into high-priority queue and carry out prioritised transmission, so that its service quality is preferentially guaranteed.
The data congestion administrative skill has solved the problem that high-priority data reliable transmission when congested takes place in network service to a certain extent, yet, because data packets for transmission different sizes in the network, the time that bigger packet needs in transmission course want smaller long data packet some, the difference in this transmission time is negligible for high-speed link, but may cause data transmission performance to reduce greatly for the above-mentioned temporal differences of low speed chain circuit, and can't satisfy the user's communications demand.Such as for the speech business business datum, usually requiring end to end, time delay should not surpass 150ms, the time delay of single-hop should not surpass 20ms, propagation delay time is generally packet size (frame length) divided by link bandwidth, for the propagation delay time of the big packet of low speed chain circuit as shown in Figure 1, for the low speed chain circuit below the 768Kbps, the time delay that big packet causes head and shoulders above the time delay values end to end that require usually of speech business data.That is to say the real time business packet that big packet arrives soon after, must wait for also in the high-priority queue (being the High formation) that just can obtain scheduling after big packet transmission finishes handles though entered, as shown in Figure 2, the moment that real time business packet 2 is dispatched processing at big packet 1 arrives, but must waiting until after big packet 1 sends, real time business packet 2 just can dispatch processing, suppose that big packet 1 length is 1500 bytes, the link bandwidth of output is 256Kbps, and then the time delay of real time business packet 2 will reach 46ms.
In order to address the above problem, usually the method for expecting is that big packet is carried out burst, reduce MTU, packet is carried out burst can carry out in network layer or link layer, if carry out the burst of packet in network layer, and the reorganization of data after the network layer of destination is carried out burst, consumption then will be increased to network bandwidth resources, will aggravate the Congestion Level SPCC of network, therefore big packet be carried out burst and should carry out at link layer.It is that a kind of link layer divides chip technology that existing MP (ppp multilink agreement) divides chip technology, this technology is divided into some with PPP (peer-peer protocol) frame by certain stripping strategy, encapsulation MP head on each burst, do initial (B), stop marks such as (E), and compile and go up sequence number, then all bursts are distributed to each passage and send, burst is recombinated by sequence number at receiving terminal, if there is burst to lose, then whole packet is dropped because of recombinating.
Therefore, if adopt MP to divide chip technology just essential transmission according to the order of sequence and the reception that guarantees fragment message.Usually for the situation of not using PQ, CQ (custom queuing), WFQ queuing mechanisms such as (Weighted Fair Queuing), the transmission sequence of fragment message can guarantee; But for the communication network that has adopted above-mentioned queuing mechanism, if still adopt existing MP to divide chip technology, then may occur to carry out the reorganization of message at receiving terminal, thereby can't guarantee the situation of the reliable transmission of data because of the transmission sequence of seriously upsetting fragment message.
Summary of the invention
In view of above-mentioned existing in prior technology problem, the purpose of this invention is to provide a kind of method of data transmission performance when improving network congestion, the propagation delay time because of big packet generation causes satisfying the problem that data transmission service quality requires in the link to solve.
The object of the present invention is achieved like this: the method for data transmission performance during described raising network congestion comprises:
A, data to be sent are classified;
B, will have the high data that send priority and change in the high-priority queue, other data change in interim formation of burst and the lower priority formation;
C, when carrying out data sending processing, at first the data in high-priority queue and the interim formation of burst are sent processing, then the data in the lower priority formation are sent processing.
Described step a comprises: according to QoS (service quality) value data are classified.
Described step a comprises: the five-tuple information according to IP (Internet protocol) is classified to data.
Described step a comprises: the input interface according to packet is classified to data.
Described rapid b comprises: the big packet that will dispatch out from the lower priority formation carries out burst as required, and changes in the interim formation of burst after the encapsulation sequence number in described burst; Whether big packet needs the size of burst and burst is to determine that according to professional time delay that allows of high-priority data and data transfer bandwidth the time delay that the burst size equals to allow multiply by data transfer bandwidth.
The described high data that send priority are: determine the data that needs preferentially send when the network congestion according to data message loaded service attribute;
Described big packet is: the time delay that its size produces high-priority data in process of transmitting surpasses the time delay that such data allow.
Described lower priority formation may further include the data transmit queue of one or more different priorities.
When adopting single channel link (being low speed chain circuit) to carry out the data transmission, described step c further comprises:
Data in c1, the schedules high priority formation also send;
C2, when the data in the high-priority queue send when finishing, the data in the interim formation of scheduling burst also send;
C3, when the data in high-priority queue and the interim formation of burst all send when finishing, the data in the formation of scheduling lower priority also send processing.
When adopting the multichannel link to carry out the data transmission:
Described step b also comprises: add respectively in each formation after each data is all encapsulated sequence number;
Described step c further comprises:
Data in c4, the interim formation of scheduling burst also send;
C5, when the data in the interim formation of burst send when finishing, the data in the schedules high priority formation also send;
C6, when the data in interim formation of burst and the high-priority queue all send when finishing, the data in the formation of scheduling lower priority also send processing;
Carry out the reception of data and re-assemblying of fragment data at receiving terminal according to the sequence number of each data.
By technique scheme as can be seen, the present invention takes place when congested at low speed chain circuit, big packet is carried out burst at link layer, reduce length of data package, high-priority datas such as real time business data are intersected to be sent in the fragment message, time delay and the shake of avoiding the real time business data to cause because of waiting for big packet to send, the service quality of assurance real time business data.When the present invention can also use the queuing mechanism of QoS on the multichannel link of binding, farthest reduce the out of order of fragment message in the data transmission procedure, and can guarantee the priority scheduling of high-priority data such as real time business data simultaneously.The present invention realizes also comparatively simple, only need increase an interim formation of burst on original queuing policy basis of realizing, does not have other overhead.In addition, the scope of application of the present invention is wider, can be applied to comprise in PPP, HDLC (High-Level Data Link Control), the FR multiple links such as (frame relays).
Description of drawings
Fig. 1 is the propagation delay time table of different length frame in the different bandwidth link;
Fig. 2 is the schematic diagram that packet sends in the prior art;
Fig. 3 carries out the schematic diagram that packet sends for adopting single channel among the present invention;
Fig. 4 carries out the schematic diagram that packet sends for adopting multichannel among the present invention;
Fig. 5 is the specific embodiment of the present invention flow chart.
Embodiment
The core concept of the method for data transmission performance is when link layer sends the packet failure because of network congestion after during described raising network congestion of the present invention, packet is pressed certain rule, for example the five-tuple information of IP or QoS (service quality) value etc., go into corresponding formation, wherein the five-tuple information of IP comprises: the source and destination address, the source and destination port numbers, protocol number, corresponding formation comprises: high-priority queue, the interim formation of burst and lower priority formation.Real time business is gone into high-priority queue, and for putting into the interim formation of burst behind the big packet burst to be sent, other business datums are put into the lower priority formation.The real time data bag is crossed in the burst of big packet and dispatches, and so just can guarantee to send the data that have high priority in the data of failure can preferentially send, and guarantees that it can not cause long time delay because of the transmission of other big packets.
The specific embodiment of the present invention such as Fig. 3, Fig. 4 and shown in Figure 5, the specific implementation process prescription is as follows, referring to Fig. 5:
Step 51: will classify to it according to corresponding transmission priority because of the packet that network congestion does not send;
Specifically can classify, also can classify according to the five-tuple information of IP packet according to QoS (service quality) value of each packet.
Step 52: will have the high data that send priority and change in the high-priority queue, and for example can put into high-priority queue, so that next step preferential transmission with sending the higher real time business data of priority.
Step 53: other data are changed in interim formation of burst and the lower priority formation, and detailed process is:
Step 531: other data are changed in the lower priority formation;
The lower priority formation can also further be a plurality of formations of different priorities according to the data service quality grade classification, and when the data in high-priority queue and the interim formation of burst have all sent when finishing, according to priority carry out the scheduling of lower priority formation more in proper order, for example can be divided into as Fig. 3, normal data transmit queue shown in Figure 4 (being the Normal formation) and lower-priority data transmit queue (being the Low formation), can certainly be divided into more different priorities data transmit queue, perhaps only use a data transmit queue as the lower priority formation;
Step 532: when the data sending processing in the high-priority queue finishes, dispatch out the data in the lower priority formation;
Step 533: the big packet of dispatching out is carried out burst handle, and will put into the interim formation of burst after the encapsulation sequence number in the described burst, be about to burst encapsulation mark head, comprise the burst sequence number of determining according to the burst order in the mark head;
The size of burst can be controlled according to time delay and data transfer bandwidth that high-priority data needs in the network service guarantee, be specially: the time delay (ms) that the size of each burst (byte) equals to need to guarantee multiply by data transfer bandwidth (Kbps) again divided by 8, and data transfer bandwidth is the output interface bandwidth of data to be sent;
Big packet is meant that the time delay that its size produces high-priority data has surpassed the time delay that such data allow in process of transmitting, to the burst of big packet is not need to wait this big packet for fear of the high priority packets that arrives following closely to send to finish and send, and only need to wait for that a little fragment message sends to finish gets final product, all the other bursts then temporary cache in the interim formation of burst, thereby the time delay that has guaranteed high-priority datas such as real time business data meets communicating requirement;
The big packet that employing will be dispatched out from formation carries out reentering the interim formation of burst behind the burst be for convenience receiving terminal to receiving data and processing.If with the direct burst of sorted big packet and put into corresponding formation, then because the cross scheduling of different priorities formation when going out group, the fragment message of the different pieces of information bag in the different queue will intersect to mix and send, serious fragment message is out of order with causing, increased the load of receiving terminal reconstructed file, even can't recombinate the fragment message that receives.
Step 54: the data in high-priority queue and the interim formation of burst are sent processing;
Data in the interim formation of high-priority queue and burst or have higher transmission priority, or the data to be sent of having dispatched out from the lower priority formation are so need preferentially send processing;
The scheduling of data sends processing procedure and specifically comprises following two kinds of situations:
A kind of is to adopt the single channel link to carry out data to send, and this situation can preferentially send the data in the high-priority queue, when the data sending processing in the high-priority queue finishes, sends the fragment data in the interim formation of burst again; Promptly when sending processing, always check whether there is packet in the high-priority queue at first,, then, do not do any mark, directly send its scheduling dequeue if having; When high-priority queue is sky, the formation of just dispatching other; The priority of the interim formation of burst is only second to high-priority queue, and is higher than other formations;
When the contour transmission priority data of real time business data arrives, preferentially it is dispatched, other data that fragment message then has precedence over except that high transmission priority data obtain scheduling, thereby guaranteed the override transmission always of high transmission priority data, even after big packet, arrive, also only need to wait for the time of a fragment message transmission, therefore, Service Quality Metrics such as the time delay of high transmission priority data and shake are guaranteed data transmission performance when promptly improving network congestion; At the receiving terminal of link, owing to do not encapsulate the mark head, can give network layer immediately and transmit processing for the contour transmission priority data of real time business data; And for fragment message, then put into buffer memory, by the time receive whole bursts of this packet, and recombinate by sequence number, transfer to network layer handles again, like this, though the contour transmission priority data of real time business packet transmits in the middle of intersecting at fragment message, still can not cause the out of order of fragment message;
Concrete data transmission procedure can be referring to Fig. 3, packet 1 carries out burst to it when obtaining dispatching dequeue, be divided into fragment message 1.1,1.2,1.3,1.4, supposes that the link bandwidth of output is 256Kbps, guarantee the time delay of 10ms, every message size is approximately 320 bytes; At first send fragment message 1.1, other fragment cache memory is to the interim formation of burst; After if fragment message 1.1 is sent completely, there is real time business packet 2 to arrive in the high-priority queue, then scheduling sends real time business packet 2; After being sent completely, if do not had packet in the high-priority queue, scheduling sends second fragment message 1.2 again, so continues;
Second kind of situation is to adopt binding multichannel link to carry out the transmission of data, described binding multichannel is that a plurality of passages are used as an interface, to increase transmission bandwidth, because data flow is shared by a plurality of passages when sending data by the multichannel link, same data flow may send from different passages, and each passage is because bandwidth and Congestion Level SPCC different, the incorrect order that may cause packet, so when sending data by the multichannel link, need determine sequence number for packet, give network layer handles with packet in the correct order to guarantee receiving terminal; Otherwise, may cause the recombination data bag that receiving terminal can't be correct;
The present invention with the multichannel link as a logical links, and for logical links designs total queuing policy, rather than design queuing policy respectively for each passage, when a certain passage is congested, the packet that is sent by its will be admitted to the formation of logical links, carry out unified queue scheduling; In order to guarantee each passage load balancing, the multichannel link also can be divided into some burst newspapers according to certain stripping strategy with big packet usually, is sent respectively by each passage; And burst and be temporary in method in the interim formation of burst when still adopting out group is in fragment cache memory to the interim formation with packet; Under the situation of multichannel link, all packets comprise the real time business packet, all need marking serial numbers; And the priority of setting the interim formation of burst is the highest, dispatches in order with each burst of guaranteeing a packet, avoids the out of order of fragment message.But different with the low speed chain circuit scheme is that the interim formation of burst has the highest priority.
High as mentioned above transmission priority data may need to wait for that the burst of a big packet all sends just obtains scheduling after finishing, but for the multichannel link, its bandwidth is bigger usually, and big packet sends the time delay and the shake that cause can not exceed the high maximum delay that priority data allows that sends usually.
The detailed process that sends data by the multichannel link as shown in Figure 4, when link takes place when congested, packet is gone into the formation of respective priority according to queuing policy, when big packet 1 obtains dispatching out group, the multichannel link is for balanced load, this packet is divided into several fragment messages 1.1,1.2,1.3,1.4 of passage, earlier first fragment message 1.1 is gone out team, send by the physical channel that takes turns to (being physical channel 1 among the figure); Other fragment messages 1.2,1.3,1.4 are gone into the interim formation of burst, wait for queue scheduling next time, because the priority of the interim formation of burst is the highest, after so all bursts are dispatched continuously, just can dispatch the packet in other formations, all packets are all packed mark head, on the volume sequence number, so the load of scheduling physical channel is approximate, can reduce the possibility of data packet disorder to greatest extent; And simultaneously successful realization the QoS queue scheduling of multichannel link.
Step 55: the data in the lower priority formation are sent processing;
The lower priority formation comprises normal data transmit queue and lower-priority data transmit queue, and when carrying out data sending processing, the high priority data in the normal data transmit queue sends row in lower-priority data;
Data in the lower priority formation are sent processing to be comprised:
Packet for normal size directly sends, and the packet of normal size is meant that the transmission delay of this packet is no more than the maximum delay that network service allows;
Then handle for big packet with reference to step 533.
Claims (10)
1, a kind of method of data transmission performance when improving network congestion is characterized in that comprising:
A, data to be sent are classified;
B, will have the high data that send priority and change in the high-priority queue, other data change in interim formation of burst and the lower priority formation;
C, when carrying out data sending processing, at first the data in high-priority queue and the interim formation of burst are sent processing, then the data in the lower priority formation are sent processing.
2, the method for data transmission performance during raising network congestion according to claim 1 is characterized in that described step a comprises: data are classified according to the service quality QoS value.
3, the method for data transmission performance during raising network congestion according to claim 1, it is characterized in that described step a comprises: the five-tuple information according to Internet protocol IP is classified to data.
4, the method for data transmission performance during raising network congestion according to claim 1, it is characterized in that described step a comprises: the input interface according to packet is classified to data.
5, the method for data transmission performance during raising network congestion according to claim 1, it is characterized in that described rapid b comprises: the big packet that will dispatch out from the lower priority formation carries out burst as required, and changes in the interim formation of burst after the encapsulation sequence number in described burst.
6, the method for data transmission performance during raising network congestion according to claim 5, it is characterized in that: whether big packet needs the size of burst and burst is to determine that according to professional time delay that allows of high-priority data and data transfer bandwidth the time delay that the burst size equals to allow multiply by data transfer bandwidth.
The method of data transmission performance during 7, according to claim 5 or 6 described raising network congestions is characterized in that:
The described high data that send priority are: determine the data that needs preferentially send when the network congestion according to data message loaded service attribute;
Described big packet is: the time delay that its size produces high-priority data in process of transmitting surpasses the time delay that such data allow.
The method of data transmission performance when 8, improving network congestion according to claim 1 or 5 is characterized in that: described lower priority formation may further include the data transmit queue of one or more different priorities.
9, the method for data transmission performance during raising network congestion according to claim 1 is characterized in that, when adopting the single channel link to carry out data when sending, described step c further comprises:
Data in c1, the schedules high priority formation also send;
C2, when the data in the high-priority queue send when finishing, the data in the interim formation of scheduling burst also send;
C3, when the data in high-priority queue and the interim formation of burst all send when finishing, the data in the formation of scheduling lower priority also send processing.
10, the method for data transmission performance during raising network congestion according to claim 1 is characterized in that, when adopting the multichannel link to carry out data when sending:
Described step b also comprises: add respectively in each formation after each data is all encapsulated sequence number;
Described step c further comprises:
Data in c4, the interim formation of scheduling burst also send;
C5, when the data in the interim formation of burst send when finishing, the data in the schedules high priority formation also send;
C6, when the data in interim formation of burst and the high-priority queue all send when finishing, the data in the formation of scheduling lower priority also send processing;
Carry out the reception of data and re-assemblying of fragment data at receiving terminal according to the sequence number of each data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031100430A CN1297097C (en) | 2003-04-09 | 2003-04-09 | Method for raising data transmission performance when the network is congested |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031100430A CN1297097C (en) | 2003-04-09 | 2003-04-09 | Method for raising data transmission performance when the network is congested |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1536820A CN1536820A (en) | 2004-10-13 |
| CN1297097C true CN1297097C (en) | 2007-01-24 |
Family
ID=34319606
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031100430A Expired - Fee Related CN1297097C (en) | 2003-04-09 | 2003-04-09 | Method for raising data transmission performance when the network is congested |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1297097C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107222475A (en) * | 2017-05-26 | 2017-09-29 | 马鸣 | A kind of Data Transport Protocol method for wireless sensor network intelligent building conservation system |
Families Citing this family (37)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100420249C (en) * | 2005-03-22 | 2008-09-17 | 中国科学院计算技术研究所 | Method for guarantee service quality of radio local network |
| ATE515864T1 (en) * | 2005-12-23 | 2011-07-15 | Ericsson Telefon Ab L M | METHOD AND APPARATUS FOR RESOLVING DATA PACKET TRAFFIC CONGESTION |
| CN1917476B (en) * | 2006-09-07 | 2010-05-12 | 杭州华三通信技术有限公司 | Laminated adjustment method and device |
| CN101192940B (en) * | 2006-11-28 | 2011-04-20 | 中兴通讯股份有限公司 | Quality guarantee method for mobile game service |
| CN101242341B (en) * | 2007-02-07 | 2015-07-29 | 华为技术有限公司 | A kind of method for dispatching message and device |
| CN101425943B (en) * | 2007-10-30 | 2011-08-10 | 中兴通讯股份有限公司 | Method for uplink QoS guarantee in G bit passive optical network system |
| CN101217499B (en) * | 2008-01-21 | 2010-12-01 | 中兴通讯股份有限公司 | Array dispatching method |
| CN101252451B (en) * | 2008-03-22 | 2011-04-20 | 桂林电子科技大学 | Method and middleware for Web server system requesting to distinguish service ensuring service quality |
| CN101534245B (en) * | 2009-04-09 | 2011-08-10 | 国电南瑞科技股份有限公司 | Transmission control method for data processing of real-time monitoring system |
| CN101883386B (en) * | 2009-05-04 | 2014-01-29 | 中国移动通信集团公司 | Relay forwarding method, device and system of ranked data |
| CN101895403B (en) | 2009-05-22 | 2013-08-28 | 华为技术有限公司 | Data transmission method and device and communication system |
| CN102014067B (en) * | 2010-12-14 | 2012-11-21 | 北京星网锐捷网络技术有限公司 | Message fragment sending method, device and network equipment |
| CN102595205A (en) * | 2011-01-03 | 2012-07-18 | 香港星巴香港有限公司 | Interactive service system, interactive system and interactive method thereof |
| CN102083134B (en) * | 2011-02-15 | 2014-07-09 | 华为技术有限公司 | Service processing method and device as well as wireless network controller |
| CN102710327B (en) * | 2012-06-08 | 2015-03-18 | 烽火通信科技股份有限公司 | High-priority service safety bearer ensuring method and device with cross protection function |
| CN102957626B (en) * | 2012-11-14 | 2016-08-10 | 中兴通讯股份有限公司 | A kind of message forwarding method and device |
| CN103414692A (en) * | 2013-07-15 | 2013-11-27 | 北京控制工程研究所 | High real-time spacecraft data transmission method based on priorities |
| CN104853226A (en) * | 2014-02-17 | 2015-08-19 | 华为技术有限公司 | Method, device, equipment and system for processing multimedia data |
| CN104270441B (en) * | 2014-09-28 | 2018-12-04 | 曙光信息产业股份有限公司 | A kind of method and system of distributed system multipriority communication |
| CN104361088B (en) * | 2014-11-17 | 2017-12-12 | 国电南京自动化股份有限公司 | Congestion data processing method of the SCADA system based on real-time weight analysis |
| CN105763481A (en) * | 2014-12-19 | 2016-07-13 | 北大方正集团有限公司 | Information caching method and device |
| CN104780120A (en) * | 2015-04-15 | 2015-07-15 | 天脉聚源（北京）教育科技有限公司 | Method and device for transmitting files in local area network |
| CN105608181A (en) * | 2015-12-22 | 2016-05-25 | 安徽瑞信软件有限公司 | Business data acquisition processing method |
| CN106656864B (en) * | 2017-02-21 | 2020-04-28 | 中国联合网络通信集团有限公司 | Message forwarding scheduling method and device |
| CN111917656B (en) * | 2017-07-27 | 2023-11-07 | 超聚变数字技术有限公司 | Method and device for transmitting data |
| CN109587692B (en) * | 2017-09-29 | 2022-08-30 | 中国石油天然气股份有限公司 | Oil well condition data acquisition method and device |
| CN109450980A (en) * | 2018-10-11 | 2019-03-08 | 东南大学 | Computing resource selection method based on delay requirement difference in wireless cloud computing system |
| CN109586780A (en) * | 2018-11-30 | 2019-04-05 | 四川安迪科技实业有限公司 | The method for preventing message from blocking in satellite network |
| CN109547357A (en) * | 2018-12-03 | 2019-03-29 | 郑州云海信息技术有限公司 | Transmission method, device, equipment and the medium of data information in a kind of storage system |
| CN110351195A (en) * | 2019-08-15 | 2019-10-18 | 赛尔网络有限公司 | A kind of method for controlling network congestion, device, equipment and medium |
| CN110995796A (en) * | 2019-11-20 | 2020-04-10 | 中国建设银行股份有限公司 | Data transmission method and device based on private line |
| CN113037640A (en) * | 2019-12-09 | 2021-06-25 | 华为技术有限公司 | Data forwarding method, data caching device and related equipment |
| CN112491620B (en) * | 2020-11-29 | 2022-11-01 | 中国航空工业集团公司洛阳电光设备研究所 | Multi-channel data transmission controller based on SRIO and adjusting method |
| CN112738642A (en) * | 2020-12-28 | 2021-04-30 | 广州赞赏信息科技有限公司 | Method for realizing multi-network card aggregation plug flow |
| CN113162871A (en) * | 2021-04-22 | 2021-07-23 | 成都华微电子科技有限公司 | Data transmission method, data transmission circuit and artificial intelligence chip |
| CN114050978B (en) * | 2021-11-11 | 2023-08-29 | 安徽电信规划设计有限责任公司 | Communication load big data adjusting method and system |
| CN116015943B (en) * | 2022-12-30 | 2024-03-12 | 电子科技大学 | Privacy protection method based on multi-level tunnel confusion |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0372795A2 (en) * | 1988-12-06 | 1990-06-13 | AT&T Corp. | Bandwidth allocation and congestion control scheme for an integrated voice and data network |
| WO2001041397A1 (en) * | 1999-11-30 | 2001-06-07 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus for packet delay reduction using scheduling and header compression |
| CN1336058A (en) * | 1998-12-10 | 2002-02-13 | 诺基亚网络有限公司 | System and method for pre-filtering low priority packets |
| US20020131413A1 (en) * | 2000-11-30 | 2002-09-19 | Shih-Chiang Tsao | Method and apparatus for scheduling for packet-switched networks |
| US6538989B1 (en) * | 1997-09-09 | 2003-03-25 | British Telecommunications Public Limited Company | Packet network |
-
2003
- 2003-04-09 CN CNB031100430A patent/CN1297097C/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0372795A2 (en) * | 1988-12-06 | 1990-06-13 | AT&T Corp. | Bandwidth allocation and congestion control scheme for an integrated voice and data network |
| US6538989B1 (en) * | 1997-09-09 | 2003-03-25 | British Telecommunications Public Limited Company | Packet network |
| CN1336058A (en) * | 1998-12-10 | 2002-02-13 | 诺基亚网络有限公司 | System and method for pre-filtering low priority packets |
| WO2001041397A1 (en) * | 1999-11-30 | 2001-06-07 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus for packet delay reduction using scheduling and header compression |
| US20020131413A1 (en) * | 2000-11-30 | 2002-09-19 | Shih-Chiang Tsao | Method and apparatus for scheduling for packet-switched networks |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107222475A (en) * | 2017-05-26 | 2017-09-29 | 马鸣 | A kind of Data Transport Protocol method for wireless sensor network intelligent building conservation system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1536820A (en) | 2004-10-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1297097C (en) | Method for raising data transmission performance when the network is congested | |
| CN1225874C (en) | Method and apparatus for packet delay reduction using scheduling and header compression | |
| US10171369B2 (en) | Systems and methods for buffer management | |
| US10270696B2 (en) | Transmission of data packets of different priority levels using pre-emption | |
| US8811411B2 (en) | Packet aggregation and fragmentation at layer-2 over a managed network | |
| KR100644445B1 (en) | Class-Based Rate Control Using a Multi-Threshold Leaky Bucket | |
| CN1279728C (en) | Method and appts. for scheduling available link bandwidth between packet-switched data flows | |
| CN100388682C (en) | Method for improving service quality in SGSN network processor | |
| US20100118883A1 (en) | Systems and methods for queue management in packet-switched networks | |
| CN101047640A (en) | Radio access bear data transmission method | |
| CN1729664A (en) | Protecting real-time data in wireless networks | |
| CN101075968A (en) | Method and apparatus for providing region-classifying service | |
| CN101052043A (en) | TCP sending algorithm based on sending window and reciprocating time | |
| CN101267443A (en) | A data processing method and communication device | |
| WO2013016971A1 (en) | Method and device for sending and receiving data packet in packet switched network | |
| WO2021004210A1 (en) | Packet processing method and related apparatus | |
| CN101562841B (en) | Service scheduling method, device and system thereof | |
| EP1104141A2 (en) | System for generating composite packets | |
| CN101212467B (en) | MPLS network service scheduling method | |
| CN1384673A (en) | Dispatching method for comprehensive router service | |
| CN1518296A (en) | Method of implementing integrated queue scheduling for supporting multi service | |
| CN103858474A (en) | Enhanced performance service-based profiling for transport networks | |
| CN1770744A (en) | Method for preserving delay properties and an apparatus for scheduling transmission link capacity between packet switched telecommunications flows | |
| US8184649B2 (en) | Method for transmitting data available in the form of data packets | |
| CN1694435A (en) | Frame-to-cell traffic scheduling |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20070124 Termination date: 20160409 |