US20130279341A1 - Congestion Notification Element and Method for Congestion Control - Google Patents

Congestion Notification Element and Method for Congestion Control Download PDF

Info

Publication number
US20130279341A1
US20130279341A1 US13/991,479 US201113991479A US2013279341A1 US 20130279341 A1 US20130279341 A1 US 20130279341A1 US 201113991479 A US201113991479 A US 201113991479A US 2013279341 A1 US2013279341 A1 US 2013279341A1
Authority
US
United States
Prior art keywords
congestion
address
mesh
destination
mesh node
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.)
Abandoned
Application number
US13/991,479
Other languages
English (en)
Inventor
Michael Bahr
Barbara Staehle
Dirk Staehle
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Assigned to JULIUS-MAXIMILIANS-UNIVERSITAET WUERZBURG reassignment JULIUS-MAXIMILIANS-UNIVERSITAET WUERZBURG ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: STAEHLE, BARBARA, STAEHLE, DIRK
Assigned to SIEMENS AKTIENGESELLSCHAFT reassignment SIEMENS AKTIENGESELLSCHAFT ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: JULIUS-MAXIMILIANS-UNIVERSITAET WUERZBURG
Assigned to SIEMENS AKTIENGESELLSCHAFT reassignment SIEMENS AKTIENGESELLSCHAFT ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: BAHR, MICHAEL
Publication of US20130279341A1 publication Critical patent/US20130279341A1/en
Abandoned legal-status Critical Current

Links

