CN102333017B - Method and device for calculating path loss in transparent interconnection of lots of links (TRILL) network - Google Patents
Method and device for calculating path loss in transparent interconnection of lots of links (TRILL) network Download PDFInfo
- Publication number
- CN102333017B CN102333017B CN2011103379529A CN201110337952A CN102333017B CN 102333017 B CN102333017 B CN 102333017B CN 2011103379529 A CN2011103379529 A CN 2011103379529A CN 201110337952 A CN201110337952 A CN 201110337952A CN 102333017 B CN102333017 B CN 102333017B
- Authority
- CN
- China
- Prior art keywords
- path loss
- current
- static
- self
- loss
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a method and a device for calculating path loss in a transparent interconnection of lots of links (TRILL) network. The method comprises the following steps of: transmitting a message Hello carrying an own path loss parameter to other routing bridges (RBs) on the same link; receiving the message Hello carrying the path loss parameters of the other RBs transmitted by the other RBs; and calculating the path loss between the current RB and the other RBs according to an own static path loss and the path loss parameters of the other RBs. By the method, a message forwarding path can be optimized.
Description
Technical field
The present invention relates to communication technical field, particularly a kind of multichain connects path loss calculation method and apparatus in transparent interconnection (TRILL, the Transparent Interconnection of Lots of Links) network.
Background technology
TRILL is link layer (L2) network standard that Internet Engineering task groups (IETF) is recommended, and is used for solving the deficiency of large-scale data center spanning tree (STP) agreement.
In the TRILL network, the equipment of operation TRILL agreement is called routing bridge (RB, Routing Bridge) equipment, uses hello packet to carry out information interaction between the direct-connected RB equipment on the same link.After setting up two-way connection between the RB on the same link, local terminal RB is according to the path loss between local port rate calculations and the opposite end RB, and the path loss that calculates is carried in the Link State Packet (LSP) sends.The LSP message is at whole TRILL Internet Transmission, after arbitrary RB receives the LSP message of other all RB in the TRILL network of its place, can form the LSDB database, carry out topology according to the link information between each RB in the LSDB database and calculate, and carry out data message forwarding according to topological result of calculation.Therefore, the road can affect topological result of calculation through the result of calculation of loss.
For convenience of description, below with only obtain according to the local port rate calculations of local terminal RB in the prior art and opposite end RB between the road be referred to as the static path loss of local terminal RB through loss.
Carry out path loss calculation of the prior art is described below in conjunction with Fig. 1, Fig. 2.
Fig. 1 is the path loss schematic diagram when on the prior art same link two RB only being arranged, comprise RBa and RBb, RBa sets up two-way the connection with RBb, wherein, path loss between RBa and RBb is only relevant with the static path loss of RBa, and (Cost ∝ RBa shown in Figure 1 represents that the static path loss of path loss between RBa and RBb and RBa is relevant, wherein, represent the static path loss of RBa with RBa), the path loss between RBb and RBa is only relevant with the static path loss of RBb.Like this, RBa carries the path loss between self and RBb in the LSP message that sends, and RBb then carries the path loss between self and RBa in the LSP message that sends.
Fig. 2 is the path loss schematic diagram when comprising two above RB on the prior art same link, comprise RBc, RBd, RBe, in addition, in order to simplify topological structure, DRB on this link (being assumed to be RBc) generated a virtual dummy node RBc ' as respectively with RBc, RBd, the RB that RBe is direct-connected, RBc, RBd, RBe is direct-connected with RBc ' and set up two-way the connection respectively, wherein, RBc ' respectively with RBc, RBd, path loss Cost between RBe is 0, and RBc, RBd, path loss Cost between RBe and RBc ' then respectively with RBc, RBd, the static path loss of RBe self is relevant.Like this, RBc, RBd, RBe only carry respectively the path loss between self and RBc ' in the LSP message that sends separately, and the LSP message of RBc ' is responsible for transmission by the DRB on this link, wherein carries the path loss between dummy node RBc ' and RBc, RBd, RBe.
Find by the networking test, the forward-path that prior art is calculated does not sometimes have most.
Summary of the invention
In view of this, the object of the present invention is to provide path loss calculation method in a kind of TRILL network, the method can be optimized message forwarding path.
In order to achieve the above object, the invention provides path loss calculation method in a kind of TRILL network, the method comprises:
The hello packet of the path loss parameter of self is carried in other RB transmissions on same link;
Receive the hello packet of the path loss parameter of carrying described other RB that described other RB send;
According to the static path loss of self, and the path loss parameter of described other RB, the path loss between calculating and described other RB.
The present invention also provides a kind of routing bridge RB, and this RB comprises: Transmit-Receive Unit, path loss computing unit;
Described Transmit-Receive Unit carries the hello packet of the path loss parameter of self for other RB transmissions on same link; Be used for receiving the hello packet of the path loss parameter of carrying described other RB that described other RB send;
Described path loss computing unit is used for the static path loss according to self, and the path loss parameter of described other RB that carry in the hello packet of described other RB of receiving of Transmit-Receive Unit, calculate and described other RB between path loss.
By top technical scheme as can be known, among the present invention, current RB calculate with other RB between path loss the time, with the static path loss of self, and in the consideration again of the path loss parameter of described other RB, carry out the path loss calculation between current RB and other RB.Path loss calculation method according to the present invention can be carried at the path loss that calculates the LSP message and transmit in the TRILL network after obtaining path loss between each RB, thereby can affect the topological result of calculation of each RB, optimizes message forwarding path.
Description of drawings
Fig. 1 is the path loss schematic diagram when on the prior art same link two RB only being arranged;
Fig. 2 is the path loss schematic diagram when comprising two above RB on the prior art same link;
Fig. 3 is the schematic flow sheet of path loss calculation method in the embodiment of the invention TRILL network;
Fig. 4 is the form schematic diagram of embodiment of the invention Load-Info TLV;
The path loss schematic diagram that Fig. 5 is the embodiment of the invention when on the same link shown in Figure 1 two RB only being arranged;
The path loss schematic diagram that Fig. 6 is the embodiment of the invention when comprising two above RB on the same link shown in Figure 2;
Fig. 7 is the structural representation of embodiment of the invention RB.
Embodiment
In order to make purpose of the present invention, technical scheme and advantage clearer, below in conjunction with the accompanying drawing embodiment that develops simultaneously, technical scheme of the present invention is elaborated.
Referring to Fig. 3, Fig. 3 is the schematic flow sheet of path loss calculation method in the embodiment of the invention TRILL network, may further comprise the steps:
Step 301, current RB send the hello packet of the path loss parameter of carrying self to other RB on the same link.
In the TRILL network, hello packet is mainly used in the information interaction between the RB on the same link.In the present embodiment, when current RB sends hello packet at other RB on same link, can carry path loss parameter in hello packet, described path loss parameter can comprise: load and static path loss.Here, described static path loss, only refer in the prior art according to the road between the local port speedometer opposite end RB that calculate and direct-connected through loss, only specifically can be referring to the definition in the TRILL relevant criterion according to the method for the static path loss between local port rate calculations and direct-connected opposite end RB.
Can in hello packet, increase a Load-Info TLV, (TLV is a kind of coded format to use TLV, wherein T represents that Type, L represent Length, V represents value) form, specifically referring to the form schematic diagram of embodiment of the invention Load-Info TLV shown in Figure 4, wherein, Type takies 1 byte, and the Type value is LoadInfo, shows that this TLV is Load-Info TLV; Length takies 1 byte, and occurrence is determined by the total length that the Value field of back takies; The Value field comprises load value (LoadValue) and static path loss (LinkCost).
Need to prove, above-mentioned use Load-Info TLV is a concrete example with the method that load and the static path loss of RB is encapsulated in the hello packet, also can use extended formatting to encapsulate, and the present invention is not restricted this.
The hello packet of the path loss parameter of carrying described other RB that step 302, described other RB of current RB reception send.
Here, the operation that current RB is identical with other RB execution on the same link, that is: both send the hello packet of the path loss parameter of carrying self to other RB, receive again the hello packet of the path loss parameter of carrying described other RB that described other RB send.
Step 303, current RB are according to the static path loss of self, and the path loss parameter of described other RB, calculate and described other RB between path loss.
In this step, the path loss of current RB between calculating and described other RB is (for the ease of distinguishing, also can be called the dynamic route loss) time, load and the static path loss of described other RB are taken into account, according to the static path loss of self and load and the static path loss of described other RB, the path loss between calculating and described other RB.The load of described other RB is larger, path loss between other RB that calculate and described is also larger, then when carrying out topology calculating that current RB is just less as the probability of optimal path to the path of described other RB, thus data message is transmitted along the less path of path loss.The load of described other RB is less, path loss between other RB that calculate and described is also less, then when carrying out topology calculating that current RB is just larger as the probability of optimal path to the path of described other RB, thus data message is transmitted along the less path of path loss.
For the situation that only comprises current RB and described other RB in the same link (also being only to comprise two RB on the same link), owing to not relating to dummy node, can adopt following formula to calculate road between current RB and described other RB through loss:
Cost=Cs+K*Cd, wherein, Cost is that road between current RB and described other RB is through loss; Cs is the static path loss of current RB; Cd is that the static road of described other RB is through loss; K is the calculated factor that the load calculation according to described other RB obtains.
Referring to Fig. 5, the path loss schematic diagram that Fig. 5 is the embodiment of the invention when on the same link shown in Figure 1 two RB only being arranged, not only the static path loss with RBa is relevant through loss on road between RBa and RBb, also with load and the relevant (Cost ∝ { RBa as shown in Figure 5 of static path loss of RBb, RBb, Lb}, expression RBa is relevant through static path loss and the RBb load of loss and RBa, RBb with road between RBb, wherein, represent the static path loss of RBa with RBa, represent the static path loss of RBb with RBb, represent the load of RBb with Lb); Equally, not only the static path loss with RBb is relevant through loss for the road between RBb and RBa, and also load and the static path loss with RBa is relevant.
For the situation that comprises current RB and a plurality of other RB in the same link (also being the RB that comprises on the same link more than three or three), owing to relating to dummy node, the method for calculating path loss can be as follows:
If current RB is DRB, the path loss between the dummy node that then self static path loss is generated as current RB and current RB, and adopt following formula to calculate path loss between described dummy node and current RB and described other RB:
Cost=K*Cd, wherein, Cost is that road between described dummy node and current RB or described other RB is through loss; Cd is the static path loss between current RB or described other RB; K is the calculated factor that the load calculation according to current RB or described other RB obtains;
If current RB is not DRB, the path loss between the dummy node that then self static path loss is generated as current RB and DRB.
Referring to Fig. 6, the path loss schematic diagram that Fig. 6 is the embodiment of the invention when comprising two above RB on the same link shown in Figure 2, road between RBc, RBd, RBe and dummy node RBc ' is all constant through loss, still the static path loss for only obtaining according to the local port rate calculations in the prior art; Dummy node respectively with RBc, RBd, RBe between path loss (as shown in Figure 6 Cost ∝ { RBc relevant with the static path loss with RBc, RBd, RBe load separately respectively then, Lc}, expression dummy node RBc ' is relevant through static path loss and the load of loss and RBc with road between RBc, wherein, represent the static path loss of RBc with RBc, represent the load of RBc with Lc).Like this, the path loss between RBc and RBd that is to say that the road of road through between loss and RBc ' and RBd between RBc and RBc ' is through the loss sum; Path loss between RBc and RBe that is to say the road of road through between loss and RBc ' and RBe between RBc and RBc ' through the loss sum, the like.
In addition, the method that obtains calculated factor K according to the load calculation of RB can have multiple, for example, the interval [0 that the load of RB may be able to be fallen into, 1] is divided into a plurality of subintervals, be calculated factor of each subinterval distribution, and determine the value of calculated factor K according to the actual subinterval that falls into of the load of this RB; In addition, also can be for load variations arrange step-length, when load variations surpasses step-length, according to the increase of load or reduce to determine the increasing or decreasing etc. of K value.
The below is divided into a plurality of subintervals for the interval [0,1] that the load with RB may fall into, and is calculated factor of each subinterval distribution, and determines that according to the actual subinterval that falls into of the load of this RB the method for the value of calculated factor K further describes:
In advance the interval [0,1] at the load place of RB being divided into the subinterval of default number, is that a calculated factor is distributed in each subinterval; After the load of knowing certain RB, can determine first the subinterval at the load place of this RB, calculated factor corresponding to the subinterval that then will determine is as the value of calculated factor K.Here, the default number in subinterval can be determined according to actual conditions.So that interval [0,1] is divided into [0,0.5], (0.5,0.9), [0.9,1] totally 3 subintervals are example, and are subinterval [0,0.5] the Distribution Calculation factor 0, are subinterval (0.5,0.9) the Distribution Calculation factor 10, be subinterval [0.9,1] the Distribution Calculation factor 100; Like this, when the load of RB was less than or equal to 0.5, the value that can determine calculated factor k was 0, when the load of RB greater than 0.5 and less than 0.9 the time, the value that can determine calculated factor k is 10, when the load of RB more than or equal to 0.9 the time, the value that can determine calculated factor k is 100.
In the prior art, the path loss between the direct-connected RB is only relevant with the static path loss of local terminal RB, does not consider the situations such as the load of opposite end RB and static path loss.Because the static path loss of local terminal RB is only relevant with the port speed of local terminal RB, path loss can remain unchanged always, accordingly, the forward-path that calculates can not change yet, when the load of opposite end RB equipment is heavier, also can't change the forward-path of flow, and then, also can't reduce the load that reduces opposite end RB by the message of opposite end RB, this obviously is irrational.And in the embodiment of the invention shown in Figure 3, when the path loss of calculating between the RB, not only considered the static path loss of local terminal RB, load and the static path loss of opposite end RB have also been considered, like this, when the load of opposite end RB increases the weight of, the corresponding road that calculates also can become large through loss, when the path loss that calculates be carried at be broadcast in the TRILL network in the LSP message after, each RB can re-start topology through loss according to the road between each RB in the TRILL network and calculate, thereby can obtain the optimum forward-path of message, and then also can improve the forward efficiency of message.
Above path loss calculation method in the embodiment of the invention TRILL network is had been described in detail, the present invention also provides a kind of routing bridge RB, is applied in the TRILL network, and this RB can optimize message forwarding path.
Referring to Fig. 7, Fig. 7 is the structural representation of embodiment of the invention RB, and this RB comprises: Transmit-Receive Unit 701, path loss computing unit 702; Wherein,
Transmit-Receive Unit 701 carries the hello packet of the path loss parameter of self for other RB transmissions on same link; Be used for receiving the hello packet of the path loss parameter of carrying described other RB that described other RB send;
Path loss computing unit 702 is used for the static path loss according to self, and the path loss parameter of described other RB that carry in the hello packet of described other RB of receiving of Transmit-Receive Unit, calculate and described other RB between path loss.
Only comprise current RB and described other RB on the described same link;
The path loss parameter of carrying in the hello packet of described other RB that described Transmit-Receive Unit 701 receives comprises: the load of described other RB and static path loss;
Described path loss computing unit 702, in the static path loss according to self, and the path loss parameter of described other RB that carry in the hello packet of described other RB of receiving of Transmit-Receive Unit, calculate with described other RB between path loss the time, be used for the following formula of employing and calculate:
Cost=Cs+K*Cd, wherein, Cost is that road between current RB and described other RB is through loss; Cs is the static path loss of current RB; Cd is that the static road of described other RB is through loss; The K calculated factor that to be the path loss computing unit obtain according to the load calculation of described other RB.
Comprise current RB and a plurality of other RB on the described same link;
The path loss parameter of carrying in the hello packet of described other RB that described Transmit-Receive Unit 701 receives comprises: the load of described other RB and static path loss;
Described path loss computing unit 702, in the static path loss according to self, and the path loss parameter of described other RB that carry in the hello packet of described other RB of receiving of Transmit-Receive Unit, calculate and described other RB between path loss the time, be used for:
If current RB is DRB, the path loss between the dummy node that then self static path loss is generated as current RB and current RB, and adopt following formula to calculate path loss between described dummy node and current RB and described other RB:
Cost=K*Cd, wherein, Cost is that road between described dummy node and current RB or described other RB is through loss; Cd is the static path loss between current RB or described other RB; The K calculated factor that to be the path loss computing unit obtain according to the load calculation of current RB or described other RB;
If current RB is not DRB, the path loss between the dummy node that then self static path loss is generated as current RB and DRB.
This RB also comprises dispensing unit 703;
Described dispensing unit 703 is used in advance interval [0,1] being divided into the subinterval of default number, and is calculated factor of each subinterval distribution;
Described path loss computing unit 702 when the load calculation according to RB obtains calculated factor K, is used for: determine the subinterval at the load place of this RB, the calculated factor that dispensing unit 704 is distributed for this subinterval is as the value of calculated factor K.
The above only is preferred embodiment of the present invention, and is in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, is equal to replacement, improvement etc., all should be included within the scope of protection of the invention.
Claims (8)
1. a multichain connects path loss calculation method in the transparent interconnection TRILL network, it is characterized in that, the method comprises:
The hello packet of the path loss parameter of self is carried in other routing bridges RB transmission on same link; Described path loss parameter comprises: load and static path loss;
Receive the hello packet of the path loss parameter of carrying described other RB that described other RB send;
According to the static path loss of self, and the path loss parameter of described other RB, the path loss between calculating and described other RB.
2. path loss calculation method in the TRILL network according to claim 1 is characterized in that, only comprises current RB and described other RB on the described same link;
Described static path loss according to self, and the path loss parameter of described other RB, the road between calculating and described other RB is the following formula of employing through the method for loss:
Cost=Cs+K*Cd, wherein, Cost is that road between current RB and described other RB is through loss; Cs is the static path loss of current RB; Cd is that the static road of described other RB is through loss; K is the calculated factor that the load calculation according to described other RB obtains.
3. path loss calculation method in the TRILL network according to claim 1 is characterized in that, comprises current RB and a plurality of other RB on the described same link;
Described static path loss according to self, and the path loss parameter of described other RB, the method for the path loss between calculating and described other RB is:
If current RB is for specifying routing bridge DRB, the path loss between the dummy node that then self static path loss is generated as current RB and current RB, and the following formula of employing calculates the path loss between described dummy node and current RB and described other RB:
Cost=K*Cd, wherein, Cost is that road between described dummy node and current RB or described other RB is through loss; Cd is the static path loss between current RB or described other RB; K is the calculated factor that the load calculation according to current RB or described other RB obtains;
If current RB is not DRB, the path loss between the dummy node that then self static path loss is generated as current RB and DRB.
4. path loss calculation method according to claim 2 or in the 3 described TRILL networks is characterized in that,
In advance interval [0,1] is divided into the subinterval of default number, and for distributing a calculated factor in each subinterval;
The method that obtains calculated factor K according to the load calculation of RB is: determine the subinterval at the load place of this RB, the calculated factor that will distribute for this subinterval is as the value of calculated factor K.
5. a routing bridge RB is applied to multichain and connects in the transparent interconnection TRILL network, it is characterized in that, this RB comprises: Transmit-Receive Unit, path loss computing unit;
Described Transmit-Receive Unit carries the hello packet of the path loss parameter of self for other RB transmissions on same link; Be used for receiving the hello packet of the path loss parameter of carrying described other RB that described other RB send; Described path loss parameter comprises: load and static path loss;
Described path loss computing unit is used for the static path loss according to self, and the path loss parameter of described other RB that carry in the hello packet of described other RB of receiving of Transmit-Receive Unit, calculate and described other RB between path loss.
6. RB according to claim 5 is characterized in that, only comprises current RB and described other RB on the described same link;
Described path loss computing unit, in the static path loss according to self, and the path loss parameter of described other RB that carry in the hello packet of described other RB of receiving of Transmit-Receive Unit, calculate with described other RB between path loss the time, be used for the following formula of employing and calculate:
Cost=Cs+K*Cd, wherein, Cost is that road between current RB and described other RB is through loss; Cs is the static path loss of current RB; Cd is that the static road of described other RB is through loss; The K calculated factor that to be the path loss computing unit obtain according to the load calculation of described other RB.
7. RB according to claim 5 is characterized in that, comprises current RB and a plurality of other RB on the described same link;
Described path loss computing unit, in the static path loss according to self, and the path loss parameter of described other RB that carry in the hello packet of described other RB of receiving of Transmit-Receive Unit, calculate and described other RB between path loss the time, be used for:
If current RB is for specifying routing bridge DRB, the path loss between the dummy node that then self static path loss is generated as current RB and current RB, and the following formula of employing calculates the path loss between described dummy node and current RB and described other RB:
Cost=K*Cd, wherein, Cost is that road between described dummy node and current RB or described other RB is through loss; Cd is the static path loss between current RB or described other RB; The K calculated factor that to be the path loss computing unit obtain according to the load calculation of current RB or described other RB;
If current RB is not DRB, the path loss between the dummy node that then self static path loss is generated as current RB and DRB.
8. according to claim 6 or 7 described RB, it is characterized in that, this RB also comprises dispensing unit;
Described dispensing unit is used in advance interval [0,1] being divided into the subinterval of default number, and is calculated factor of each subinterval distribution;
Described path loss computing unit when the load calculation according to RB obtains calculated factor K, is used for: determine the subinterval at the load place of this RB, the calculated factor that dispensing unit is distributed for this subinterval is as the value of calculated factor K.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103379529A CN102333017B (en) | 2011-10-31 | 2011-10-31 | Method and device for calculating path loss in transparent interconnection of lots of links (TRILL) network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103379529A CN102333017B (en) | 2011-10-31 | 2011-10-31 | Method and device for calculating path loss in transparent interconnection of lots of links (TRILL) network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102333017A CN102333017A (en) | 2012-01-25 |
| CN102333017B true CN102333017B (en) | 2013-01-23 |
Family
ID=45484627
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011103379529A Active CN102333017B (en) | 2011-10-31 | 2011-10-31 | Method and device for calculating path loss in transparent interconnection of lots of links (TRILL) network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102333017B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102685011B (en) * | 2012-05-17 | 2016-08-03 | 杭州华三通信技术有限公司 | Route computing method in a kind of TRILL network and equipment |
| CN104468386B (en) * | 2014-10-11 | 2017-11-24 | 新华三技术有限公司 | Flow equalization method and device in a kind of Ethernet virtualization internet network |
| CA3042537A1 (en) | 2016-11-04 | 2018-05-11 | Battelle Memorial Institute | Corrosion inhibiting coating additive |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1976528A (en) * | 2006-12-15 | 2007-06-06 | 北京中星微电子有限公司 | Method and apparatus for obtaining path wear-out error |
| CN101184033A (en) * | 2005-10-22 | 2008-05-21 | 华为技术有限公司 | Loss distribution method and loss distribution server |
| CN101635933A (en) * | 2008-07-22 | 2010-01-27 | 大唐移动通信设备有限公司 | Method, system and equipment for detecting path loss |
| CN102075446A (en) * | 2011-03-01 | 2011-05-25 | 杭州华三通信技术有限公司 | Interconnection method of transparent interconnection network of lots of links in different places and operator edge device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6973039B2 (en) * | 2000-12-08 | 2005-12-06 | Bbnt Solutions Llc | Mechanism for performing energy-based routing in wireless networks |
-
2011
- 2011-10-31 CN CN2011103379529A patent/CN102333017B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101184033A (en) * | 2005-10-22 | 2008-05-21 | 华为技术有限公司 | Loss distribution method and loss distribution server |
| CN1976528A (en) * | 2006-12-15 | 2007-06-06 | 北京中星微电子有限公司 | Method and apparatus for obtaining path wear-out error |
| CN101635933A (en) * | 2008-07-22 | 2010-01-27 | 大唐移动通信设备有限公司 | Method, system and equipment for detecting path loss |
| CN102075446A (en) * | 2011-03-01 | 2011-05-25 | 杭州华三通信技术有限公司 | Interconnection method of transparent interconnection network of lots of links in different places and operator edge device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102333017A (en) | 2012-01-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7902973B2 (en) | Alarm reordering to handle alarm storms in large networks | |
| CN102263697B (en) | Method and device for sharing aggregated link traffic | |
| CN109089294B (en) | Unmanned aerial vehicle network flow configuration method and system based on SDN distributed control | |
| CN108111411B (en) | Backbone network and dynamic path planning system and planning method thereof | |
| CN101854697A (en) | Multi-constraint quality-of-service control routing method and system for wireless mesh network | |
| CN107018545B (en) | A kind of ad hoc network method applied in wireless communication system | |
| CN102546381A (en) | Method of selecting IP (internet protocol) network data transmission path | |
| CN102281193A (en) | Method and fiber channel (FC) equipment for realizing message forwarding in fiber channel network | |
| CN102333017B (en) | Method and device for calculating path loss in transparent interconnection of lots of links (TRILL) network | |
| CN102238057A (en) | Ethernet-tree realization method, system, device and network equipment | |
| CN107682264B (en) | Data transmission method and system based on real-time active path planning | |
| CN102711125A (en) | Method for improving transmission capability of wireless mesh network | |
| CN102724064A (en) | Method for building network application simulation system | |
| CN107509229B (en) | A kind of car networking chance method for routing calculated based on vehicle node centrality | |
| CN106034071A (en) | Data message transmission method and edge routing bridge equipment | |
| CN104243303A (en) | Updating message transmitting method and device in autonomous system loop networking | |
| CN103326916A (en) | System and method for automatic partition of intelligent substation and optimization of VLAN | |
| CN102959909A (en) | Method and apparatus for generating distribution trees, and routing bridge | |
| CN101977159A (en) | Management method of bandwidth resources of narrow band network | |
| CN104639557A (en) | Method and system for establishing PCEP (Path Computation Element Communication Protocol) session and equipment | |
| CN107465628A (en) | The control method and control device of a kind of software defined network | |
| CN104917677A (en) | Data stream forwarding control method and system | |
| CN103200108B (en) | A kind of prime number route network generation method | |
| CN102685011B (en) | Route computing method in a kind of TRILL network and equipment | |
| CN105376178B (en) | A kind of method and apparatus of data transmission |
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 | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Patentee after: NEW H3C TECHNOLOGIES Co.,Ltd. Address before: 310053 Hangzhou hi tech Industrial Development Zone, Zhejiang province science and Technology Industrial Park, No. 310 and No. six road, HUAWEI, Hangzhou production base Patentee before: HANGZHOU H3C TECHNOLOGIES Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230620 Address after: 310052 11th Floor, 466 Changhe Road, Binjiang District, Hangzhou City, Zhejiang Province Patentee after: H3C INFORMATION TECHNOLOGY Co.,Ltd. Address before: 310052 Changhe Road, Binjiang District, Hangzhou, Zhejiang Province, No. 466 Patentee before: NEW H3C TECHNOLOGIES Co.,Ltd. |