WO2007076661A1 - Procede de gestion d'encombrement et dispositif de reseau pour service de multidiffusion en temps reel - Google Patents

Procede de gestion d'encombrement et dispositif de reseau pour service de multidiffusion en temps reel Download PDF

Info

Publication number
WO2007076661A1
WO2007076661A1 PCT/CN2006/002065 CN2006002065W WO2007076661A1 WO 2007076661 A1 WO2007076661 A1 WO 2007076661A1 CN 2006002065 W CN2006002065 W CN 2006002065W WO 2007076661 A1 WO2007076661 A1 WO 2007076661A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
multicast
congestion
module
forwarding
Prior art date
Application number
PCT/CN2006/002065
Other languages
English (en)
Chinese (zh)
Inventor
Hui Liu
Hongke Zhang
Hui Zhang
Daofei Zhu
Jianfeng Guan
Original Assignee
Huawei Technologies Co., Ltd.
Beijing Jiaotong University
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 Huawei Technologies Co., Ltd., Beijing Jiaotong University filed Critical Huawei Technologies Co., Ltd.
Publication of WO2007076661A1 publication Critical patent/WO2007076661A1/fr

Links

Classifications

    • 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
    • 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
    • H04L47/127—Avoiding congestion; Recovering from congestion by using congestion prediction
    • 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/15—Flow control; Congestion control in relation to multipoint traffic
    • 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/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416—Real-time traffic
    • 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/10—Flow control between communication endpoints
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/30—Resource management for broadcast services