Images

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

  • This disclosure 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 enhanced 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 Physical Layer (PHY) specifications—Mesh Networking ⁇ , version D7.03, November 2010, hereinafter referred to as >>draft standard ⁇ .
  • 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 between 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 DF 1 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 dataflow DF 1 .
  • a second dataflow DF 2 illustrated by a dotted line, is ranging from the first mesh node A passing the second mesh node B to a fifth mesh node E, which is the destination node E of said second dataflow DF 2 .
  • a link between the third mesh node C and the fourth mesh node D is affected by a reduced transfer rate because of a bottleneck 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 notification 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.
  • data frames are still sent by the second mesh node B to a fifth mesh node E along the second dataflow DF 2 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. Subsequently, 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 DF 1 and the second data flow DF 2 .
  • the described scenario eventually leads to a situation, where the second data flow DF 2 between the first mesh node A and the fifth mesh node E is stopped although the initial bottleneck between the third mesh node C and the fourth mesh node D has no negative impact on the second data flow DF 2 .
  • One embodiment provides a congestion notification element for indicating a congestion status of a mesh node in a mesh network, the congestion notification element including at least one field specifying a mesh destination for which an intra-mesh congestion control is to be applied.
  • the mesh destination is determined by an address of a destination mesh node.
  • the mesh destination is determined by a broadcast address.
  • the congestion notification element includes a field specifying a number of fields each field of the number of fields specifying a respective mesh destination.
  • the congestion notification element includes at least one congestion notification, each congestion notification including one of the at least one field specifying the mesh destination, each congestion notification further including at least one field specifying a congestion notification expiration timer, the congestion notification element further including a field specifying a number of congestion notifications included in the congestion notification element.
  • Another embodiment provides a congestion control notification frame including at least one congestion notification element according to one of the aforementioned claims.
  • the congestion control notification frame includes fields according to known document IEEE P802.11s.
  • Another embodiment provides a method of controlling congestion in a mesh network, the method including the steps of: receiving at least one congestion control notification frame by a receiving mesh node, the at least one congestion control notification frame being sent by a transmitting mesh node, the at least one congestion control notification frame including at least one congestion notification element; reading at least one transmitter mesh node address of said at least one congestion control notification frame as next hop address; reading at least one destination mesh node address of said at least one congestion notification element, said destination mesh node address being an individual address or a broadcast address; and reading at least one congestion notification expiration timer of said at least one congestion notification element.
  • the method includes the steps of: receiving a data frame by said receiving mesh node, the data frame including a destination address of said data frame; reading the destination address of said data frame; and reading a next hop address for the destination address of said data frame from a forwarding information.
  • the method includes the steps of postponing a forwarding of said data frame by said receiving node for the case that said next hop address for said data frame is equal to at least one next hop address from said at least one congestion control notification frame; and said destination address of said data frame is equal to at least one destination mesh node address from said at least one next hop address of said at least one congestion notification element.
  • the method includes the steps of postponing a forwarding of said data frame by said receiving node for the case that said next hop address for said data frame is equal to at least one next hop address from said at least one congestion control notification frame; and at least one destination mesh node address from said at least one next hop address of said at least one congestion notification element is equal to said broadcast address.
  • said postponing of said forwarding of said data frame is done until a corresponding congestion notification expiration timer of a corresponding access category has expired.
  • Another embodiment provides a mesh node in a mesh network comprising means for carrying out any of the methods disclosed above.
  • Another embodiment provides a mesh node in a mesh network comprising means for processing and generating congestion notification elements and/or congestion control notification frames as disclosed above.
  • Another embodiment provides a mesh network comprising at least one such mesh node.
  • Another embodiment provides a computer program product, which contains a program code stored on a non-transitory computer-readable medium and which, when executed on a processor of a node in a mesh network, carries out any of the methods disclosed above.
  • Another embodiment provides a computer program product, which contains a program code stored on a non-transitory computer-readable medium and which, when executed on a processor of a node in a mesh network, processes and/or generates congestion notification elements and/or congestion control notification frames as disclosed above.
  • 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 notification element according to an example embodiment
  • 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 notification element with multiple destination addresses according to an example embodiment
  • FIG. 5 shows an exemplary structure of a congestion notification element with multiple congestion notifications according to an example embodiment
  • FIG. 6 shows exemplary contents of a congestion notification element according to a first application example
  • FIG. 7 shows exemplary contents of a congestion notification element according to a second application example.
  • Some embodiments provide a congestion notification element for indicating an enhanced congestion status by overcoming draw-backs of currently known indications of congestions which are based on a sole next hop indication.
  • Other embodiments provide an improved congestion control method, which substantially does not affect links to uncongested adjacent nodes.
  • an improved congestion notification element for indicating a congestion status of a mesh node in a mesh network
  • the congestion notification element including at least one field specifying a mesh destination for which an intra-mesh congestion control is to be applied.
  • 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.
  • One possible advantage of the proposed congestion notification 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.
  • Some embodiments may avoid negative performance impacts on flows which are not passing a congested bottleneck link.
  • the congestion control proposed herein may be directed to data flows passing the bottleneck link.
  • FIG. 2 shows an exemplary structure of a congestion notification element according to an example embodiment.
  • 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 notification 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 AC_BK ⁇ , a second Congestion Notification Expiration Timer field 208 captioned >>Congestion Notification Expiration Timer AC_BE ⁇ , a third Congestion Notification Expiration Timer field 210 captioned >>Congestion Notification Expiration Timer AC_VI ⁇ , and a fourth Congestion Notification Expiration Timer field 212 captioned >>Congestion Notification Expiration Timer AC_VO ⁇ .
  • the four Congestion Notification Expiration Timer fields 206 , 208 , 210 , 212 are dedicated to four respective access categories to indicate the estimated congestion duration per access 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:
  • the values in the Congestion Notification Expiration Timerfields 206 , 208 , 210 , 212 are encoded as unsigned integers in units of 100 ⁇ s.
  • a third field 204 is captioned >>Destination Mesh STA Address ⁇ and has a length of six octets.
  • this Congestion Notification element is extended by a third field 204 , captioned >>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.
  • FIG. 2 shows a possible format of a congestion control element amended according to an example embodiment.
  • 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 element.
  • the amended destination field 204 can alternatively 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 amended destination field 204 captioned >>Destination Mesh STA Address ⁇ preferably has a length of six octets.
  • 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—Congestion Control Notification frames.
  • the destination field 204 is represented as a 48-bit MAC address 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 address.
  • a mesh station receiving an amended Congestion Notification element according to an example embodiment is advantageously 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 example embodiment.
  • 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 FIG. 1 , this rule would also postpone the second dataflow DF 2 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 DF 2 .
  • 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.
  • an amended rule for postponing of data frame forwarding is described in pseudo code as follows:
  • the address of the next hop of the data frame is equal to the transmitter address of at least one received congestion control notification frame
  • the destination address of the data frame is equal to at least one destination mesh node address of at least one congestion 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 described as follows:
  • the address of the next hop of the data frame is equal to the transmitter address of at least one received congestion control 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
  • 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:
  • the next hop address of the data frame is not equal to at least one next hop address from at least one received congestion 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);
  • FIG. 3 shows a topology where more than one data flow is affected by a bottleneck BN. Further on, affected data flows in FIG. 3 have different destinations.
  • a third dataflow DF 3 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 DF 3 .
  • a fourth dataflow DF 4 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 DF 4 .
  • a fifth dataflow DF 5 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 DF 5 .
  • the third mesh node C has to send two Congestion Notification elements, one for each affected destination, when using the format of the Congestion Notification element as shown in FIG. 2 .
  • Congestion Notification elements in a single Congestion Control Notification frame, the type of management frame of IEEE 802.11 that is used to transmit Congestion Notification elements, see Draft Standard IEEE P802.11s entitled: >>Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications—Mesh Networking ⁇ , Version D7.03, November 2010, clause 7.4.15.6, entitled >>Congestion Control Notification frame format ⁇ .
  • MAC Medium Access Control
  • PHY Physical Layer
  • FIG. 4 shows an exemplary structure of a congestion notification element with multiple destination addresses according to an alternative embodiment.
  • the congestion notification element according to this embodiment uses a list of destinations in a single Congestion Notification element.
  • the congestion notification element according to FIG. 4 includes a first field 400 captioned >>Element ID ⁇ and having a length of one octet and a second field 402 captioned >>Length ⁇ and having a length of one octet.
  • a third field 404 captioned >>Number of Destinations N ⁇ defines 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 Address ⁇ 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 elements 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 FIG. 2 .
  • FIG. 5 shows an exemplary structure of a further amended congestion notification element according to a further embodiment.
  • the congestion notification element according to FIG. 5 includes a first field 500 captioned >>Element ID ⁇ and having a length of one octet and a second field 502 captioned >>Length ⁇ and having a length of one octet.
  • a third field 504 captioned >>Number of Congestion Notifications N ⁇ defines a number (N) of Congestion Notifications 506 , 508 , 510 contained in this Congestion Notification element.
  • 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 >>Congestion 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 Address # 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 FIG. 2 .
  • a representation of multiple congestion notifications is to transmit multiple Congestion Notification elements according to or similar to FIG. 2 in a single Congestion Control Notification frame. This is the simplest representation of congestion notifications due to the small size of the Congestion Notification element and its easy processing.
  • a wireless mesh network including some data flows as shown in FIG. 3 is considered. There are three data flows:
  • the link from mesh node C to mesh node D is the bottleneck BN on the paths for data flows DF 3 , DF 4 .
  • Mesh node C becomes congested since more data frames for destination 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 DF 3 ,DF 4 as the cause of the congestion can be derived by inspecting the respective data frames, wherein the transmitter address is set to mesh node B and the mesh destination address is set to mesh node F or mesh node G, respectively 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 as shown in FIG. 6 and FIG. 7 .
  • the structure of said Congestion Notification elements in FIG. 6 and FIG. 7 corresponds to the structure according to FIG. 2 .
  • the congestion notification element according to FIG. 6 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 AC_BK ⁇ , a second Congestion Notification Expiration Timer field 608 captioned >>Congestion Notification Expiration Timer AC_BE, a third Congestion Notification Expiration Timer field 610 captioned >>Congestion Notification Expiration Timer AC_VI ⁇ and a fourth Congestion Notification Expiration Timer field 612 captioned >>Congestion Notification Expiration Timer AC_VO ⁇ .
  • the first Congestion Notification Expiration Timer field 606 carries an exemplary value of t0
  • the second Congestion Notification Expiration Timer field 608 carries an exemplary value of t1
  • 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 FIG. 7 includes 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 AC_BK ⁇ , a second Congestion Notification Expiration Timer field 708 captioned >>Congestion Notification Expiration Timer AC_BE, a third Congestion Notification Expiration Timer field 710 captioned >>Congestion Notification Expiration Timer AC_VI ⁇ and a fourth Congestion Notification Expiration Timer field 712 captioned >>Congestion Notification Expiration Timer AC_VO ⁇ .
  • the first Congestion Notification Expiration Timer field 706 carries an exemplary value of t4
  • the second Congestion Notification 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 FIGS. 6 and 7 are transmitted in a single Congestion Control Notification frame to the precursor on the paths of data flows DF 3 ,DF 4 , which is mesh node B.
  • said mesh node B After mesh node B has received the Congestion Control Notification frame with the two Congestion Notification elements according to FIG. 6 and FIG. 7 , said mesh node B stores the relevant information of each congestion notification, including:
  • a mesh STA ( mesh station ) is a frequently used expression for a mesh node as used herein.
  • Mesh node B now receives a data frame of data flow DF 3 , 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:
  • Mesh node B now receives a data frame of data flow DF 4 , 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:
  • Mesh node B now receives a data frame of data flow DF 5 , 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:
  • mesh node B becomes congested as well, because it does not forward data frames for destinations F and G that it receives.
  • mesh node C it will construct two Congestion Notification elements which are sent by a single Congestion Control Notification frame to mesh node A.
  • Mesh node A now wants to forward a data frame of data flow DF 3 , that is, a data frame with mesh node F as mesh destination.
  • Mesh node A checks the conditions for postponing the forwarding of the data frame:
  • Mesh node A now wants to forward a data frame of data flow DF 4 , that is, a data frame with mesh node G as mesh destination.
  • Mesh node A checks the conditions for postponing the forwarding of the data frame:
  • Mesh node A now wants to forward a data frame of data flow DF 5 , that is, a data frame with mesh node E as mesh destination.
  • Mesh node A checks the conditions for postponing the forwarding of the data frame:

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)
US13/991,479 2010-12-07 2011-12-06 Congestion Notification Element and Method for Congestion Control Abandoned US20130279341A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
EP10194018.7 2010-12-07
EP10194018 2010-12-07
PCT/EP2011/071950 WO2012076540A1 (en) 2010-12-07 2011-12-06 Congestion notification element and method for congestion control

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2011/071950 A-371-Of-International WO2012076540A1 (en) 2010-12-07 2011-12-06 Congestion notification element and method for congestion control

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US14/856,785 Continuation US9872200B2 (en) 2010-12-07 2015-09-17 Congestion notification element and method for congestion control

