Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W28/00—Network traffic management; Network resource management
  • H04W28/02—Traffic management, e.g. flow control or congestion control
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/10—Flow control; Congestion control
  • H04L47/11—Identifying congestion
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/10—Flow control; Congestion control
  • H04L47/12—Avoiding congestion; Recovering from congestion
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L47/00—Traffic control in data switching networks
  • H04L47/10—Flow control; Congestion control
  • H04L47/26—Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W28/00—Network traffic management; Network resource management
  • H04W28/02—Traffic management, e.g. flow control or congestion control
  • H04W28/0289—Congestion control
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W8/00—Network data management
  • H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
  • H04W8/04—Registration at HLR or HSS [Home Subscriber Server]

Definitions

• the invention relates to a method for congestion control for the avoidance of traffic congestion within a network, particularly a wireless mesh network.
• the invention further relates to a congestion notification element granting an en- hanced congestion control.
• An exemplary congestion control method including a congestion notification element is disclosed in IEEE P802.11s, Draft Standard »Wireless LAN Medium Access Control (MAC) and Physi ⁇ cal Layer (PHY) specifications - Mesh Networkings version D7.03, November 2010, hereinafter referred to as »draft standards
• the structure of said congestion notification element is particularly described in section 7.3.2.99 of the draft standard.
• a mesh node that detects congestion may transmit a congestion notification element to the mesh nodes of its traffic source or other adjacent mesh nodes.
• a major drawback of this known congestion control method is an inherent impreciseness in decreasing the congestion be ⁇ tween the source and the mesh node detecting the congestion while affecting traffic between adjacent nodes which previously have not been affected by the congestion.
• FIG. 1 demonstrates the drawback mentioned above when applying said known congestion control method.
• a plurality of mesh nodes A, B,C,D,E are logically interconnected by links which are depicted by lines interconnecting some of the mesh nodes A, B,C,D,E.
• a first dataflow DF1 is ranging from a first mesh node A passing a second mesh node B and a third mesh node C to a fourth mesh node D, which is the destination node D of said first data ⁇ flow DF1.
• a second dataflow DF2 is ranging from the first mesh node A passing the sec ⁇ ond mesh node B to a fifth mesh node E, which is the destina- tion node E of said second dataflow DF2.
• a link between the third mesh node C and the fourth mesh node D is affected by a reduced transfer rate because of a bottle ⁇ neck BN of any kind between the third mesh node C and the fourth mesh node D.
• This bottleneck BN causes congestion at the third mesh node C.
• the third mesh node C sends a - not shown - congestion no ⁇ tification to the source of its link, which is the adjacent second mesh node B.
• the second mesh node B stops or decreases, or, in other words, postpones, sending data frames to the third mesh node C.
• These are data frames of the first data flow DF1.
• data frames are still sent by the second mesh node B to a fifth mesh node E along the second dataflow DF2 since the link between the second mesh node B and the fifth mesh node E is not affected by the bottleneck BN between the third mesh node C and the fourth mesh node D.
• the second mesh node B is affected by congestion since the second mesh node B does not forward data frames to the third mesh node C any more but still receives data frames from an adjacent first mesh node A.
• the second mesh node B sends a congestion notification to the first mesh node A. Having received this notification, the first mesh node A will stop sending data frames to the second mesh node B. These are data frames of both the first data flow DF1 and the second data flow DF2.
• the described scenario eventually leads to a situation, where the second data flow DF2 between the first mesh node A and the fifth mesh node E is stopped although the initial bottle ⁇ neck between the third mesh node C and the fourth mesh node D has no negative impact on the second data flow DF2. It is an object of the present invention to provide a conges ⁇ tion notification element for indicating an enhanced congestion status by overcoming draw-backs of currently known indi ⁇ cations of congestions which are based on a sole next hop in ⁇ dication .
• an improved congestion control method in a sense of a per-destination congestion control in mesh networks is provided, thereby overcoming the draw-backs of currently known congestion control methods based on a sole next hop control.
• a particular advantage of the proposed congestion notifica ⁇ tion element and the proposed method of congestion control lies in the ability of forwarding data frames on paths that share some links but not the bottleneck link with a path that is congestion controlled by specifying a mesh destination for which an intra-mesh congestion control is to be applied. This has not been possible with the currently specified congestion notification of draft standard IEEE 802.11s.
• the invention advantageously avoids negative performance im- pacts on flows which are not passing a congested bottleneck link.
• the congestion control proposed by the invention is ad ⁇ vantageously limited to data flows passing the bottleneck link .
• Preferred embodiments of the invention are set out in depend ⁇ ent claims.
• Fig. 1 shows an exemplary section of a network structure for illustrating a first congestion situation
• Fig. 2 shows an exemplary structure of a congestion noti ⁇ fication element according to an embodiment of the invention
• Fig. 3 shows an exemplary section of a network structure for illustrating a second congestion situation
• Fig. 4 shows an exemplary structure of a congestion noti ⁇ fication element with multiple destination addresses according to an embodiment of the inven ⁇ tion;
• Fig. 5 shows an exemplary structure of a congestion noti ⁇ fication element with multiple congestion notifica ⁇ tions according to an embodiment of the invention
• Fig. 6 shows exemplary contents of a congestion notifica ⁇ tion element according to a first application example
• Fig. 7 shows exemplary contents of a congestion notifica ⁇ tion element according to a second application example .
• Figure 2 shows an exemplary structure of a congestion notifi- cation element according to an embodiment of the invention.
• the congestion notification element includes a first field 200 captioned »Element ID « and having a length of one octet.
• a second field 202 is captioned »Length « and has a length of one octet.
• the first field 200 and the second field 202 form the header of the congestion notification element.
• the header is followed by a payload portion of the congestion notifica ⁇ tion element, which fields are described in the following.
• the congestion notification element contains four Congestion Notification Expiration Timer fields 206, 208, 210, 212, namely a first Congestion Notification Expiration Timer field 206 captioned »Congestion Notification Expiration Timer
• Congestion Notification Expiration Timer fields 206, 208, 210, 212 are dedicated to four respective access cate ⁇ gories to indicate the estimated congestion duration per ac ⁇ cess category at the mesh node transmitting the congestion notification.
• An access category also referred to as AC, is applied for implementing a Quality of Service Architecture (QoS) .
• QoS Quality of Service Architecture
• EDCA Enhanced Distributed Channel Access «
• An access category is assigned to a respective traffic type as shown below: Traffic Type: Background
• the values in the Congestion Notification Expiration Timer- fields 206, 208, 210, 212, are encoded as unsigned integers in units of 100 ⁇ .
• a third field 204 is captioned »Destination Mesh STA Address « and has a length of six octets.
• the structure of the Congestion Notification element is par- tially known so far from the draft standard IEEE 802.11s.
• this Congestion Notification element is extended by a third field 204, cap- tioned »Destination Mesh STA Address « and having a length of six octets.
• This destination field 204 contains a hardware or MAC address (Media Access Control) of the mesh destination.
• Figure 2 shows a possible format of a congestion control ele ⁇ ment amended according to an embodiment of the invention.
• the amended field 204 captioned »Destination Mesh STA Address « according to said embodiment is positioned at the first field of the payload portion of the Congestion Notification ele- ment .
• the amended destination field 204 can alter ⁇ natively be located after the four Congestion Notification Expiration Timer fields 206, 208, 210, 212 keeping the position of the already existing fields 206, 208, 210, 212.
• the length field 202 of the Congestion Notification element is set to 14.
• the field 200 captioned »Element ID « is set to an identifier value defined for this element.
• the Congestion Notification element is included in - not shown - Conges ⁇ tion Control Notification frames.
• the destination field 204 is represented as a 48-bit MAC ad ⁇ dress and is set to the address of the mesh destination for which the intra-mesh congestion control shall be applied. It is set to the broadcast address if the intra-mesh congestion control shall be applied to all destinations that use the transmitter of the congestion notification element as next hop. This broadcast address is also referred to as group ad- dress.
• a mesh station receiving an amended Congestion Notification element according to an embodiment of the invention is advan ⁇ tageously capable of stopping the forwarding of data frames with a better selectivity than known before.
• a method implying the known Congestion Notification element is compared to a method implying the amended Congestion Notification element according to an embodiment of the invention.
• the rule illustrated above will also postpone the forwarding of data frames between mesh nodes which are not affected by a bottleneck. More specifically, with reference to Figure 1, this rule would also postpone the second dataflow DF2 between the first mesh node A and the fifth mesh node E although the initial bottleneck BN between the third mesh node C and the fourth mesh node D has no negative impact on this second dataflow DF2.
• traffic between the first mesh node A and the fifth mesh node E is postponed because this traffic had to pass the second mesh node B first.
• this kind of traffic is not forwarded, because the second mesh node B has sent a Congestion Notification element to the first mesh node A.
• the address of the next hop of the data frame is equal to the transmitter address of at least one received congestion con ⁇ trol notification frame
• the destination address of the data frame is equal to at least one destination mesh node address of at least one con ⁇ area notification element that has been received from the next hop of the data frame;
• the amended rule for postponing of data frame forwarding is generally de- scribed as follows:
• the address of the next hop of the data frame is equal to the transmitter address of at least one received congestion con ⁇ trol notification frame
• the destination mesh node address of at least one congestion notification element, that has been received from the next hop of the data frame, is equal to the broadcast address; AND;
• a data frame is forwarded by a receiving node for the case that none of the two amended rules above for postponing the forwarding apply to the data frame.
• the amended rule for forwarding the data frame is generally described as follows:
• a data frame is forwarded by a receiving node for the case that:
• next hop address of the data frame is not equal to at least one next hop address from at least one received conges ⁇ tion control notification frame;
• the destination address of the data frame is not equal to at least one destination mesh node address from at least one congestion notification element that has been received from the next hop of the data frame; AND; each destination mesh node address from all congestion notification elements that have been received from the next hop of the data frame are different from the broadcast address);
• Figure 3 shows a topology where more than one data flow is affected by a bot ⁇ tleneck BN. Further on, affected data flows in Figure 3 have different destinations.
• A, B, C, D, E, F, G are logically interconnected by links which are depicted by lines interconnecting some of the mesh nodes A, B, C, D, E, F, G .
• a third dataflow DF3 is ranging from the first mesh node A passing the second mesh node B, the third mesh node C, the fourth mesh node D to a sixth mesh node F, which is the destination node F of said third dataflow DF3.
• a fourth dataflow DF4, illustrated by a dashed-and-dotted line is ranging from the first mesh node A passing the second mesh node B, the third mesh node C, the fourth mesh node D to a seventh mesh node G, which is the destination node G of said fourth dataflow DF4.
• a fifth dataflow DF5, illustrated by a dotted line is ranging from the first mesh node A passing the second mesh node B to the fifth mesh node E, which is the destination node E of said fifth dataflow DF5.
• the third mesh node C has to send two Congestion Noti- fication elements, one for each affected destination, when using the format of the Congestion Notification element as shown in Figure 2.
• FIG. 4 shows an exemplary structure of a congestion notifi ⁇ cation element with multiple destination addresses according to an alternative embodiment of the invention.
• the congestion notification element uses a list of destinations in a single Congestion Notification element.
• the congestion notification element according to Figure 4 includes a first field 400 captioned »Element ID« and having a length of one octet and a second field 402 cap ⁇ tioned »Length« and having a length of one octet.
• a third field 404 captioned »Number of Destinations N « de ⁇ fines a number (N) of fields captioned »Destination Mesh STA Address « included within the Congestion Notification element.
• the third field 404 has a length of one octet.
• Said fields 406, 408, 410 captioned »Destination Mesh STA Ad- dress « are adhered next to the third field 404, namely a first destination address field 406 captioned »Destination Mesh STA Address #1«, a field 408 in the drawing captioned »... « and denoting a wildcard for a number N-2 of further destination address fields and, finally, an N-th destination address field 410 captioned »Destination Mesh STA Address #N «.
• the congestion notification element further contains four Congestion Notification Expiration Timer fields 412, 414, 416, 418.
• the Congestion Notification Expiration Timers are the same for all listed mesh destinations. If different Congestion Notification Expiration Timers are required for some mesh destinations, multiple Congestion Notification ele ⁇ ments have to be used.
• a value of one in the third field 404 for the Number of Destinations field leads to an identical information of the Congestion Notification element shown in Figure 2.
• Figure 5 shows an exemplary structure of a further amended congestion notification element according to a further embodiment of the invention. By using said notification element the usage of different Congestion Notification Expiration Timers per affected mesh destination is supported.
• the congestion notification element according to Figure 5 includes a first field 500 captioned »Element ID« and having a length of one octet and a second field 502 cap ⁇ tioned »Length« and having a length of one octet.
• the third field 504 has a length of one octet.
• Said Congestion Notifications 506,508,510 are adhered next to the third field 504, namely a first Congestion Notification 506 captioned »Congestion Notification #1«, a field 508 in the drawing captioned »... « and denoting a wildcard for a number N-2 of further Congestion Notifications 508 and, finally, an N-th Congestion Notification 510 captioned »Conges- tion Notification #N « .
• Each Congestion Notification 506,508,510 is defined by a number of sub-fields. Said sub-fields 550,552,554,556,558 of the first Congestion Notification 506 are shown in the drawing below the illustration of the congestion notification element .
• a first sub-field 550 is captioned »Destination Mesh STA Ad ⁇ dress #1 « and has a length of six octets.
• Congestion Notification further contains four Congestion Notification Expiration Timer sub-fields 552, 554, 556, 558.
• a Congestion Notification consists of the address of the mesh destination for which congestion control has to be applied and the four Congestion Notification Expiration Timers. This allows different Congestion Notification Expiration Timers per affected mesh destination.
• a value of 1 for the Number of Congestion Notifications field 504 leads to an identical information of the Congestion Notification element shown in Figure 2.
• a rep ⁇ resentation of multiple congestion notifications is to trans- mit multiple Congestion Notification elements according to or similar to Figure 2 in a single Congestion Control Notifica ⁇ tion frame.
• This is the simplest representation of congestion notifications due to the small size of the Congestion Notifi ⁇ cation element and its easy processing.
• a wireless mesh network including some data flows as shown in
• the link from mesh node C to mesh node D is the bottleneck BN on the paths for data flows DF3, DF4.
• Mesh node C becomes congested since more data frames for des ⁇ tination mesh nodes F, G arrive at mesh node C than mesh node C can actually forward to the next hop, mesh node D.
• Data flows DF3,DF4 as the cause of the congestion can be de ⁇ rived by inspecting the respective data frames, wherein the transmitter address is set to mesh node B and the mesh desti- nation address is set to mesh node F or mesh node G, respec ⁇ tively and from the forwarding information of the paths, i.e. precursor mesh node for destination mesh nodes F, G.
• Mesh node C constructs two Congestion Notification elements according to an embodiment of the invention as shown in Figure 6 and Figure 7. The structure of said Congestion Notifi ⁇ cation elements in Figure 6 and Figure 7 corresponds to the structure according to Figure 2.
• the congestion notification element includes a first field 600 captioned »Element ID «. It contains a value that indicates a Congestion Notification element.
• a second field 602 is captioned »Length « .
• the second field 602 carries a decimal value of 14.
• a third field 604 specifying the destination mesh node address carries the MAC address of the mesh node F.
• the congestion notification element contains four Congestion Notification Expiration Timer fields 606, 608, 610, 612, namely a first Congestion Notification Expiration Timer field 606 captioned »Congestion Notification Expiration Timer
• the first Congestion Notification Expiration Timer field 606 carries an exemplary value of tO
• the second Congestion Noti ⁇ fication Expiration Timer field 608 carries an exemplary value of tl
• the third Congestion Notification Expiration Timer field 610 carries an exemplary value of t2
• the fourth Congestion Notification Expiration Timer field 612 carries an exemplary value of t3.
• the actual values of the four Congestion Notification Expiration Timers are not necessary for the explanation hereinafter.
• the congestion notification element according to Figure 7 in- eludes a first field 700 captioned »Element ID «. It contains a value that indicates a Congestion Notification element.
• a second field 702 is captioned »Length « .
• the second field 702 carries a decimal value of 14.
• a third field 704 specifying the destination mesh node address carries the MAC address of the mesh node G.
• the congestion notification element contains four Congestion Notification Expiration Timer fields 706, 708, 710, 712, namely a first Congestion Notification Expiration Timer field 706 captioned »Congestion Notification Expiration Timer
• the first Congestion Notification Expiration Timer field 706 carries an exemplary value of t4
• the second Congestion Noti ⁇ fication Expiration Timer field 708 carries an exemplary value of t5
• the third Congestion Notification Expiration Timer field 710 carries an exemplary value of t6
• the fourth Congestion Notification Expiration Timer field 712 carries an exemplary value of t7.
• the actual values of the four Congestion Notification Expiration Timers are not necessary for the explanation hereinafter.
• the Congestion Notification elements according to Figures 6 and 7 are transmitted in a single Congestion Control Notifi ⁇ cation frame to the precursor on the paths of data flows DF3,DF4, which is mesh node B.
• mesh node B After mesh node B has received the Congestion Control Notifi ⁇ cation frame with the two Congestion Notification elements according to Figure 6 and Figure 7, said mesh node B stores the relevant information of each congestion notification, including :
• the four congestion notification expiration timers for each access category.
• Mesh node B now receives a data frame of data flow DF3, that is, a data frame with mesh node F as mesh destination.
• Mesh node B checks the conditions for postponing the forwarding of the data frame:
• the first IF-condition is true, because the MAC address of the next hop of the data frame (according to the for- warding information for mesh node F, this is mesh node
• the second IF-condition is true, because the mesh desti- nation MAC address of the data frame, which is mesh node
• Mesh node B now receives a data frame of data flow DF4, that is, a data frame with mesh node G as mesh destination. Mesh node B checks the conditions for postponing the forwarding of the data frame:
• the first IF-condition is true, because the MAC address of the next hop of the data frame (according to the for ⁇ warding information for mesh node G, this is mesh node C) corresponds to the MAC address of the transmitter of a Congestion Notification element. Note that Table 1 shown above includes two entries for mesh node C.
• the second IF-condition is true, because the mesh desti ⁇ nation MAC address of the data frame, which is mesh node
• mesh node B Since both nested IF-conditions are true, the forwarding of the data frame for mesh destination G is postponed.
• Mesh node B now receives a data frame of data flow DF5, that is, a data frame with mesh node E as mesh destination.
• Mesh node B checks the conditions for postponing the forwarding of the data frame:
• the first IF-condition is false, because there is no en ⁇ try for the MAC address of the next hop of the data frame (according to the forwarding information for mesh node G, this is mesh node E) in column "next hop" of the stored congestion notifications.
• mesh node B becomes congested as well, because it does not forward data frames for destinations F and G that it receives. In the same way as mesh node C, it will con ⁇ struct two Congestion Notification elements which are sent by a single Congestion Control Notification frame to mesh node A.
• DF3 that is, a data frame with mesh node F as mesh destina ⁇ tion.
• Mesh node A checks the conditions for postponing the forwarding of the data frame:
• the first IF-condition is true, because the MAC address of the next hop of the data frame (according to the for ⁇ warding information for mesh node F, this is mesh node
• the second IF-condition is true, because the mesh desti ⁇ nation MAC address of the data frame (which is mesh node F) corresponds to a mesh destination entry of Table 2 for mesh node B as next hop.
• DF4 that is, a data frame with mesh node G as mesh destina ⁇ tion.
• Mesh node A checks the conditions for postponing the forwarding of the data frame:
• the first IF-condition is true, because the MAC address of the next hop of the data frame (according to the for ⁇ warding information for mesh node G, this is mesh node
• the second IF-condition is true, because the mesh desti ⁇ nation MAC address of the data frame (which is mesh node G) corresponds to a mesh destination entry of Table 2 for mesh node B as next hop.
• Mesh node A now wants to forward a data frame of data flow DF5, that is, a data frame with mesh node E as mesh destina ⁇ tion.
• Mesh node A checks the conditions for postponing the forwarding of the data frame:
• the first IF-condition is true, because the MAC address of the next hop of the data frame (according to the for ⁇ warding information for mesh node E, this is mesh node B) corresponds to the MAC address of the transmitter of a Congestion Notification element. Note that Table 2 shown above includes two entries for mesh node B.
• the second IF-condition is false, because there is no entry for the mesh destination MAC address of the data frame (which is mesh node E) in column »mesh destina- tion « of Table 2 with mesh node B as next hop.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Databases & Information Systems (AREA)
• Data Exchanges In Wide-Area Networks (AREA)
• Mobile Radio Communication Systems (AREA)
• Small-Scale Networks (AREA)

Priority Applications (7)

Applications Claiming Priority (2)

Related Child Applications (2)

Publications (1)

Family

ID=45422118

Family Applications (1)

Country Status (7)

Cited By (1)

Families Citing this family (19)

Citations (2)

Family Cites Families (35)

• 2011
  • 2011-12-06 KR KR1020137017545A patent/KR101598872B1/ko not_active Expired - Fee Related
  • 2011-12-06 EP EP11802676.4A patent/EP2633653A1/en not_active Withdrawn
  • 2011-12-06 WO PCT/EP2011/071950 patent/WO2012076540A1/en not_active Ceased
  • 2011-12-06 CN CN201180066978.2A patent/CN103370912B/zh not_active Expired - Fee Related
  • 2011-12-06 JP JP2013542511A patent/JP5865917B2/ja not_active Expired - Fee Related
  • 2011-12-06 US US13/991,479 patent/US20130279341A1/en not_active Abandoned
  • 2011-12-06 BR BR112013014225A patent/BR112013014225A2/pt not_active IP Right Cessation
• 2015
  • 2015-09-17 US US14/856,785 patent/US9872200B2/en not_active Expired - Fee Related

Patent Citations (2)

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events