Definitions

  • the present invention relates to the field of communications, and in particular, to congestion control and network equipment for multicast services. Background of the invention
  • MANET Mobile Ad hoc Network
  • B3G Beyond 3G
  • MANET has high link error rate, limited bandwidth, limited energy, multi-hop, and highly dynamic changes in the topology. Therefore, communication nodes in MANET are prone to congestion.
  • the appearance of congestion indicates that the bandwidth resources of the congested node have been Exhausted, no longer able to withstand more load, nor a fair resource allocation for each active route. Therefore, the emergence of congestion will increase the delay of data packets and even the loss of data packets. If the network resources are always in a congested state, it may cause the final collapse of the network, which will inevitably have a greater impact on the performance of the MANET network. Therefore, the corresponding congestion control strategy must be adopted.
  • congestion control algorithm uses TCP (Transmission Control Protocol) congestion control algorithm and queue scheduling algorithm.
  • the congestion control algorithm is divided into two different mechanisms: congestion avoidance and congestion control.
  • Congestion avoidance is a "prevention" mechanism. Its goal is to prevent the network from entering a congested state and to operate the network in a high-throughput, low-latency state.
  • Congestion control is a "recovery” mechanism that restores a congested node to a normal state.
  • the queue scheduling algorithm performs policy scheduling on the data packets in the sending queue in the case of congestion, including policies such as discarding and prioritizing forwarding.
  • the traditional congestion control strategy can solve the network congestion to a certain extent and improve the performance of network transmission.
  • UDP User Datagram Protocol
  • UDP User Datagram Protocol
  • the traditional congestion control strategy is difficult to meet the real-time multicast service sensitive to delay and packet loss rate.
  • the prior art related to the present invention is a congestion control scheme applicable to the multi-rate multicast service of the MANET, and the core thereof is: in the MANET, multiple multicast layers are used to forward multicast data, and in the multicast forwarding structure A strategy for implementing congestion control at the congestion bottleneck.
  • congestion control uses the traffic information of the packets flowing through the node to compare with a predetermined threshold to prevent or release high-level data of some multicast services, rather than joining and exiting layers.
  • it adjusts the bandwidth occupied by multicast traffic and TCP traffic at the multicast bottleneck to achieve fairness.
  • a rate control factor is introduced during the interruption and recovery of the multicast session to achieve a smooth transition of the rate.
  • the prior art adopts a layered multicast technology in MANET, which increases the complexity of the congestion algorithm and increases the resource consumption of the node.
  • the prior art 2 related to the present invention is a method for congestion control of a multicast service in a MANET network.
  • the core is: Keep a list of record receiver IPs at the multicast source node to record the nodes that are congested (that is, the nodes that reply NACK to the multicast source).
  • the list is not empty, the multicast source node enters a congestion control state, and the multicast source node performs a control policy until the list is empty.
  • the scheme is post-reaction congestion control, that is, the multicast source node determines whether congestion occurs according to the unreceived condition in the ACK acknowledgement message, and once it is confirmed to be congested, the packet has been delayed and lost at this time, Real-time multicast services have a large impact.
  • the object of the present invention is to provide a method and a network device for performing congestion control on a real-time multicast service, and the present invention can ensure real-time multicast of different levels (high level and low level).
  • the service can obtain high-quality services; and realizes a smooth transition of active multicast routing, minimizes delay and packet loss rate, and makes congestion control have better robustness.
  • the present invention can implement network Load balancing and resource optimization improve the performance of the MANET network.
  • the present invention does not use a complicated congestion algorithm, reduces overhead, and avoids the consumption of valuable resources of the MANET network.
  • the present invention provides a method for congestion control of a real-time multicast service, which includes -
  • Each multicast forwarding node predicts congestion of its own node
  • the multicast forwarding node confirms that it is about to be congested, it establishes a new multicast forwarding structure that does not pass its own node according to the priority of all active multicast routes through its own node, and the upstream node according to the new
  • the multicast forwarding structure forwards multicast services to perform congestion control on real-time multicast services.
  • the step A specifically includes:
  • each multicast forwarding node performs congestion prediction by detecting the resource utilization of its own node; and/or,
  • Each multicast forwarding node performs congestion prediction by detecting the energy of its own node.
  • the step A1 specifically includes:
  • Each multicast forwarding node detects whether the bandwidth utilization of the own node reaches a congestion threshold, and if so, confirms that the node is about to be congested; otherwise, confirms that the node is in a normal working state.
  • the step A2 specifically includes:
  • Each multicast forwarding node detects whether the energy of the own node falls to a security threshold, and if so, confirms that the node is about to be congested; otherwise, the node is confirmed to be in a normal working state.
  • the step B specifically includes:
  • the multicast forwarding node when the multicast forwarding node confirms that it is about to be congested, selects the active multicast route with the lowest priority from all active multicast routes through its own node, and routes the downstream node to the selected active multicast group.
  • Send a congestion message After receiving the congestion packet, the downstream node sends a multicast group join request to the neighbor node according to the multicast group ID information carried in the congestion packet, and receives the response of the neighbor node. After the message, it is confirmed that it has successfully grafted to the forwarding structure of the multicast group, and then sends the information that the route dynamic adjustment succeeds to the congestion node;
  • the fast-moving node sends the multicast group route invalidation message to its upstream node
  • the upstream node determines the multicast group routing information of the newly established multicast forwarding structure according to the received multicast group routing invalidation message, and uses the routing information to forward the corresponding multicast service.
  • the step B2 further includes: after receiving the multicast group join request message, the neighboring node determines whether it meets the condition of joining the multicast group, and if yes, sends a response message to the downstream node; otherwise, discards The multicast group joins the request message.
  • the conditions for joining the multicast group include:
  • the multicast forwarding node After the multicast forwarding node establishes a multicast route, it will not cause congestion to occur, and the route to the upstream node of the node to be congested will not pass through the node that is congested, nor will it pass through the node that is about to be congested.
  • the step B further includes:
  • the near-congested node determines whether it is the forwarding node of the multicast routing request message, and if so, discards; otherwise, receives the discovery message. And join the multicast group.
  • the method further includes:
  • the step CI specifically includes:
  • each node requests the authentication of the CA of the certification center before joining the mobile ad hoc network MANET;
  • the CA allocates a corresponding priority according to the importance of the node in the MANET.
  • the step C2 specifically includes:
  • the node C2 initiates a multicast routing request as a multicast source, and embeds its own priority into the multicast routing request discovery process, and establishes a corresponding multicast forwarding structure according to the multicast routing request discovery process;
  • the intermediate forwarding node in the multicast forwarding structure records the priority of the multicast source into its multicast routing information.
  • the present invention further provides a network device, where the network device is a multicast forwarding node, and the network device is provided with a storage module, a congestion prediction module, and a multicast forwarding structure module;
  • the storage module is configured to store the priority of all active multicast routes through the node where the node is located;
  • the congestion prediction module is configured to predict the congestion of the node, and notify the multicast forwarding structure module when it is confirmed that the node is about to be congested. ;
  • the multicast forwarding structure module is configured to: after receiving the notification, establish a new multicast forwarding structure that does not go through the node where the node is located according to the priority stored in the storage module, so that the upstream node performs group according to the new multicast forwarding structure. Broadcast service forwarding to perform congestion control on real-time multicast services.
  • the multicast forwarding structure module includes:
  • the initiating sub-module is configured to: after receiving the notification, select an active multicast route with the lowest priority from all active multicast routes passing through the node, and send a congestion report to the downstream node of the selected active multicast group route Text
  • the grafting sub-module is configured to: after receiving the congestion message transmitted by the other node, send a multicast group join request to the neighboring node according to the multicast group ID information carried in the congestion packet, and receive the packet After the response message to the neighboring node is confirmed, the user is successfully grafted to the forwarding structure of the multicast group, and the node that sends the congestion packet is replied to the information that the route dynamic adjustment succeeds;
  • the invalidation sub-module is configured to send a multicast group route invalidation message to the upstream node of the node where the node is located, so that the upstream node determines the multicast group route of the newly established multicast forwarding structure according to the received multicast group route invalidation message.
  • Information and use the routing information to forward the corresponding multicast service.
  • the multicast forwarding structure module is further configured with a multicast join determination sub-module and a response sub-module.
  • the multicast join determination sub-module is configured to determine whether the node is in compliance after receiving the multicast group join request message received by the node. The conditions for joining the multicast group and notifying the response submodule;
  • the response sub-module is configured to: when receiving the notification of the compliance, send a response message to the node that sends the request message to the multicast group, and discard the multicast group join request message when receiving the notification of the non-conformity.
  • the network device is further provided with a routing request judging module and an adding module;
  • the routing request judging module is configured to: when a new routing request discovery message arrives in the congestion control process of the node, determine whether the node is the forwarding node of the multicast routing request message, and notify the joining module;
  • the module is added to notify the forwarding node according to the routing request judgment module, discards the route request discovery message, and joins the multicast group according to the notification sent by the routing request judgment module that is not the forwarding node.
  • each multicast forwarding node first predicts congestion of its own node; when it confirms that congestion is about to occur, it is based on all active multicasts passing through the node.
  • the level of routing controls congestion for real-time multicast services.
  • the present invention can ensure that high-quality services can be obtained for real-time multicast services of different levels (higher level and lower level); and the adjustment of the active multicast routing of the present invention is performed under the premise of impending congestion.
  • the present invention does not employ a complicated congestion algorithm, which reduces overhead and avoids MANET. The consumption of valuable resources of the network.
  • Figure 1 is a flow chart of a first embodiment of the present invention
  • FIG. 2 is a schematic diagram of a GPCCA congestion control process in a first embodiment of the present invention
  • FIG. 3 is a schematic diagram of GPCCA congestion control results in a first embodiment provided by the present invention.
  • the present invention provides a method for performing congestion control on a real-time multicast service, the core of which is: each multicast forwarding node predicts congestion of its own node; when the multicast forwarding node confirms that congestion is about to occur, according to the The level of all active multicast routes of the node controls the congestion of the real-time multicast service.
  • the present invention solves the congestion problem of real-time multicast services in MANET through GPCCA (Group Priority based Congestion Control Architecture).
  • the priority of multicast is determined by the importance of the multicast source.
  • GPCCA uses it to implement congestion control in the multicast protocol. This method is compatible with existing congestion control methods.
  • each multicast forwarding node performs congestion prediction by detecting the resource utilization of the own node; when the multicast forwarding node confirms that congestion is about to occur, according to the The level of all active multicast routes of the node controls the congestion of the real-time multicast service.
  • the specific implementation process is shown in Figure 1, including:
  • Step 101 Determine a priority of the multicast group active route according to a priority of the multicast source node in the multicast group.
  • Each node joining the MANET network must first pass the security verification of the CA (Certificate Authority). After the security verification succeeds, the CA assigns a corresponding priority according to the importance of the nodes joining the network in the MANET. The higher the importance of the node, the higher the corresponding priority, and the network at the node. The priority of this node remains unchanged during the lifetime.
  • CA Certificate Authority
  • the node When a node in the network wants to send multicast data, but there is no multicast route at this time, The node initiates a multicast routing request as a multicast source, and embeds its own priority in the process of multicast routing request discovery (Route Request), and establishes a corresponding multicast forwarding structure through the multicast routing request discovery process. . After the multicast forwarding structure is established, the intermediate forwarding node of the multicast forwarding structure records the priority of the multicast source into its multicast routing information, and the real-time multicast data begins to establish a good multicast forwarding structure. Forwarded on.
  • Route Request multicast routing request discovery
  • Step 102 Each multicast forwarding node detects whether the bandwidth utilization of the own node reaches a congestion threshold. If yes, step 103 is performed. In step 103, it is confirmed that the multicast forwarding node is about to be congested, and then step 104 is performed; otherwise, Step 105 is performed to confirm that the node is in a normal working state, and then proceed to step 102.
  • Each multicast forwarding node in the present invention monitors the resource utilization of its own nodes for congestion prediction.
  • the multicast forwarding node may confirm that the multicast forwarding node is about to become congested by detecting whether the bandwidth utilization of the own node exceeds a congestion threshold.
  • the above two detection methods can also be used simultaneously to confirm that the multicast forwarding node is about to be congested.
  • Step 104 The node that is congested performs congestion control on the real-time multicast service according to the priority of all active multicast routes.
  • the node that is about to be congested is predicted to discover the newly received route request message, and first determines whether it is the receiver of the route request discovery message, if it is not the multicast that is the route request discovery message.
  • the receiver discards the processing, that is, guarantees that no new services are added, and congestion control is performed on the congested nodes.
  • the message is received if it is determined to be the recipient of the route request discovery message.
  • the specific congestion control process is as follows:
  • Step 11 The camping node selects an active multicast route with the lowest priority from all the active multicast routes passing through the congestion node, and sends a congestion packet to the downstream node of the selected active multicast group route.
  • the dynamic multicast route is adjusted, and a congestion message is sent to the downstream node of the selected active multicast group route.
  • Step 12 The downstream node sends a multicast group join request message to its neighbor node according to the multicast group ID information carried in the congestion packet.
  • Step 13 After receiving the multicast group join request message, the neighboring node determines whether it meets the conditions for joining the multicast group, that is, after determining that the multicast route is established, the neighboring node does not cause itself to be congested, and The route of the upstream node of the congested node does not pass through the node to be congested, and does not pass through the congested node. If yes, the response message is sent back to the downstream node; otherwise, the multicast group join request message is discarded.
  • Step 14 After receiving the response message of the neighboring node, the downstream node confirms that it has been grafted to the forwarding structure of the multicast, and then sends information about successful routing dynamic adjustment to the node to be congested.
  • Step 15 The initiating congestion node sends the multicast group route invalidation message to the upstream node of the adjusted active multicast route.
  • the multicast group route invalidation packet includes the group address to be adjusted and the upcoming congestion node. The downstream node address.
  • Step 16 After receiving the multicast group route invalidation message, the upstream node forwards the corresponding multicast service according to the multicast group routing information in the newly established multicast structure, that is, the upstream of the congestion node
  • the node extracts the address of the downstream node of the congestion node from the multicast group route invalidation message, and then joins the downstream node of the congestion node to the multicast group, and avoids The node is about to be congested.
  • the multicast group route invalidation message at this time can be regarded as the multicast join request message of the downstream node of the congested node. Therefore, the multicast forwarding structure of the downstream node of the congested node can be re-joined into the multicast group.
  • the congestion node first selects the active multicast route with the lowest priority from its own multicast routing table as the adjustment object, and then approaches the congestion node to the downstream of the multicast route.
  • the node sends congestion packets, and the downstream nodes are based on multicast.
  • the group ID information is sent to the neighboring node to send a multicast join request message. After the downstream node receives the multicast join response message returned by the neighboring node, the downstream node is successfully grafted into the multicast group forwarding structure.
  • the downstream node actively joins the multicast group as a new multicast receiver, and the route from the downstream node to the multicast source avoids the upcoming congestion node, and the multicast on the new multicast forwarding structure.
  • the forwarding node cannot be congested.
  • the downstream node sends a route dynamic adjustment success to the to-be-congested node, and the congestion node needs to send the multicast group route invalidation packet to the upstream node corresponding to the multicast route, and it is noted that
  • the link between the upstream node and the to-be-congested node also maintains connectivity, so the connectivity of the link is not changed due to dynamic adjustment of active multicast routing in the congestion control process.
  • the upstream node After the upstream node receives the multicast group route invalidation message, the upstream node will not send the multicast group data to the upcoming congestion node, but forward the corresponding multicast data through the newly established multicast route. It can be seen that during the dynamic adjustment of the multicast routing, the multicast data is forwarded by the congested node. Only after the new multicast routing is established, the multicast data is forwarded through the new multicast routing, thus ensuring the active group. A smooth transition of the broadcast route. Since the early congestion prediction mechanism is adopted, the impact on real-time multicast services is very small.
  • the specific implementation process of the first embodiment provided by the present invention will be described below by taking the network topology shown in FIG. 2 as an example.
  • the multicast forwarding node B predicts that its bandwidth utilization exceeds the congestion threshold, it immediately starts the congestion control policy and performs congestion control on its own multicast service.
  • the control process is as follows: :
  • Step 21 That is, the congested Node B only receives the new multicast routing request as the multicast member, and the other multicast routing request message is automatically discarded, so that no new load is added; Step 22, the congested Node B is about to be added.
  • the active multicast route with the lowest priority is found in the multicast routing table, and then the congestion packet is sent to the downstream node E corresponding to the route.
  • the active multicast routing with small bandwidth is adjusted to adjust the impact of the active routing adjustment on the network performance to a minimum.
  • Step 23 After receiving the congestion packet, the downstream node E sends a multicast join to all its neighbor nodes. a request message, the request message includes the multicast group ID, and the IP of the neighboring node to be avoided; Step 24, each neighbor node, such as the node F, after receiving the multicast join request message, determines whether the join condition is met, That is, after establishing a multicast route with itself, it will not cause congestion, and the route to the multicast source S will not pass through the node to be congested, nor will it pass through the congestion node. When it is confirmed that the above conditions are met, the node F is The multicast routing request message is answered.
  • Step 25 After receiving the multicast routing response message of the node F, the downstream node E can receive the multicast data through the node F, and then the downstream node E sends the multicast graft success message to the node F. At the same time, the multicast node adjustment success packet is sent to the node B, and the downstream node E can receive the multicast group data through the node F. The downstream node E discards the same multicast routing response message received later, and only establishes a route with the sender of the first received multicast response message. .
  • the adjusted multicast group forwarding structure avoids the congestion of the node B and receives the multicast data sent by the multicast source S from the non-congested nodes C and F.
  • Step 26 After receiving the adjustment success message sent by the downstream node E, the congestion node B sends the multicast route invalidation message to the upstream node, that is, the multicast source S node, and the multicast source S to the node B, and The multicast route between Node B and Node E is invalid.
  • the multicast source S forwards the corresponding multicast data through the newly established multicast routing structure as shown in FIG.
  • the congestion control process ends. If it is detected that it is still in a state of congestion, the same strategy is used to continue the adjustment, that is, the above 22 to 27 process is repeated until it returns to normal.
  • each multicast forwarding node performs congestion prediction by detecting the energy of the own node.
  • the specific prediction process includes:
  • Step 201 Each multicast forwarding node detects whether the energy of the own node falls to a security threshold, and if yes, confirms that the node is about to be congested; otherwise, confirms that the node is in a normal working state.
  • a node detects that its own energy is lower than the security threshold it will adjust all its active multicast routes (except that the node acts as a multicast source or multicast receiver). The adjustment process is the same as in the first embodiment. The related description is the same, and will not be described in detail here.
  • the present invention also provides a network device that is a multicast forwarding node in a multicast network.
  • the network device of the present invention is provided with a storage module, a congestion prediction module, a multicast forwarding structure module, a route request judging module, and an adding module.
  • the storage module is primarily used to store the priority of all active multicast routes through the node it is on.
  • Each node in the present invention is set with a priority, and the priority of the node may be allocated according to the importance of each node joined to the mobile ad hoc network MANET.
  • the priority of the node can be assigned by the certificate authority CA. For example, each node requests the authentication of the certificate authority CA before joining the mobile ad hoc network MANET. After the security authentication succeeds, the CA assigns the corresponding node according to its importance in the MANET. Priority.
  • the priority of the multicast group active route in the present invention is determined according to the priority of the multicast source node in the multicast group, for example, the node initiates a multicast routing request as a multicast source, and embeds its own priority into the group.
  • the node establishes a corresponding multicast forwarding structure according to the multicast routing request discovery process, and the intermediate multicast forwarding node in the multicast forwarding structure records the priority of the multicast source into its multicast routing information. . Specifically, it is described in the above method.
  • the congestion prediction module is mainly used to predict the congestion of the node where it is located, and notify the multicast forwarding structure module when it is confirmed that the node where it is located is about to be congested.
  • the congestion prediction module can perform congestion prediction by detecting the resource utilization of the node where it is located.
  • the congestion prediction module can also perform congestion prediction by detecting the energy of the node where it is located, and can also perform resource consumption and energy by detecting the resource utilization of the node. Congestion prediction. Specifically, it is described in the above method.
  • the multicast forwarding structure module is mainly configured to: after receiving the notification of the congestion prediction module, establish a new multicast forwarding structure that does not go through the node where the node is located according to the priority stored in the storage module, so that the upstream node is configured according to the new multicast forwarding structure. Perform multicast service forwarding to perform congestion control on real-time multicast services.
  • the multicast forwarding structure module is composed of an initiator submodule, a graft submodule, a dead submodule, a multicast join judging submodule, and a response submodule.
  • the initiating sub-module is mainly configured to: after receiving the notification of the congestion prediction module, select an active multicast route with the lowest priority from all active multicast routes of the node, and route the downstream node to the selected active multicast group. Send a congestion message.
  • the active multicast route with the lowest priority is multiple, the initiating submodule selects an active multicast route with a small bandwidth occupation, as described in the foregoing method.
  • the initiating submodule is a multicast forwarding node that is about to be congested, the above operation is performed.
  • the grafting sub-module is configured to send a multicast group join request to the neighboring node according to the multicast group ID information carried in the congestion packet after receiving the congestion packet transmitted by the other node, and receive the response message of the neighbor node. After that, it is confirmed that the user has successfully grafted to the forwarding structure of the multicast group, and replies to the node that sends the congestion message with the information that the route dynamic adjustment succeeds.
  • the grafting sub-module only establishes a route with the sending node of the first received reply message, and discards the reply message of the same multicast route that is received later. Specifically, it is described in the above method. When the node where the grafting submodule is located is the downstream node of the multicast forwarding node to be congested, the above operation is performed.
  • the multicast join judgment sub-module is mainly used to determine whether the node meets the conditions for joining the multicast group after the multicast group join request message received by the node, and notifies the response sub-module.
  • the conditions for joining a multicast group here may be as follows: After the node establishes a multicast route, the node does not cause congestion of the node, and the route from the node to the upstream node of the node to be congested does not pass through the node that is congested. Will not pass the node that is about to be congested. Specifically, it is as described in the above method.
  • the multicast join judgment node is the neighbor node of the downstream node of the multicast forwarding node to be congested, the above operation is performed.
  • the response sub-module is mainly used to send a response message sent by the node that sends the multicast group to the request message when receiving the notification of the compliance sent by the multicast join judgment sub-module, and the non-conformity transmitted by the multicast join judgment sub-module is received.
  • the notification is made, the multicast group join request message is discarded.
  • the node where the response submodule is located is the neighbor node of the downstream node of the multicast forwarding node to be congested, the above operation is performed.
  • the invalidation sub-module is mainly used to send a multicast group route invalidation packet to the upstream node of the node where the node is located when receiving the information that the route dynamic adjustment succeeds.
  • the multicast route between the upstream node and the node where the failed submodule is located is invalid.
  • the upstream node can determine the multicast group routing information of the newly established multicast forwarding structure according to the received multicast group routing invalidation message, and use the routing information to forward the corresponding multicast service.
  • the node where the failed submodule is located is the multicast forwarding node to be congested, the above operation is performed.
  • the routing request judging module is mainly used to determine whether the node is the multicast forwarding node of the multicast routing request message when the new routing request discovery message arrives during the congestion control process of the node, that is, whether the node is located.
  • the receiver of the routing request discovery message notifies the joining module of the judgment result of the recipient or not the recipient. Specifically, it is described in the above method. When the node where the route request judgment module is located is the multicast forwarding node to be congested, the above operation is performed.
  • the adding module is mainly used to discard the routing request discovery message according to the notification that the routing request is sent by the module, and the routing request judging module sends the notification of the receiver to join the multicast group.
  • the node where the route request judgment module is located is the multicast forwarding node to be congested, the above operation is performed.
  • the present invention has the following beneficial effects:
  • the adjustment of active multicast routing is based on the premise of congestion. Therefore, the smooth transition of active multicast routing will minimize the delay and packet loss rate. The impact on real-time multicast will be minimal, so The real-time multicast service is well supported and greatly avoids congestion.
  • the adjustment of the low-priority real-time multicast service can obtain more effective resources to ensure the quality of service, and the remaining unadjusted multicast services are also improved due to congestion conditions. Better quality of service;
  • the energy of the node is used as a factor of congestion avoidance, which can prolong the survival time of the node in the network, and can also provide better service quality for the multicast service, and has good application value in military applications;
  • the external node obtains the priority issued by the CA after it has been verified by the security of the CA. Therefore, it has security protection and has little change to the existing multicast routing protocol. It has good deployment. '