Publications (1)

Publication Number Publication Date
US20130279341A1 true US20130279341A1 (en) 2013-10-24

Family

ID=45422118

Family Applications (2)

Application Number Title Priority Date Filing Date
US13/991,479 Abandoned US20130279341A1 (en) 2010-12-07 2011-12-06 Congestion Notification Element and Method for Congestion Control
US14/856,785 Expired - Fee Related US9872200B2 (en) 2010-12-07 2015-09-17 Congestion notification element and method for congestion control

Family Applications After (1)

Application Number Title Priority Date Filing Date
US14/856,785 Expired - Fee Related US9872200B2 (en) 2010-12-07 2015-09-17 Congestion notification element and method for congestion control

Country Status (7)

Country Link
US (2) US20130279341A1 (zh)
EP (1) EP2633653A1 (zh)
JP (1) JP5865917B2 (zh)
KR (1) KR101598872B1 (zh)
CN (1) CN103370912B (zh)
BR (1) BR112013014225A2 (zh)
WO (1) WO2012076540A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9872200B2 (en) 2010-12-07 2018-01-16 Siemens Aktiengesellschaft Congestion notification element and method for congestion control

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9634940B2 (en) * 2013-01-31 2017-04-25 Mellanox Technologies, Ltd. Adaptive routing using inter-switch notifications
US9548960B2 (en) 2013-10-06 2017-01-17 Mellanox Technologies Ltd. Simplified packet routing
US9729473B2 (en) 2014-06-23 2017-08-08 Mellanox Technologies, Ltd. Network high availability using temporary re-routing
US9806994B2 (en) 2014-06-24 2017-10-31 Mellanox Technologies, Ltd. Routing via multiple paths with efficient traffic distribution
US9699067B2 (en) 2014-07-22 2017-07-04 Mellanox Technologies, Ltd. Dragonfly plus: communication over bipartite node groups connected by a mesh network
US9894005B2 (en) 2015-03-31 2018-02-13 Mellanox Technologies, Ltd. Adaptive routing controlled by source node
US9973435B2 (en) 2015-12-16 2018-05-15 Mellanox Technologies Tlv Ltd. Loopback-free adaptive routing
US10819621B2 (en) 2016-02-23 2020-10-27 Mellanox Technologies Tlv Ltd. Unicast forwarding of adaptive-routing notifications
US10178029B2 (en) 2016-05-11 2019-01-08 Mellanox Technologies Tlv Ltd. Forwarding of adaptive routing notifications
US10200294B2 (en) 2016-12-22 2019-02-05 Mellanox Technologies Tlv Ltd. Adaptive routing based on flow-control credits
US10644995B2 (en) 2018-02-14 2020-05-05 Mellanox Technologies Tlv Ltd. Adaptive routing in a box
US11005724B1 (en) 2019-01-06 2021-05-11 Mellanox Technologies, Ltd. Network topology having minimal number of long connections among groups of network elements
US11575594B2 (en) 2020-09-10 2023-02-07 Mellanox Technologies, Ltd. Deadlock-free rerouting for resolving local link failures using detour paths
US11411911B2 (en) 2020-10-26 2022-08-09 Mellanox Technologies, Ltd. Routing across multiple subnetworks using address mapping
US11870682B2 (en) 2021-06-22 2024-01-09 Mellanox Technologies, Ltd. Deadlock-free local rerouting for handling multiple local link failures in hierarchical network topologies
US11765103B2 (en) 2021-12-01 2023-09-19 Mellanox Technologies, Ltd. Large-scale network with high port utilization

