CN1472922A - Method for selecting route by accounting and controlling node status - Google Patents
Method for selecting route by accounting and controlling node status Download PDFInfo
- Publication number
- CN1472922A CN1472922A CNA031467903A CN03146790A CN1472922A CN 1472922 A CN1472922 A CN 1472922A CN A031467903 A CNA031467903 A CN A031467903A CN 03146790 A CN03146790 A CN 03146790A CN 1472922 A CN1472922 A CN 1472922A
- Authority
- CN
- China
- Prior art keywords
- node
- state
- cycle
- path
- signaling
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 230000011664 signaling Effects 0.000 claims description 34
- 238000012544 monitoring process Methods 0.000 claims description 7
- 230000015572 biosynthetic process Effects 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 2
- 230000005540 biological transmission Effects 0.000 description 4
- 238000011161 development Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000002411 adverse Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a route selecting method through statistics and control of node states in the communication field. When a data packet reaches a node, the present method distinguishes the type of the data packet, detects the node state periodically and makes statistics thereof, and updates the state database; when the state variation of a node reaches a certain value, the method sends a state exciting information to all of the accessible nodes in the network; the method updates the state database and the routing table according to the received newest state information of the node, judges its state stability and adjusts the outputs of the adjacent nodes; the method selects the route and makes business management according to the QoS requirement of the business data packet, the target address and the contents of the node state database and the routing table.
Description
The technical field invention relates to a kind of method by statistics and Control Node state selection route, belongs to communication technical field.
Background technology has proposed higher, service quality (Quality of Service) requirement widely to network, hereinafter to be referred as qos requirement along with appearance, the especially development of real-time multimedia business of multiple Internet application in recent years.These requirements comprise bandwidth, time-delay, delay jitter, packet loss etc.On the network of doing one's best, only by (for example: bandwidth) be not enough to support the QoS performance requirement increasing Internet resources.Because can not avoid the delay jitter of business burst phase like this.Even in the quite light network of load, the variation that transmits time-delay all may cause bad influence to real-time application.In addition, can not fundamentally eliminate congested bottleneck.For professional needed service can be provided, must introduce suitable QoS mechanism, increase " intelligence " to network, enable the strict demand and the obtainable Internet resources of time-delay, shake and the packet loss that can tolerate according to business, guarantee for business provides the end-to-end quality of service of definite or statistics, and give security for effective utilization of Internet resources.
According to control range, QoS mechanism can be divided into the control of single node control and multinode.The control of single node mainly comprises: access control and scheduling controlling.The control of multinode comprises congested control and route control.In the QoS controlling mechanism, route control relates to the state variation of whole network, influences performance of the entire network, plays key effect in guaranteeing service quality.
In the QoS route, node carries out Route Selection, and professional QoS demand and the obtainable Internet resources that provide of foundation are provided.And obtainable network resource information is the carrier transmission with the network state information, and therefore, can the QoS route successfully satisfy professional requirement to service quality, ensure the efficient utilization of Internet resources, depend on whether network state information is accurate.The accuracy of network state information depend on the network state information transmission process mechanism of network node can be in time, the information that changes of issue reflection node state exactly.In real network, in state information acquisition and process of transmitting, exist and transmit and the processing time-delay, the information of issue reflection node state variation is difficult to accomplish exactly.When routing node uses wrong state information for professional routing or forwarding business, may have a strong impact on professional transmission success rate, cause the Internet resources effective rate of utilization to descend.Thisly descend, can be summed up as two class situations by the inaccurate Internet resources effective rate of utilization that causes of state information:
1, the professional rejection of mistake: when service request arrives, because the link-state information that access node was obtained at that time is inaccurate, think and do not have the path of satisfying this business need, and in fact there is such path, simultaneously, the professional service request that can not reduce self, access node will be refused this service request mistakenly so.The generation of this situation will cause the service access rate to descend, so that reduce the Internet resources effective rate of utilization.
2, Ye Wu bust this: after certain business is linked into network, because the link-state information of institute's reference is not accurate enough, cause wrong access judgement or inappropriate Path selection, cause network business to be sent to destination (packet loss as business is too high, and it is too big to delay time or the like) according to the quality of service requirement of prior agreement.So, this business bust this causes the effective rate of utilization of Internet resources to descend.
From top analysis as can be seen, the inaccuracy of node status information is the inherent characteristic of network, and it has had a strong impact on the realization of QoS route, has restricted the QoS networks development.Up to the present, a large amount of research all is confined to seek better route selection method and network state information update mechanism, with the inaccurate adverse effect that causes of the state information that weakens node, and does not study from the reliability aspect that improves state information.
Summary of the invention the objective of the invention is to propose a kind of method of selecting route by statistics and Control Node state, node is according to the result to oneself state cycle statistics, FEEDBACK CONTROL is carried out in resource management to adjacent node, to improve the stability of node state, increase node state and on average hold time, improve the reliability of node status information.
The present invention proposes to select by statistics and Control Node state the method for route, may further comprise the steps:
1, after packet arrives this node, distinguishes the type of this packet, if business data packet is then extracted the quality of service requirement and the destination address of packet; If signaling packet is then carried out corresponding signaling;
2, be cycle monitoring and the state of adding up node with T1, upgrade this node state database;
3, change when reaching certain value when average, variance or the probability distribution of the above-mentioned state of this node, trigger this node status information and in the whole network, can reach node and send;
4, this node upgrades this node state database and routing table according to the latest state information that can reach node in the network that receives;
5, according to the content of this node state database, carry out this node state judgement of stability, if the variation of node state has exceeded the node state stability requirement, then with the change feedback information of node state to adjacent node, adjust the output of adjacent node;
6,, select the path industry scheduling of being engaged in of going forward side by side according to the quality of service requirement of above-mentioned business data packet and the content of destination address and this node state database and routing table.
The signaling of carrying out in the said method comprises that Hello signaling, service request signaling, feedback control signaling and state upgrade any in the signaling.
Node state in the said method comprises any in input and output speed, queue length, formation time-delay or the packet loss.
The basis for estimation that triggers this node send state information in the said method is: a N continuous T1 is in the cycle, the average of this node state, variance or probability distribution and this node are announced to the corresponding state information that can reach node in the whole network when inequality, promptly triggering this node status information sends, wherein N is a positive integer, and N 〉=3.
The node state stability requirement is in the said method: the service rate that arrives in the cycle at this T1 is less than or equal to two amount sums, (the 1-α) that described two amounts are respectively this cycle output speed doubly and the α of output link band width in physical times, wherein α is less than or equal to 1 positive number.
The process of adjusting the output intent of adjacent node in the said method comprises: after adjacent node was received feedback information, in the cycle, the output speed of the output port that links to each other with this node changed β times of current monitoring and statistics cycle output speed into next T1; If adjacent node is not received feedback information, then with next T1 in the cycle, the output speed of the output port that links to each other with this node changes two amount sums into, described two amounts be respectively this cycle output speed (1-α) doubly and the α of output link band width in physical times, wherein α and β are respectively and are less than or equal to 1 positive number.
Select the process in path in the said method, may further comprise the steps:
(1) this node requires and professional destination address according to QoS, selects to satisfy the path with maximum available bandwidth that service bandwidth requires from the routing table of this node; The selection route method is: according to the path available bandwidth that calculates, select the path of maximum available bandwidth, if there are many paths of satisfying business need and having maximum available bandwidth, then select wherein one at random; If do not have the path of satisfying business need, then discarding traffic packet;
(2) be the cycle with T1, write down the total service rate that inserts on the above-mentioned selected path;
(3) with T1 be the available bandwidth in the selected path of computation of Period, and upgrade this node routing table, the method of wherein calculating the available bandwidth in selected path is: last one-period this node routing table in the available bandwidth in selected path, the α that deducts the total service rate that inserts on this selected path of one-period doubly, wherein α is less than or equal to 1 positive number.
The method of passing through statistics and Control Node state selection route that the present invention proposes has the following advantages:
1, in the QoS network, introduces controlling mechanism, increased the stability of node state, improved the reliability of node status information.
2, only between adjacent node, adopt FEEDBACK CONTROL, can not impact the stability of the whole network.
3, in the state information of issue, increased variance and distributed constant equiprobability information, made routing algorithm can understand the operating state of the whole network node more comprehensively.For the success of QoS route lays the foundation.
4, at the service access node, cooperate feedback control mechanism, according to the business that has inserted, the calculating path available bandwidth has increased the reliability of routing select result, has improved professional success rate along the transmission of selected path.
Description of drawings
Fig. 1 is the FB(flow block) of the inventive method.
Embodiment
The method of passing through statistics and Control Node state selection route that the present invention proposes, its FB(flow block) after packet arrives this node, is distinguished the type of this packet as shown in Figure 1, if business data packet is then extracted the quality of service requirement and the destination address of packet; If signaling packet is then carried out corresponding signaling; With T1 is cycle monitoring and the state of adding up node, upgrades this node state database; When average, variance or the probability distribution of the above-mentioned state of this node changes when reaching certain value, trigger this node status information and in the whole network, can reach node and send; This node upgrades this node state database and routing table according to the latest state information that can reach node in the network that receives; According to the content of this node state database, carry out this node state judgement of stability, if the variation of node state has exceeded the node state stability requirement, then with the change feedback information of node state to adjacent node, adjust the output of adjacent node; According to the quality of service requirement of above-mentioned business data packet and the content of destination address and this node state database and routing table, select the path industry scheduling of being engaged in of going forward side by side.
As mentioned above, after packet arrives this node, distinguish the type of this packet, if business data packet is then extracted the quality of service requirement and the destination address of packet; If signaling packet is then carried out corresponding signaling; Wherein the signaling of Zhi Hanging comprises that Hello signaling, service request signaling, feedback control signaling and state upgrade any in the signaling, and their main meaning is respectively:
(1) Hello signaling, promptly this node sends the information that exists about this node to adjacent node, and adjacent node upgrades its slip condition database and routing table after receiving the Hello signaling.
(2) the service request signaling is: the signaling of the request network insertion that new business is sent.Its content comprises: quality of service requirement that this is professional and destination address.
(3) feedback control signaling is: the indication that node is adjusted the output speed of adjacent node.
(4) state renewal signaling is: can reach node sending node state information in network, receive this node state of the node updates database and the routing table of this state information.
With T1 is cycle monitoring and the state of adding up node, upgrades this node state database.Wherein, the node state of statistics comprises any in input and output speed, queue length, formation time-delay or the packet loss.
When average, variance or the changes in distribution of the above-mentioned state of this node reach certain value, trigger this node status information and in the whole network, can reach node and send; The basis for estimation that triggers this node send state information is that a N continuous T1 is in the cycle, the average of this node state, variance or distribution and this node are announced to the state information that can reach node in the whole network not simultaneously, promptly trigger this node status information and send, wherein N is a positive integer, and N 〉=3.
This node upgrades this node state database and routing table according to the latest state information that can reach node in the network that receives; According to the content of this node state database, carry out this node state judgement of stability, if the variation of node state has exceeded the node state stability requirement, then with the change feedback information of node state to adjacent node, adjust the output of adjacent node;
Among the present invention, this node state judgement of stability is to carry out in the cycle with T1.In the said method, the node state stability requirement is: the service rate that arrives in the cycle at this T1 is less than or equal to two amount sums, (the 1-α) that described two amounts are respectively this cycle output speed doubly and the α of output link band width in physical times, wherein α is less than or equal to 1 positive number, promptly
R
k≤maxR
k＝R
k-1+α(C-R
k-1)
Wherein, R
kThe output speed of representing any one port of this node in k cycle, C represents the band width in physical of this output port, α is less than or equal to 1 positive number.
Among the present invention, this section is named a person for a particular job the change feedback information of node state to adjacent node, and the output intent of adjusting adjacent node is:
(1) if in k cycle, sent feedback control signaling to adjacent node, then in this k cycle, the β that the output speed of receiving the output port that the adjacent node of feedback control signaling just will link to each other with this node is adjusted into current monitoring and statistics cycle output speed doubly, promptly
R
k＝β·R
k-1
Wherein, β is less than or equal to 1 positive number
(2) if in k cycle, do not send feedback control signaling to adjacent node, then in this k cycle, the output speed that the output speed of the output port that adjacent node just will link to each other with this node is adjusted into the output port that links to each other with this node changes two amount sums into, described two amounts be respectively this cycle output speed (1-α) doubly and the α of output link band width in physical times, wherein α is less than or equal to 1 positive number, promptly
R
k＝R
k-1+α(C-R
k-1)
According to the quality of service requirement of above-mentioned business data packet and the content of destination address and this node state database and routing table, select the path industry scheduling of being engaged in of going forward side by side.Wherein, Route Selection comprises two parts content: the one, and be the service selection path according to the quality of service requirement professional in the service request signaling and the content of destination address, this node state database and routing table.If there is the path satisfy business need, with regard to access service, otherwise with regard to the rejection business, and the routing result announced to business by access signaling.Therefore in implementation step, this part also comprises access control function.The one, be the service selection path according to the quality of service requirement professional in the business data packet and the content of destination address, this node state database and routing table.If there is the path of satisfying business need, with regard to access service, otherwise with regard to the discarding traffic packet.
Select the process in path may further comprise the steps in this method:
(1) this node requires and professional destination address according to QoS, selects to satisfy the path with maximum available bandwidth that service bandwidth requires from the routing table of this node;
(2) be the cycle with T1, write down the total service rate that inserts on the above-mentioned selected path;
(3) be the available bandwidth in the selected path of computation of Period with T1, and upgrade this node routing table.
Wherein, k T1 calculates the available bandwidth B in selected path in the cycle
kMethod be: last one-period this node routing table in the available bandwidth B in selected path
k, deduct the total service rate r that inserts on this selected path of one-period
kα doubly, wherein α is less than or equal to 1 positive number, promptly
B
k＝B
k-1-α·r
k-1
Claims (9)
1, a kind of method by statistics and Control Node state selection route is characterized in that this method may further comprise the steps:
(1) after packet arrives this node, distinguishes the type of this packet, if business data packet is then extracted the quality of service requirement and the destination address of packet; If signaling packet is then carried out corresponding signaling;
(2) be cycle monitoring and the state of adding up node with T1, upgrade this node state database;
(3) change when reaching certain value when average, variance or the probability distribution of the above-mentioned state of this node, trigger this node status information and in the whole network, can reach node and send;
(4) this node upgrades this node state database and routing table according to the latest state information that can reach node in the network that receives;
(5) according to the content of this node state database, carry out this node state judgement of stability, if the variation of node state has exceeded the node state stability requirement, then with the change feedback information of node state to adjacent node, adjust the output of adjacent node;
(6), select the path industry scheduling of being engaged in of going forward side by side according to the quality of service requirement of above-mentioned business data packet and the content of destination address and this node state database and routing table.
2, the method for claim 1 is characterized in that the signaling of wherein carrying out comprises that Hello signaling, service request signaling, feedback control signaling and state upgrade any in the signaling.
3, the method for claim 1 is characterized in that wherein said node state comprises any in input and output speed, queue length, formation time-delay or the packet loss.
4, the method for claim 1, the basis for estimation that it is characterized in that wherein said this node of triggering send state information is: a N continuous T1 is in the cycle, the average of this node state, variance or probability distribution and this node are announced to the corresponding state information that can reach node in the whole network when inequality, promptly triggering this node status information sends, wherein N is a positive integer, and N 〉=3.
5, the method for claim 1, it is characterized in that wherein said node state stability requirement is: the service rate that arrives in the cycle at this T1 is less than or equal to two amount sums, (the 1-α) that described two amounts are respectively this cycle output speed doubly and the α of output link band width in physical times, wherein α is less than or equal to 1 positive number.
6, the method for claim 1 is characterized in that wherein the process of adjusting the output intent of adjacent node in (5) step comprises:
After adjacent node was received feedback information, in the cycle, the output speed of the output port that links to each other with this node changed β times of current monitoring and statistics cycle output speed into next T1; If adjacent node is not received feedback information, then with next T1 in the cycle, the output speed of the output port that links to each other with this node changes two amount sums into, described two amounts be respectively this cycle output speed (1-α) doubly and the α of output link band width in physical times, wherein α and β are respectively and are less than or equal to 1 positive number.
7, the method for claim 1 is characterized in that may further comprise the steps the process in wherein said selection path:
(1) this node requires and professional destination address according to QoS, selects to satisfy the path with maximum available bandwidth that service bandwidth requires from the routing table of this node;
(2) be the cycle with T1, write down the total service rate that inserts on the above-mentioned selected path;
(3) be the available bandwidth in the selected path of computation of Period with T1, and upgrade this node routing table.
8, method as claimed in claim 7, it is characterized in that wherein selecting route method to be in (1) step: according to the path available bandwidth that calculates, select the path of maximum available bandwidth, if there are many paths of satisfying business need and having maximum available bandwidth, then select wherein one at random; If do not have the path of satisfying business need, then discarding traffic packet.
9, method as claimed in claim 7, it is characterized in that wherein the method for calculating the available bandwidth in selected path in (3) is: last one-period this node routing table in the available bandwidth in selected path, the α that deducts the total service rate that inserts on this selected path of one-period doubly, wherein α is less than or equal to 1 positive number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031467903A CN1200538C (en) | 2003-07-11 | 2003-07-11 | Method for selecting route by accounting and controlling node status |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031467903A CN1200538C (en) | 2003-07-11 | 2003-07-11 | Method for selecting route by accounting and controlling node status |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1472922A true CN1472922A (en) | 2004-02-04 |
| CN1200538C CN1200538C (en) | 2005-05-04 |
Family
ID=34156119
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031467903A Expired - Fee Related CN1200538C (en) | 2003-07-11 | 2003-07-11 | Method for selecting route by accounting and controlling node status |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1200538C (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100395991C (en) * | 2005-02-04 | 2008-06-18 | 华为技术有限公司 | End-to-end business automatic configurating and restoring method in ASON network |
| CN100440867C (en) * | 2005-11-01 | 2008-12-03 | 清华大学 | Method of real time soft seizing wave length route photo network |
| CN100450099C (en) * | 2006-08-24 | 2009-01-07 | 华为技术有限公司 | Method of generating service route based on light network service flow |
| CN101043236B (en) * | 2006-05-10 | 2010-05-12 | 华为技术有限公司 | Method for controlling emission power of mesh network node and mesh network node |
| CN101841883B (en) * | 2006-05-10 | 2011-11-09 | 华为技术有限公司 | Method and device for controlling transmission power of mesh network nodes |
| CN102271368A (en) * | 2011-07-27 | 2011-12-07 | 哈尔滨工业大学深圳研究生院 | Cross-layer-resource-optimization-based space-sky information network information transmission method and system |
| CN102447625A (en) * | 2011-11-23 | 2012-05-09 | 清华大学 | Node state control method based on feedback control mechanism of link between nodes |
| CN101568146B (en) * | 2008-04-21 | 2012-08-22 | 株式会社Ntt都科摩 | Communication terminal device and reception environment reporting method |
| CN101394337B (en) * | 2007-09-21 | 2012-11-07 | 华为技术有限公司 | Method, system and device for message routing between network nodes based on P2P |
| CN106165354A (en) * | 2014-04-10 | 2016-11-23 | 第三雷沃通讯有限责任公司 | The network path using bandwidth prediction selects |
| CN106685828A (en) * | 2016-12-19 | 2017-05-17 | 武汉船舶通信研究所 | Message transmitting method and apparatus |
| CN110071977A (en) * | 2019-04-25 | 2019-07-30 | 北京风行极客科技有限公司 | A kind of data transmission method and device |
| CN111163005A (en) * | 2019-12-16 | 2020-05-15 | 联想(北京)有限公司 | Information processing method, device, terminal and storage medium |
-
2003
- 2003-07-11 CN CNB031467903A patent/CN1200538C/en not_active Expired - Fee Related
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100395991C (en) * | 2005-02-04 | 2008-06-18 | 华为技术有限公司 | End-to-end business automatic configurating and restoring method in ASON network |
| CN100440867C (en) * | 2005-11-01 | 2008-12-03 | 清华大学 | Method of real time soft seizing wave length route photo network |
| CN101043236B (en) * | 2006-05-10 | 2010-05-12 | 华为技术有限公司 | Method for controlling emission power of mesh network node and mesh network node |
| CN101841883B (en) * | 2006-05-10 | 2011-11-09 | 华为技术有限公司 | Method and device for controlling transmission power of mesh network nodes |
| CN100450099C (en) * | 2006-08-24 | 2009-01-07 | 华为技术有限公司 | Method of generating service route based on light network service flow |
| CN101394337B (en) * | 2007-09-21 | 2012-11-07 | 华为技术有限公司 | Method, system and device for message routing between network nodes based on P2P |
| CN101568146B (en) * | 2008-04-21 | 2012-08-22 | 株式会社Ntt都科摩 | Communication terminal device and reception environment reporting method |
| CN102271368A (en) * | 2011-07-27 | 2011-12-07 | 哈尔滨工业大学深圳研究生院 | Cross-layer-resource-optimization-based space-sky information network information transmission method and system |
| CN102271368B (en) * | 2011-07-27 | 2015-02-25 | 哈尔滨工业大学深圳研究生院 | Cross-layer-resource-optimization-based space-sky information network information transmission method and system |
| CN102447625A (en) * | 2011-11-23 | 2012-05-09 | 清华大学 | Node state control method based on feedback control mechanism of link between nodes |
| CN102447625B (en) * | 2011-11-23 | 2014-06-04 | 清华大学 | Node state control method based on feedback control mechanism of link between nodes |
| CN106165354A (en) * | 2014-04-10 | 2016-11-23 | 第三雷沃通讯有限责任公司 | The network path using bandwidth prediction selects |
| CN106685828A (en) * | 2016-12-19 | 2017-05-17 | 武汉船舶通信研究所 | Message transmitting method and apparatus |
| CN106685828B (en) * | 2016-12-19 | 2019-10-08 | 武汉船舶通信研究所 | A kind of message transmitting method and device |
| CN110071977A (en) * | 2019-04-25 | 2019-07-30 | 北京风行极客科技有限公司 | A kind of data transmission method and device |
| CN110071977B (en) * | 2019-04-25 | 2022-04-01 | 北京风行极客科技有限公司 | Data transmission method and device |
| CN111163005A (en) * | 2019-12-16 | 2020-05-15 | 联想(北京)有限公司 | Information processing method, device, terminal and storage medium |
| CN111163005B (en) * | 2019-12-16 | 2021-06-15 | 联想(北京)有限公司 | Information processing method, device, terminal and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1200538C (en) | 2005-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2195980B1 (en) | Method, system and computer program product for adaptive congestion control on virtual lanes for data centre ethernet architecture | |
| CN101582842A (en) | Congestion control method and congestion control device | |
| CN1200538C (en) | Method for selecting route by accounting and controlling node status | |
| Abbas et al. | Fairness-driven queue management: A survey and taxonomy | |
| CN113746748B (en) | Explicit congestion control method in named data network | |
| WO2004092927A2 (en) | Call admission control/session management based on n source to destination severity levels for ip networks | |
| CN104272680A (en) | Signalling congestion | |
| CN102075444A (en) | Network system and method for guaranteeing multi-type service quality | |
| EP3323229B1 (en) | Method and apparatus for managing network congestion | |
| US20030214951A1 (en) | Method for differentiating services and users in communication networks | |
| CN102763385A (en) | Communication transport optimized for data center environment | |
| CN1449610A (en) | Multi-path dynamic routing algorithm | |
| CN113098783B (en) | Named data network congestion control method based on link bandwidth and time delay | |
| CN111464437B (en) | Multipath transmission path optimization method based on forward time delay in vehicle-mounted heterogeneous network | |
| Ni et al. | OCPS: Offset compensation based packet scheduling mechanism for multipath TCP | |
| CN104618258A (en) | Control method of data transmission rate | |
| Ye et al. | PTP: Path-specified transport protocol for concurrent multipath transmission in named data networks | |
| CN115460156A (en) | Data center lossless network congestion control method, device, equipment and medium | |
| Yan et al. | Transmission protocol customization for network slicing: A case study of video streaming | |
| WO2008134049A1 (en) | Lightweight bandwidth-management scheme for elastic traffic | |
| US9258352B2 (en) | Method for transmission in a multi-destination network | |
| Shi | Token-based congestion control: Achieving fair resource allocations in P2P networks | |
| Das et al. | A novel congestion control scheme for delay tolerant networks | |
| Awadallah et al. | TCP-BFA: Buffer fill avoidance | |
| Chan et al. | A hybrid congestion control for TCP over high speed networks |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20050504 |