Abstract

Procédé de gestion d'encombrement et dispositif de réseau pour service de multidiffusion en temps réel. Le procédé est le suivant : chaque noeud de transmission en multidiffusion prévoit l'encombrement qui le concerne ; lorsque ledit noeud confirme la prévision d'encombrement, il conduit une gestion d'encombrement pour un service de multidiffusion en temps réel selon la priorité correspondant à tout trajet de multidiffusion actif établi via le noeud. On assure ainsi une qualité de service élevée pour un service de multidiffusion en temps réel à différents niveaux. L'ajustement de ce trajet s'effectue avant l'apparition de l'état d'encombrement, afin d'établir une transition lisse de trajet de multidiffusion actif, de réduire le retard et la perte de paquets, et enfin de renforcer la gestion d'encombrement. On peut alors équilibrer la charge et optimiser les ressources du réseau et, partant, améliorer la performance du réseau MANET. Par ailleurs, l'invention ne repose pas sur un algorithme de gestion complexe, ce qui permet de réduire le trafic de service et d'éviter le gaspillage des ressources du réseau MANET.
PCT/CN2006/002065 2005-12-31 2006-08-15 Procede de gestion d'encombrement et dispositif de reseau pour service de multidiffusion en temps reel WO2007076661A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200510137226.7 2005-12-31
CN2005101372267A CN1996933B (zh) 2005-12-31 2005-12-31 对实时组播业务进行拥塞控制的方法