Citations (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6356962B1 (en) * 1998-09-30 2002-03-12 Stmicroelectronics, Inc. Network device and method of controlling flow of data arranged in frames in a data-based network
US6563831B1 (en) * 1997-08-22 2003-05-13 Avici Systems Router with virtual channel allocation
US20040008628A1 (en) * 2002-07-09 2004-01-15 Sujata Banerjee System, method and computer readable medium for flow control of data traffic
US6826620B1 (en) * 1998-08-26 2004-11-30 Paradyne Corporation Network congestion control system and method
US6865185B1 (en) * 2000-02-25 2005-03-08 Cisco Technology, Inc. Method and system for queuing traffic in a wireless communications network
US7151773B1 (en) * 2000-05-05 2006-12-19 Fujitsu Limited System and method for connectionless/connection oriented signal transport
US20070127378A1 (en) * 2005-12-02 2007-06-07 Yang Liuyang L Methods and apparatus for providing a flow control system for traffic flow in a wireless mesh network based on traffic prioritization
US20070183332A1 (en) * 2006-02-06 2007-08-09 Jong-Sang Oh System and method for backward congestion notification in network
US20070268830A1 (en) * 2006-05-19 2007-11-22 Cisco Technology, Inc. Flow based flow control in an ethernet switch backplane
US20090052326A1 (en) * 2007-08-21 2009-02-26 Cisco Technology, Inc., A Corporation Of California Backward congestion notification
US20090196194A1 (en) * 2006-09-13 2009-08-06 Harri Paloheimo Energy aware early detection
US20100195495A1 (en) * 2009-02-05 2010-08-05 Silver Spring Networks System and method of monitoring packets in flight for optimizing packet traffic in a network
US20120182860A1 (en) * 2009-10-06 2012-07-19 Hang Liu Method and apparatus for hop-by-hop reliable multicast in wireless networks
US20120236726A1 (en) * 2011-03-20 2012-09-20 Basem Shihada Buffer Sizing for Multi-Hop Networks
US20130010798A1 (en) * 2011-07-05 2013-01-10 Cisco Technology, Inc. Transmission priority paths in mesh networks
US20130088969A1 (en) * 2011-10-06 2013-04-11 International Business Machines Corporation Network traffic distribution
US20130208671A1 (en) * 2012-02-03 2013-08-15 Telefonaktiebolaget L M Ericsson (Publ) Apparatus, systems, methods, and computer products suitable for use in an advanced digital baseband processor
US20140169173A1 (en) * 2012-12-14 2014-06-19 Ygdal Naouri Network congestion management by packet circulation
US20140219090A1 (en) * 2013-02-04 2014-08-07 Telefonaktiebolaget L M Ericsson (Publ) Network congestion remediation utilizing loop free alternate load sharing
US8811153B1 (en) * 2010-05-03 2014-08-19 Pluribus Networks Inc. Switch fabric for network devices

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7016971B1 (en) * 1999-05-24 2006-03-21 Hewlett-Packard Company Congestion management in a distributed computer system multiplying current variable injection rate with a constant to set new variable injection rate at source node
US7180857B2 (en) * 2000-11-24 2007-02-20 Matsushita Electric Industrial Co., Ltd Apparatus and method for flow control
JP3851857B2 (ja) * 2001-09-28 2006-11-29 株式会社東芝 無線通信システムおよび無線通信端末
US7408929B2 (en) * 2001-09-28 2008-08-05 Kabushiki Kaisha Toshiba Radio communication system, terminal and packet
JP3970138B2 (ja) * 2002-09-09 2007-09-05 富士通株式会社 イーサネットスイッチにおける輻輳制御装置
US7830801B2 (en) * 2004-10-29 2010-11-09 Broadcom Corporation Intelligent fabric congestion detection apparatus and method
EP1936880A1 (en) * 2006-12-18 2008-06-25 British Telecommunications Public Limited Company Method and system for congestion marking
TWI459754B (zh) * 2007-01-12 2014-11-01 Koninkl Philips Electronics Nv 無線網狀網路中擁擠管理之方法
US8520517B2 (en) 2007-02-21 2013-08-27 Broadcom Corporation Switch fabric end-to-end congestion avoidance mechanism
US7916718B2 (en) * 2007-04-19 2011-03-29 Fulcrum Microsystems, Inc. Flow and congestion control in switch architectures for multi-hop, memory efficient fabrics
US7843817B2 (en) * 2008-03-11 2010-11-30 Cisco Technology, Inc. Congestion control in wireless mesh networks
US8111649B1 (en) 2008-03-31 2012-02-07 Google Inc. Method and apparatus for enabling a host to influence how a packet is routed through a network
US8248930B2 (en) * 2008-04-29 2012-08-21 Google Inc. Method and apparatus for a network queuing engine and congestion management gateway
US8189479B1 (en) * 2008-05-30 2012-05-29 Dust Networks, Inc. Congestion control for wireless sensor networks
US8045463B2 (en) * 2008-07-30 2011-10-25 Microsoft Corporation Path estimation in a wireless mesh network
JP5372615B2 (ja) * 2009-06-22 2013-12-18 株式会社日立製作所 パケット転送システム、網管理装置、及び、エッジノード
EP2633653A1 (en) 2010-12-07 2013-09-04 Siemens Aktiengesellschaft Congestion notification element and method for congestion control

Patent Citations (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6563831B1 (en) * 1997-08-22 2003-05-13 Avici Systems Router with virtual channel allocation
US6826620B1 (en) * 1998-08-26 2004-11-30 Paradyne Corporation Network congestion control system and method
US6356962B1 (en) * 1998-09-30 2002-03-12 Stmicroelectronics, Inc. Network device and method of controlling flow of data arranged in frames in a data-based network
US6865185B1 (en) * 2000-02-25 2005-03-08 Cisco Technology, Inc. Method and system for queuing traffic in a wireless communications network
US7151773B1 (en) * 2000-05-05 2006-12-19 Fujitsu Limited System and method for connectionless/connection oriented signal transport
US20040008628A1 (en) * 2002-07-09 2004-01-15 Sujata Banerjee System, method and computer readable medium for flow control of data traffic
US20070127378A1 (en) * 2005-12-02 2007-06-07 Yang Liuyang L Methods and apparatus for providing a flow control system for traffic flow in a wireless mesh network based on traffic prioritization
US20070183332A1 (en) * 2006-02-06 2007-08-09 Jong-Sang Oh System and method for backward congestion notification in network
US20070268830A1 (en) * 2006-05-19 2007-11-22 Cisco Technology, Inc. Flow based flow control in an ethernet switch backplane
US20090196194A1 (en) * 2006-09-13 2009-08-06 Harri Paloheimo Energy aware early detection
US20090052326A1 (en) * 2007-08-21 2009-02-26 Cisco Technology, Inc., A Corporation Of California Backward congestion notification
US20100195495A1 (en) * 2009-02-05 2010-08-05 Silver Spring Networks System and method of monitoring packets in flight for optimizing packet traffic in a network
US20120182860A1 (en) * 2009-10-06 2012-07-19 Hang Liu Method and apparatus for hop-by-hop reliable multicast in wireless networks
US8811153B1 (en) * 2010-05-03 2014-08-19 Pluribus Networks Inc. Switch fabric for network devices
US20120236726A1 (en) * 2011-03-20 2012-09-20 Basem Shihada Buffer Sizing for Multi-Hop Networks
US20130010798A1 (en) * 2011-07-05 2013-01-10 Cisco Technology, Inc. Transmission priority paths in mesh networks
US20130088969A1 (en) * 2011-10-06 2013-04-11 International Business Machines Corporation Network traffic distribution
US20130208671A1 (en) * 2012-02-03 2013-08-15 Telefonaktiebolaget L M Ericsson (Publ) Apparatus, systems, methods, and computer products suitable for use in an advanced digital baseband processor
US20140169173A1 (en) * 2012-12-14 2014-06-19 Ygdal Naouri Network congestion management by packet circulation
US20140219090A1 (en) * 2013-02-04 2014-08-07 Telefonaktiebolaget L M Ericsson (Publ) Network congestion remediation utilizing loop free alternate load sharing

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9872200B2 (en) 2010-12-07 2018-01-16 Siemens Aktiengesellschaft Congestion notification element and method for congestion control

Also Published As

Publication number Publication date
WO2012076540A1 (en) 2012-06-14
CN103370912B (zh) 2017-04-19
KR101598872B1 (ko) 2016-03-14
JP5865917B2 (ja) 2016-02-17
BR112013014225A2 (pt) 2016-09-13
KR20130126655A (ko) 2013-11-20
US9872200B2 (en) 2018-01-16
CN103370912A (zh) 2013-10-23
EP2633653A1 (en) 2013-09-04
JP2014500682A (ja) 2014-01-09
US20160014636A1 (en) 2016-01-14

Similar Documents

Publication Publication Date Title
US9872200B2 (en) Congestion notification element and method for congestion control
US7633865B2 (en) Network operations control in packet data networks
US7539133B2 (en) Method and apparatus for preventing congestion in load-balancing networks
US7948891B2 (en) Wireless communication apparatus, communication routing control apparatus, communication routing control method and communication system
US8331396B2 (en) Method of congestion management in a wireless mesh network
CN108243117B (zh) 一种流量监控方法、装置及电子设备
WO2020156104A1 (zh) 一种流量控制方法和装置
EP3264725B1 (en) Stream reservation class converter
WO2022111724A1 (zh) 网络拥塞检测方法及装置
US7391777B2 (en) Distance-sensitive scheduling of TDM-over-packet traffic in VPLS
CN110191053B (zh) 一种基于认知学习的无线自组网络多径路由方法
KR101458245B1 (ko) 무선 메쉬 네트워크에서 데이터 전송의 혼잡 상황을 통지/회피하는 방법 및 이를 위한 메쉬 노드
US9001833B2 (en) Relay apparatus, reception apparatus, and communication system
US20160330649A1 (en) Method of fragmenting a message in a network
US9042260B2 (en) Multi-hop wireless networks
Korbi et al. Performance evaluation of the Earliest Deadline First policy over ad hoc networks
JP2008103899A (ja) 無線通信システム、無線通信装置、無線通信方法およびプログラム
JP2024006523A (ja) 中継装置、車載ネットワークシステム、重みパラメータ算出方法及び重みパラメータ算出プログラム
KR100608649B1 (ko) 무선 랜을 이용한 멀티미디어 방송 환경에서 컨트롤데이터 보호 방법
Badarla et al. On delay performance of throughput optimal backpressure routing: Testbed results
JP2009206881A (ja) ネットワークシステム、端末装置、中継装置、帯域制御方法、及び中継装置の帯域制御方法
Liu et al. Throughput analysis of the IEEE 802.11 DCF under both saturated and non-saturated conditions
Huang et al. Packet transfer delay analysis of the N nodes RPT rings in the cut-through architecture

Legal Events

Date Code Title Description
AS Assignment

Owner name: SIEMENS AKTIENGESELLSCHAFT, GERMANY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:JULIUS-MAXIMILIANS-UNIVERSITAET WUERZBURG;REEL/FRAME:030840/0868

Effective date: 20130617

Owner name: JULIUS-MAXIMILIANS-UNIVERSITAET WUERZBURG, GERMANY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:STAEHLE, BARBARA;STAEHLE, DIRK;REEL/FRAME:030840/0522

Effective date: 20130609

Owner name: SIEMENS AKTIENGESELLSCHAFT, GERMANY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BAHR, MICHAEL;REEL/FRAME:030840/0926

Effective date: 20130603

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO PAY ISSUE FEE