Publications (1)

Publication Number Publication Date
WO2007076661A1 true WO2007076661A1 (fr) 2007-07-12

Family

ID=38227902

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2006/002065 WO2007076661A1 (fr) 2005-12-31 2006-08-15 Procede de gestion d'encombrement et dispositif de reseau pour service de multidiffusion en temps reel

Country Status (2)

Country Link
CN (1) CN1996933B (fr)
WO (1) WO2007076661A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102571614A (zh) * 2012-03-12 2012-07-11 前卫视讯（北京）科技发展有限公司 对基于多级转发的网络视频的路由进行动态调整的方法和装置
CN103259696A (zh) * 2013-04-19 2013-08-21 华为技术有限公司 网络带宽检测方法、装置及网络设备
CN110855564A (zh) * 2019-10-12 2020-02-28 深圳壹账通智能科技有限公司 路由路径智能选择方法、装置、设备及可读存储介质
CN112118193A (zh) * 2020-08-27 2020-12-22 新华三技术有限公司 一种转发组播的方法、装置和网络设备

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101378354B (zh) * 2007-08-28 2010-12-08 华为技术有限公司 组播报文转发方法及装置
CN100594693C (zh) * 2007-12-14 2010-03-17 中国科学院计算技术研究所 一种多播环境下移动节点加入多播组的方法
CN101577938B (zh) * 2008-05-07 2011-06-01 华为技术有限公司 无线网状网络拥塞控制方法及系统和基站
US8085667B2 (en) * 2008-05-15 2011-12-27 Panasonic Corporation Wireless relay apparatus and wireless relay method
CN101984601B (zh) * 2010-11-04 2012-03-28 中国人民解放军空军工程大学 混合型多目标优化组播拥塞控制方法
WO2015085458A1 (fr) * 2013-12-09 2015-06-18 Telefonaktiebolaget L M Ericsson (Publ) Procédé pour une contention de ressources et point d'accès associé
US9380487B2 (en) * 2014-07-29 2016-06-28 Huawei Technologies Co., Ltd. System and method for a location prediction-based network scheduler
CN109272047A (zh) * 2018-09-27 2019-01-25 山东理工大学 一种满足光组播资源预测的隐马尔科夫模型状态构造与参数训练方法
CN111372103B (zh) * 2018-12-26 2023-05-26 中兴通讯股份有限公司 一种组播方法、装置、设备和计算机存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1409526A (zh) * 2001-09-14 2003-04-09 阿尔卡塔尔加拿大公司 用于网络信令资源有效利用的智能路由
WO2004112323A1 (fr) * 2003-06-09 2004-12-23 Telefonaktiebolaget Lm Ericsson (Publ) Transmission par paquets de supervision a largeur de bande limitee destinee a commander l'encombrement et l'etablissement d'appel dans des reseaux bases sur des paquets
CN1689278A (zh) * 2001-12-18 2005-10-26 思科技术公司 网络拥塞控制方法和装置

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3841256B2 (ja) * 2000-02-15 2006-11-01 三菱電機株式会社 通信システム及び通信方法及び送信端末

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1409526A (zh) * 2001-09-14 2003-04-09 阿尔卡塔尔加拿大公司 用于网络信令资源有效利用的智能路由
CN1689278A (zh) * 2001-12-18 2005-10-26 思科技术公司 网络拥塞控制方法和装置
WO2004112323A1 (fr) * 2003-06-09 2004-12-23 Telefonaktiebolaget Lm Ericsson (Publ) Transmission par paquets de supervision a largeur de bande limitee destinee a commander l'encombrement et l'etablissement d'appel dans des reseaux bases sur des paquets

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102571614A (zh) * 2012-03-12 2012-07-11 前卫视讯（北京）科技发展有限公司 对基于多级转发的网络视频的路由进行动态调整的方法和装置
CN103259696A (zh) * 2013-04-19 2013-08-21 华为技术有限公司 网络带宽检测方法、装置及网络设备
CN103259696B (zh) * 2013-04-19 2016-12-28 华为技术有限公司 网络带宽检测方法、装置及网络设备
CN110855564A (zh) * 2019-10-12 2020-02-28 深圳壹账通智能科技有限公司 路由路径智能选择方法、装置、设备及可读存储介质
CN112118193A (zh) * 2020-08-27 2020-12-22 新华三技术有限公司 一种转发组播的方法、装置和网络设备

Also Published As

Publication number Publication date
CN1996933B (zh) 2010-08-11
CN1996933A (zh) 2007-07-11

Similar Documents

Publication Publication Date Title
WO2007076661A1 (fr) Procede de gestion d'encombrement et dispositif de reseau pour service de multidiffusion en temps reel
JP4847541B2 (ja) データパケットトラフィック輻輳を解決する方法及び装置
Chen et al. Congestion-aware routing protocol for mobile ad hoc networks
US7756041B2 (en) Embedded routing algorithms under the internet protocol routing layer of a software architecture protocol stack in a mobile Ad-Hoc network
Roy et al. Quality of service in delay tolerant networks: A survey
Zhai et al. Distributed flow control and medium access in multihop ad hoc networks
JP4729100B2 (ja) 無線メッシュネットワーク中で経路に基づくトラフィックストリームアドミッション制御を実施する方法および装置
CN108064058B (zh) 拥塞控制方法及装置、基站
Sheeja et al. Effective congestion avoidance scheme for mobile ad hoc networks
Shah et al. Cross-layer design for QoS support in wireless multimedia sensor networks
GB2411549A (en) Route discovery with quality of service check in ad hoc network
CN112822720B (zh) 无人机组网技术中基于mac层链路质量的跨层拥塞控制方法
Qin et al. Opportunistic routing with admission control in wireless ad hoc networks
Saghir et al. A new cross-layer framework for QoS multicast applications in mobile ad hoc networks
Crisóstomo et al. A QoS architecture integrating mobile Ad-Hoc and infrastructure networks.
Koga et al. A quality-aware VoWLAN architecture and its quantitative evaluations
Gawas et al. Efficient multi objective cross layer approach for 802.11 e over MANETs
Li Multipath routing and QoS provisioning in mobile ad hoc networks
Zhao et al. A cross-layer routing scheme using adaptive retransmission strategy for wireless mesh networks
Razaque et al. Smart bandwidth friendly buffer: Handling overflow in wireless mesh networks
Borzouie et al. Improve the quality of services to help congestion control flows to send a video in wireless multimedia sensor networks
Wang et al. Label Routing Protocol: A New Cross‐Layer Protocol for Multi‐Hop Ad Hoc Wireless Networks
KR101516081B1 (ko) 무선 메시 네트워크에서 경로 기반 트래픽 스트림 허용 제어를 실행하기 위한 방법 및 장치
Huang et al. An adaptive video streaming scheme for a cooperative fleet of vehicles
Pei et al. Distributed flow admission control for multimedia services over wireless ad hoc networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 06775383

Country of ref document: EP

Kind code of ref document: A1