WO2007045163A1 - Procede pour la realisation de transmission de flux de bout en bout et equipement de noeuds - Google Patents

Procede pour la realisation de transmission de flux de bout en bout et equipement de noeuds Download PDF

Info

Publication number
WO2007045163A1
WO2007045163A1 PCT/CN2006/002730 CN2006002730W WO2007045163A1 WO 2007045163 A1 WO2007045163 A1 WO 2007045163A1 CN 2006002730 W CN2006002730 W CN 2006002730W WO 2007045163 A1 WO2007045163 A1 WO 2007045163A1
Authority
WO
WIPO (PCT)
Prior art keywords
resource
node
reserved
message
response message
Prior art date
Application number
PCT/CN2006/002730
Other languages
English (en)
Chinese (zh)
Inventor
Hongfei Chen
Bin Li
Original Assignee
Huawei Technologies Co., Ltd.
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. filed Critical Huawei Technologies Co., Ltd.
Publication of WO2007045163A1 publication Critical patent/WO2007045163A1/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
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
    • 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/18—End to end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
    • H04L47/726—Reserving resources in multiple paths to be used simultaneously

Definitions

  • the present invention relates to the field of network communication technologies, and in particular, to an end-to-end streaming method and a node device. Background of the invention
  • a flow is a sequence of messages between a particular source and destination that arrives at the same destination from the same source and has the same flow identity.
  • the source requires the intermediate node to perform specific processing on these messages by signaling or other means.
  • IPv6 Internet Protocol version 6
  • a 20-bit Flow Label field is defined in the IPv6 header.
  • a packet with a stream tag field value of 0 does not belong to any stream and is treated as a general packet.
  • the IPv6 node identifies the flow according to the triplet composed of the source address, the destination address, and the flow label in the packet header, and processes the packet in the flow according to the established flow state.
  • the existing IPv6 flow state establishment method is as shown in FIG.
  • the transmitting end Src sends a packet containing the data stream resource i to the receiving end Dst through the intermediate node R1, R2, and R3; on the path that the packet passes, if the intermediate node starts the flow state establishing function, Then, the intermediate node determines whether the node satisfies the resource request in the current packet, and if yes, performs resource reservation according to the resource request, and forwards the packet containing the data stream resource request to the next node, such as R1 direction.
  • R2 forwards the packet containing the data stream resource request; otherwise, it feeds back the resource request rejection response to the sender Src, and converts the resource request packet into a resource collection request packet, and forwards the included resource collection to the next node.
  • the requested message for example, R2 sends a resource request reject response to the sender Src, and sends a message of the resource collection request to R3.
  • the packet received by the receiving end Dst includes a data stream resource request
  • the resource reservation is performed according to the resource request, and the resource request confirmation response is fed back to the sending end Src;
  • the receiving end receives the packet, the received message includes
  • the resource collection request returns a resource collection response to the sender Src.
  • the receiver Dst receives the packet of the resource collection request transmitted by the R3, and the packet lj feeds back the resource collection response to the sender Src.
  • the sender Src maintains the reservation of resources by periodically transmitting a message containing a request for a data stream resource.
  • the sending end Src completes the resource reservation of the Src->Rl->R2->R3->Dst path through the resource request, but the data sent by the sending end Src may be It is sent to the receiving end Dst through Src->R1->R4->R3->Dst.
  • the reserved bandwidth has no data utilization, which wastes bandwidth, and the data stream that really needs bandwidth guarantee does not get bandwidth guarantee.
  • the object of the present invention is to provide an end-to-end streaming method, improve resource utilization, and enable data flow. Bandwidth guarantee.
  • an end-to-end streaming method including:
  • the flow is transmitted from the transmitting end to the receiving end according to the reserved resources of each path.
  • the step of reserving resources for the flow includes:
  • the sending end sends a resource request message carrying the reserved resource parameter corresponding to the flow to the receiving end;
  • the intermediate node that receives the resource request message performs resource reservation according to the reserved resource parameter when the resource of the local node satisfies the reserved resource parameter in the resource request message;
  • the intermediate node determines the reserved resource parameter of each load sharing item according to the reserved resource allocation policy, and transmits the resource parameter to the downstream node through the resource request message until the resource request message is transmitted to the receiving end.
  • the step of performing resource reservation according to the reserved resource parameter includes:
  • the resource reservation is performed according to the reserved resource parameter received by the node;
  • the intermediate node that receives the resource request message is the last intermediate node that arrives at the receiving end, and the resource of the local node satisfies the reserved resource parameter that it receives, the resource reservation is performed according to the reserved resource parameter received by the resource, and each of them is reserved.
  • the upstream node sends a resource request response message that the resource request is successful;
  • the intermediate node receives the resource request response message that the resource request is successful, and continues to send the resource request response message to its upstream node until the resource request response message is transmitted to the sending end.
  • the method further includes: when the intermediate node receives the resource request response message that the resource request is successful, starts to count the survival time, and the intermediate node reserves the reserved resource during the survival time, and receives the sending end again during the survival time.
  • the resource request message for the stream is started, the time to live is restarted.
  • the resource request message and the resource request response message are sent in the form of an IPv6 packet including a resource reservation extension header.
  • the step that the resources of the local node meet the reserved resource parameters that are received by the node includes: the resources of the node satisfy the reserved resource parameters that are received by the node;
  • the intermediate node receives the resource request response message that the resource request is successful, and continues to send the resource request response message to the upstream node, until the resource request response message is transmitted to the sending end, where:
  • the intermediate node having the plurality of upstream nodes continues to send the resource request response message to each of the upstream nodes until the resource request response message with the successful resource request is transmitted to the transmitting end.
  • the resource request response message sent by the intermediate node carries a maximum reserved resource range that the local node can provide for its upstream node.
  • the method further includes:
  • the intermediate node with the load sharing item adjusts the reserved resource allocation policy according to the maximum reserved resource range in the resource request response message of each downstream node that it receives.
  • the reserved resource allocation policy is: an equal-cost reserved resource allocation strategy with the same weight for each load sharing item, or each load sharing A non-equivalent reserved resource allocation strategy with different weights.
  • the method further includes: when the intermediate node that receives the resource request message is not the last intermediate node that arrives at the receiving end, and the resource of the local node cannot satisfy the reserved resource parameter received by the node, sending a resource query message to each of the downstream nodes respectively. ;
  • each of the upstream nodes is sent with the own node to be able to be its upstream node.
  • the intermediate node that receives the resource query message sends a resource query response message carrying the maximum reserved resource range that the node can provide to its upstream node, respectively, to its upstream node;
  • the intermediate node that cannot satisfy the reserved resource parameter When the intermediate node that cannot satisfy the reserved resource parameter receives the resource query response message, it transmits a resource request message that the resource request fails to the upstream node until it is transmitted to the sender.
  • the method further includes:
  • the intermediate node with the load sharing item adjusts the reserved resource allocation policy according to the maximum reserved resource range in the resource query response message of each downstream node that it receives.
  • the sending end adjusts the flow corresponding to the maximum reserved resource range in the resource request response message received by the sending end.
  • the resource parameter is reserved, and the resource request message carrying the adjusted reserved resource parameter is resent to the receiving end.
  • the method further includes: sending, by the sending end, a resource query message to the receiving end; each intermediate node returns to the sending end a resource query response message carrying a range of 3 ⁇ 4 large reserved resources that the local node can provide for the upstream node.
  • the method includes: when the sending end determines that the maximum reserved resource range in the resource query response message received by the sending end can satisfy the reserved resource of the flow, the sending end resends the resource request message to the receiving end.
  • the resource query message and the resource query response message are sent in the form of an IPv6 packet including a resource reservation extension header.
  • the method includes: each intermediate node transmits the stream through a reserved resource according to a hash algorithm or a weighting algorithm.
  • the present invention also provides a node device, where the node device includes a resource reservation module and a transmission module;
  • a resource reservation module configured to determine, according to a sending end and a receiving end of the flow, a plurality of paths that are sent to the downstream node, and reserve resources for the flow in the multiple paths;
  • the transmission module is configured to: transmit the stream transmitted by the upstream node to the receiving end according to the resource reserved by the resource reservation module for the stream.
  • the technical solution of the following node device is an optional technical solution.
  • the resource reservation module includes:
  • a resource reservation sub-module configured to receive a resource request message that is sent by an upstream node and that carries a reserved resource parameter corresponding to the flow, and when determining that the resource of the local node meets the reserved resource parameter in the resource ifi request message, Reserving resources according to the reserved resource parameter ';
  • the parameter transmission sub-module is configured to determine, after the resource reservation sub-module performs resource reservation, the reserved resource parameter of each load sharing item according to the reserved resource allocation policy, and transmit the parameter to the downstream node by using the resource request message.
  • the node further includes a first query module and a query response module;
  • the first query module is configured to: receive a resource request message at a node where the node is located, and determine that the node where the node is located is not the last intermediate node that arrives at the receiving end, and the resource reservation submodule of the node where the node is located determines that the resource of the node cannot satisfy the When the resource parameter in the resource request message is used, the resource query message is sent to each downstream node; the resource request message is received at the node where the node is located, and the node that is located is the last intermediate node that arrives at the receiving end, and When the resource reservation sub-module of the node determines that the resource of the node cannot meet the reserved resource parameter in the resource request message, each of the upstream nodes separately sends a maximum reserved resource range that the node can provide for its upstream node.
  • Resource query response message is configured to: receive a resource request message at a node where the node is located, and determine
  • the query response module when receiving the resource query message sent by the first query module, respectively sending a resource query response message carrying the maximum reserved resource range that the node in which the node is located can provide for the upstream node to send to the upstream node;
  • the resource reservation sub-module determines that the resource of the node where the resource is located cannot satisfy the reserved resource parameter in the resource request message, and receives the resource query response message, the resource request response message that the resource request fails is transmitted to the upstream node;
  • the second query module and the determining module are further disposed in the node; when the node is the sending end of the stream, the second query module is configured to send a resource query message to the receiving end;
  • the query response module in the node as the intermediate node is configured to: after receiving the resource query message sent by the second query module, return to the sending end, and return the maximum pre-loaded by the node to be able to provide the upstream node for the upstream node. a resource query response message of the resource range; a judging module in the node as the sender: when determining that the maximum reserved resource range in the resource query response message received by the node where the node is located can satisfy the reserved resource of the stream The notification resource requesting module resends the resource request message to the receiving end.
  • the resource reservation is performed for the flow in each path between the transmitting end and the receiving end, so that the path of the reserved resource and the path actually forwarded by the data flow are inconsistent, so that the IPv6 is inconsistent.
  • the reserved resources can be practically applied, and the load sharing resources are utilized to the greatest extent, so that the network resources are fully utilized; the present invention utilizes the resource request message, the resource if? response message, the resource query message, and the resource query response.
  • the message provides a complete end-to-end flow state establishment mechanism.
  • the resource request response message and the resource query response message carry the maximum resource reservation range that the node can provide for the upstream node, so that each intermediate node can know the resources in each load sharing item, so that the sending end can know the The resource situation of the path between the receiver and the receiving end, such that The inter-node can perform reasonable allocation of reserved resources, and the transmitting end can appropriately adjust the reserved resource parameters corresponding to the flow, or when the resource condition of the path satisfies the reserved resource parameter corresponding to the flow, re-establish the flow state, and make the flow as possible.
  • the state can be successfully established; thus, the technical solution provided by the present invention achieves the purpose of improving network resource utilization and improving the end-to-end flow state utility.
  • FIG. 1 is a schematic diagram of an end-to-end streaming method in the prior art
  • FIG. 2 is a schematic diagram of a problem existing in an end-to-end streaming method in the prior art
  • FIG. 3 is a schematic diagram 1 of an end-to-end streaming method according to an embodiment of the present invention.
  • FIG. 4 is a second schematic diagram of an end-to-end streaming method according to an embodiment of the present invention.
  • FIG. 5 is a third schematic diagram of an end-to-end streaming method according to an embodiment of the present invention.
  • 6 is a fourth schematic diagram of an end-to-end streaming method according to an embodiment of the present invention
  • 7 is a schematic diagram 5 of an end-to-end streaming method according to an embodiment of the present invention
  • FIG. 8 is a sixth schematic diagram of an end-to-end streaming method according to an embodiment of the present invention. Mode for carrying out the invention
  • the resource request message in the embodiment of the present invention may be transmitted in each intermediate node between the transmitting end and the receiving end of the IPv6, that is, each intermediate node copies and forwards the resource request message on multiple load sharing links, so that the resources of the sending end are enabled.
  • the request message can traverse all load sharing links of the intermediate nodes.
  • the intermediate node in the embodiment of the present invention copies the resource request message when the resource of the local node can satisfy the reserved resource parameter corresponding to the flow.
  • it should modify the reserved resource parameter in the resource request message received according to the number of load sharing items. For example, if the intermediate node receives the resource request message requesting 1M bandwidth, if the intermediate node receives the resource request message If the node has two load balancing items, the intermediate node should allocate the reserved bandwidth for each load sharing according to the predetermined reserved resource allocation policy to ensure that the sum of the reserved bandwidth of the two load sharing items is equal to 1M.
  • all intermediate nodes between the sender and the receiver perform the above processing.
  • the intermediate node of the present invention fails to satisfy the reserved resource parameter in the resource request message, it does not simply convert the resource request into a resource collection request, but determines the maximum reserved resource range that the node can provide for its upstream node. Then, the maximum reserved resource range is advertised to the upstream node, and the upstream node saves the resource of the downstream node, so that it can allocate the reserved resource for each load sharing item, that is, the intermediate node, when the next time the resource request is received.
  • the reserved resource parameters can be dynamically allocated.
  • traffic can be dynamically allocated to different load sharing items.
  • the reserved resources of each intermediate node in the present invention are set with a lifetime (live time).
  • a lifetime live time
  • the resource is no longer reserved, and the sending end needs a period. It requests the reserved resources to the receiving end to ensure that the lifetime of resources reserved by each intermediate node does not end during the streaming process.
  • the resource request message mainly includes: a message identifier, a stream identifier, a reserved resource parameter, and a lifetime.
  • the message identifier is mainly used to identify the message as a resource request message;
  • the flow identifier is used to identify a unique identifier of a flow that needs to reserve resources from the sender to the receiver;
  • the reserved resource parameter is mainly used to indicate the CIR (committed rate) of the flow.
  • PIR peak rate
  • delay request jitter request
  • minimum message length maximum message length and other parameters
  • survival time is used to indicate the survival time of resource reservation.
  • the resource request response message includes: message identifier, flow identifier, response information, maximum resource reservation range, and the like.
  • the message identifier is used to indicate that the message is a resource request response message; the flow identifier in the resource request response message should be the same as the flow identifier in the resource identifier request message; the response information is used to indicate whether the resource request is successful;
  • the resource reservation range is mainly used to indicate the maximum resource reservation range that the node can provide.
  • resource query messages, the main play includes: message identification, query identification and so on.
  • the message identifier is used to identify the message as a resource: ff.
  • the query identifier is used to identify the unique identifier of the resource query message from the sender to the receiver, that is, the query identifier of each resource april query message is unique.
  • the resource query response message includes: message identifier, query identifier, maximum resource reservation range, and the like.
  • the message identifier is used to identify the message as a resource query message; the query identifier in the resource query should be the same as in the resource query message.
  • Most The large resource reservation range is mainly used to indicate the maximum resource reservation range that the node can provide.
  • the present invention can newly define an IPv6 extension header for the foregoing messages, that is, the resource reservation extension header, and the resource request message, the resource request response message, the resource query message, and the resource query response message of the real-time application data flow are carried in the
  • the resource reservation extension header is transmitted in Option (option).
  • the present invention can also newly define several options in the currently defined Hop-by-hop Options Header, and transmit the above messages of the real-time application data stream in the newly defined Option (option).
  • the hop-by-hop option header may be referred to as a resource reservation extension header.
  • the sender reduces the message overhead by carrying the above message in the resource reservation extension header of the IPv6 packet without using the packet of the dedicated protocol.
  • FIG. 3 is a flow chart of the end-to-end streaming method of the present invention when each intermediate node can satisfy the resource reservation request from the sender to the receiver.
  • the sender Src first sends a resource request message to the receiving end Dst, and reserves resources for the stream that needs to be sent to the receiving end Dst.
  • the resource request message may be sent in the form of an IPv6 message containing a resource reservation extension header.
  • the resource request message sent by the sender Src includes the message identifier, the stream identifier, and the reserved resource parameters (such as CIR, PIR, delay and jitter, etc.) and the survival time.
  • the CIR and PIR in the reserved resource parameters are used as an example to describe the end-to-end flow state standing process of the present invention.
  • the CIR in the resource request message sent by the sending end Src is 1M, and the PIR is 2M.
  • the intermediate node R1 receives the IPv6 packet, and determines whether the IPv6 packet includes the resource reservation extension header. If not, the intermediate node R1 forwards the IPv6 packet according to the normal forwarding procedure; if the resource reservation is included The extension header, and determining, according to the message identifier in the resource reservation extension header, that the IPv6 packet contains the resource request message, the intermediate node R1 obtains the flow identifier, the lifetime, and the reserved resource parameter from the resource reservation extension header, such as CIR, PIR, delay requirements, jitter, etc.
  • the intermediate node R1 When it is determined that the resource request message is not included in the IPv6 packet, the intermediate node R1 does not perform the process of acquiring the flow identifier, the time-to-live, and the entertainment resource parameter, and the intermediate node R1 may discard the packet, and may also send the packet to the sender Src. The node returns an error message, so that the sender Srcfi newly sends a resource request message to the receiver Dst.
  • the intermediate node R1 determines whether the resource reservation of the flow already exists according to the flow identifier, that is, whether the flow identifier in the resource request message is equal to the flow identifier in other resource reservation requests recorded by the node, and if they are equal, the flow is indicated.
  • the resource request message is subjected to load sharing and aggregated at the local node before reaching the local node; if not equal, it indicates that the resource resource request message of the flow reaches the node for the first time. Since there is no load sharing between the sender Src and the intermediate node R1, the same flow identifier as in the resource request message is not recorded in the intermediate node, and the resource request message is reserved for the new stream. Resource request message.
  • the reserved resource parameter to be processed by the intermediate node R1 for this flow is the reserved resource parameter in the resource request message received this time, that is, the CIR is 1M, and P[R is 2M.
  • the intermediate node R1 determines whether there are multiple load sharing paths between the node and the receiving end Dst. Since the intermediate node R1 can reach the receiving end Dst through R2 and R4, the intermediate node R1 determines whether the sum of the resources of the two load sharing items can be Meet the resource reservation value of the upstream-point consultation. In this embodiment, the sum of the resources of the two load sharing items of the intermediate node R1 can satisfy the resource reservation value requested by the upstream node. Therefore, the intermediate node R1 sends a resource request message to the path shared by each load, where the resource is located. The request message is still an IPv6 packet containing the resource reservation extension header. The intermediate node R1 delivers resources to the path shared by each load. The CIR in the request message is 0.5M and the PIR is 1M.
  • the sum of the resource reservation values corresponding to the load sharing items should be equal to the resource reservation value sought by the upstream node, that is, the intermediate node R1 sends the resource reservation values to the downstream nodes R2 and R4, respectively.
  • the sum of C1Rs in the resource request message shall be 1M, and the sum of PIRs shall be 2M.
  • the CIR and PIR in the resource request message sent by the intermediate node R1 to the downstream node R2 may be equal to the CIR and PIR in the resource request message sent by the intermediate node R1 to the downstream node R4, that is, the CIR and PIR respectively requested by the upstream node are respectively divided by Load sharing item 2.
  • the intermediate node R1 divides the CIR into 0.5M and divides the PIR into 1M.
  • the resource request message sent by the intermediate node R1 to the two load sharing paths is an equivalent resource request message.
  • the CIR and PIR in the resource request message sent by the intermediate node R1 to the downstream node R2 may also be different from the CIR and PIR in the resource request message sent by the intermediate node R1 to the downstream node R4, that is, the intermediate node R1 according to a predetermined policy, such as according to the load.
  • the weights and the like configured on the sharing items are determined to determine the CIR, PIR, and CIR, PIR in the resource request message sent to the downstream node R4, which are sent to the downstream node R2.
  • the resource request message sent by the intermediate node R1 to the two load-sharing paths is a non-equivalent resource request message.
  • the intermediate node R1 Since the intermediate node R1 is not the last intermediate node that arrives at the receiving end Dst, the intermediate node R1 does not send a resource request response message to its upstream node after issuing the resource request message, but waits for the resource request response message of its downstream node.
  • the intermediate node R2 receives the IPv6 packet from the upstream node R1 and includes the resource reservation extension header.
  • the process of processing the IPv6 packet by the intermediate node R2 is the same as that described above for the intermediate node R1, that is, the intermediate node R2 pairs the two.
  • the IPv6 packets carrying the resource reservation extension header are respectively delivered to the load-sharing path, that is, the IPv6 packets containing the resource reservation extension header are sent to the downstream nodes R3 and R5, and the resources of the two resource reservation extension headers are respectively reserved.
  • the CIR values in the request message may be the same or different, and the values of the PIR may be the same or different. In Figure 3, the CI in both resource request messages is 0.25M and the PIR is 0.5M. Similarly, the intermediate node R2 also needs to wait for the resource request response message of its downstream node.
  • the intermediate node R4 receives the IPv6 packet from the upstream node R1 and includes the resource reservation extension header.
  • the process of processing the IPv6 packet by the intermediate node R4 is basically the same as that described above for the intermediate node R1, except that the R4 can only pass.
  • the downstream node R3 reaches the receiving end Dst, and there is no load sharing item. Therefore, the intermediate node R4 sends only the IPv6 packet containing the resource reservation extension header to the downstream node R3, and the resource request message in the resource reservation extension header is The CIR was 0.5 M and the PIR was 1 M. Similarly, intermediate node R4 also needs to wait for a resource request response message from its downstream node.
  • the intermediate node R3 receives two IPv6 packets including the resource reservation extension header. Since the flow identifiers in the resource request messages of the resource reservation extension headers of the two IPv6 packets are the same, the intermediate node R3 determines this. The resource request message of the flow is load-balanced and aggregated at the local node before reaching the local node. At this time, the reserved resource parameter to be processed by the intermediate node R3 for the flow is the pre-request in the two resource request messages received by the intermediate node R3. Leave resource parameters. ,
  • the intermediate node R3 merges the CIRs in the two resource request messages it receives, and merges the PIRs.
  • the combined value of CIR is 0.75M
  • the combined value of P1R is 1.5M. Then, the intermediate node R3 determines whether it can satisfy the combined resource reservation value. Set in the flow of Figure 3, the intermediate node R3 can satisfy the resource reservation value requested by the merged upstream node.
  • the intermediate node R3 Since the intermediate node R3 is the last intermediate node that reaches the receiving end Dst, and the intermediate node R3 can satisfy the combined resource reserved value, the intermediate node R3 sends the resource requesting successful resources to its two upstream nodes R4 and R5 respectively.
  • the request response message, the resource request response message may be sent in the form of an IPv6 message including a resource reservation extension header.
  • the resource request response message includes not only the message identifier of the resource request response message, the flow identifier, the success of the resource request, but also the intermediate node R3.
  • the maximum resource reservation range that can be provided to the upstream node. As shown in FIG.
  • the CIR in the resource request response message sent by the intermediate node R3 to the upstream node R4 is 2M
  • the PIR is 4M
  • the intermediate node R3 sends the message to the upstream node R2.
  • the CIR in the resource request response message is 10M
  • the PIR is 20M.
  • the intermediate node R3 starts to count the time-to-live in the resource request message received by the upstream node R2, R4, and sends the resource request message to the upstream node R2, R4. When the time value reaches the time-to-live, the intermediate node R3 does not receive it again.
  • the sender Src requests a message for the resource sent by the stream, the resource reserved for the stream is released.
  • the intermediate node R5 receives only one IPv6 packet containing the resource reservation extension header. Therefore, the intermediate node R5 directly determines whether it can satisfy the upstream node R2 according to the reserved resource parameter in the resource request message of the resource reservation extension header. The requested resource reservation value. In the flow of Fig. 3, the intermediate node R5 is set to satisfy the resource reservation value requested by the upstream node R2.
  • the intermediate node R5 Since the intermediate node R5 is the last intermediate node that reaches the receiving end Dst, and the intermediate node R5 can satisfy the resource reservation value sought by the upstream node R2i, the intermediate node R5 sends a resource request response message with a successful resource request to its upstream node R2. .
  • the resource request response message may be sent in the form of an IPv6 packet including a resource reservation extension header, and the resource request response message herein also includes a maximum resource reservation range that the intermediate node R5 can provide for its upstream node. As shown in FIG. 3, the CIR in the resource request response message sent by the intermediate node R5 to the upstream node R2 is 10M, and the PIR is 20M. Similarly, the intermediate node R5 also starts timing the time it takes to receive it.
  • the intermediate node R2 receives the IPv6 packets of the downstream nodes R3 and R5 that contain the resource reservation extension header, and determines the messages in the two resource reservation extension headers according to the message identifiers in the two resource reservation extension headers.
  • the intermediate node needs to feed back the maximum resource reservation range that can be provided to its upstream node to its upstream node R1.
  • the intermediate node R2 can add the two maximum resource reservation ranges to the upstream node.
  • R1 sends a resource request response message that the resource request is successful, and the maximum resource reservation range in the resource request response message is the result of the above addition, as shown in FIG. 3, the resource request response message sent by the intermediate node R2 to the upstream node R1.
  • the CIR is 20M and the PIR is 40M.
  • the intermediate node R4 receives the IPv6 packet of the downstream node R3 that includes the resource reservation extension header, and determines that the message in the resource reservation extension header is a resource request response message according to the message identifier in the resource reservation extension header.
  • the upstream node R1 sends a resource request response message with a resource request success.
  • the maximum resource reservation range in the resource request response message is the maximum resource reservation range value in the resource request response message received, as shown in FIG.
  • the CIR in the resource request response message sent by R4 to the upstream node R1 is 0.5M, and the PIR is 1M.
  • the intermediate node R1 determines that the message in the resource reservation extension header of the IPv6 packet transmitted by the downstream nodes R2 and R4 respectively received is the resource request response message of the resource request success, the intermediate node R1 pairs the downstream nodes R2 and R4.
  • the processing of the resource request response message is as described above for the intermediate node R2.
  • the resource sent by the intermediate node R1 to the sender Src, ifi is successful, the CIR in the request response message is 22M, and the PIR is 44M.
  • the sender Src receives the resource request success response resource ⁇ of the downstream node R1, and the flow state between the sender Src and the receiver Dst is successfully established. At this time, the sending end Src may transmit the stream corresponding to the stream identifier to the receiving end Dst according to the reserved resource. In this way, when the intermediate node transmits the flow through the path of the load sharing item, the intermediate node can ensure that the flow is transmitted through the reserved resource, thereby avoiding the phenomenon that the reserved resource is not fully utilized.
  • the intermediate node can provide the maximum resource reservation range provided for its upstream node, so that each intermediate node and the transmitting end that receive the resource request response message can The resource status of the downstream node is known, so that the intermediate node can adjust the reserved resource parameter in the resource request message sent to the different load sharing item according to the actual resource condition of the downstream node in the process of the next resource reservation. .
  • the process of sending the resource request message and the sending resource request response message by the sending end Src and the intermediate node R1, R2, and R5 is basically the same as that described above for the transmitting end Src and the intermediate node R1, R2, and R5 in FIG.
  • the only difference is that the intermediate node R1 obtains the maximum resource reservation range that the downstream node R4 can provide according to the resource query response message of its downstream node R4, and, because the intermediate node R4 cannot satisfy the resource reservation of its upstream node R1.
  • the request therefore, the intermediate node R1 should send a resource request response message indicating that the resource request failed to the sender Src.
  • the intermediate node R4 in FIG. 4 cannot satisfy the resource reservation request of the upstream node R1, the intermediate node R4 needs to modify the resource request message to the resource query message, and then sends the resource query message to the downstream node R3. If the intermediate node R4 has a load sharing item, the intermediate node R4 needs to send a resource query message to the downstream node of each load sharing item.
  • the resource query message can be sent in the form of an IPv6 packet containing the resource reservation extension header. After the bull node R4 sends the resource query message, it waits for the resource query response message fed back by the downstream node.
  • the intermediate node R3 receives the IPv6 packet containing the resource reservation extension header of the upstream node R4, and determines the message in the resource reservation extension header as the resource query message according to the message identifier in the resource reservation extension header, and then the local node
  • the maximum resource reservation range that can be provided for the upstream node R4 is transmitted to the upstream node through the resource query response message.
  • the resource query response message can be sent in the form of an IPv6 packet containing the resource reservation extension header.
  • the resource query response message mainly includes a message identifier, a query identifier, a flow identifier, and a maximum resource reservation range that the node can provide for the upstream node that sends the resource query message.
  • the CIR in the resource query response message sent by the intermediate node R3 to its upstream node R4 is 2M and the PIR is 3M.
  • the intermediate node R4 receives the IPv6 packet of the downstream node R3 that includes the resource reservation extension header, and determines that the message in the resource reservation extension header is a resource query response message according to the message identifier in the resource reservation extension header, and the intermediate node
  • the maximum optimal reservation value that R4 can provide for the upstream node R1 is carried in the resource request response message, and the resource request response message is transmitted to the upstream node R1 through the IPv6 packet containing the resource reservation extension header, and at the same time, Node R4 also needs to record the maximum resource reservation value that downstream node R3 can provide.
  • the intermediate node R4 needs to summarize the maximum resource reservation range in the resource query response message fed back by the downstream node of each load sharing item, and then, according to The result of the aggregation is that the maximum resource reservation range that the node can provide for the upstream node R1 is transmitted to the upstream node R1 through the resource request response message, and the intermediate node R4 also records the maximum resource reserved value that each load sharing item can provide. .
  • the intermediate node 1 4 sets the weight of each load sharing item according to the S large resource reserved value that can be provided by each load sharing item recorded.
  • the intermediate nodes R3 and R5 in FIG. 4 do not need to send a resource query message to the downstream node, and directly enable the node to be
  • the maximum resource reservation range provided by its upstream node is transmitted to its upstream node through the resource query response message.
  • the intermediate node R1 receives the IPv6 packet of the downstream node R4 that includes the resource reservation extension header, and determines the downstream node by using the message identifier in the resource reservation extension header to determine the message in the resource reservation extension header as the resource query response message.
  • the intermediate node R1 can set the right 2 for each load sharing item according to the resource conditions of the different load sharing items recorded therein, so that the intermediate node R1 can obtain multiple load sharing according to the next resource reservation request message.
  • the resource condition of the item that is, the weight of each load sharing item, uses the non-equivalent resource reservation method for resource reservation allocation.
  • the sender Src When the sender Src receives the resource request response message of the resource request failure of the downstream node R1, the sender Src determines that the flow state establishment failure between the sender and the receiver Dst has failed. At this time, the transmitting end Src may determine that the resource request message needs to be sent to the receiving end Dst again according to the reserved resource parameters such as CIR and PIR in the resource request response message received by the sending end.
  • the intermediate node R1 when the intermediate node R1 receives the resource request message of the sender Src again and sends a resource request message to its downstream nodes R2 and R4, the intermediate node R1 may send a resource request message to the downstream node R2.
  • the CIR is set to 0.75M and the PIR is set to 1.5M.
  • the intermediate node R1 can set the CIR in the resource request message sent to the downstream node R4 to 0.25M and the PIR to 0.5M. Thereby, the end-to-end flow state between the transmitting end Src and the receiving end Dst can be successfully established. '
  • the process of sending the resource request message and the sending resource request response message by the sending end Src and the intermediate node R1 is basically the same as that of the sending end Sn; the intermediate node R1 in FIG. 4; the intermediate node R4 sends a resource query message,
  • the process of the resource query response message is also substantially the same as the description of the intermediate node R4 in FIG. 4 described above.
  • the intermediate node R2 in Fig. 6 cannot satisfy the resource reservation request of the upstream node R1, the intermediate node R2 modifies the resource request message into a resource query message, and then sends the resource query message to the downstream nodes R3 and R5.
  • the intermediate nodes R3 and R5 respectively receive the IPv6 packet of the upstream node R2 that includes the resource reservation extension header, and determine that the message is a resource query message according to the message identifier in the resource reservation extension header, and the node can provide the local node.
  • the maximum resource reservation range is transmitted to the upstream node R2 through a message inquiry response message.
  • the CIR in the resource S-information response message sent by the intermediate node R3 to its upstream node R2 is 10M, and the PIR is 20M; the CIR in the resource-april inquiry response message sent by the intermediate node R5 to its upstream node R2 is 10M, The PIR is 20M.
  • the intermediate node R2 receives the IPv6 packets of the downstream nodes R3 and R5 that include the resource reservation extension header, and reserves the extension header according to the resource.
  • the message identifier in the message is determined to be a resource query response message
  • the maximum resource reservation range in the two resource query response messages is summarized. For example, two CIRs are added, and two PIRs are added, and then According to the summarized result, the maximum resource reservation range that can be provided for the upstream node R1 is transmitted to its upstream node R1 through the resource request response message.
  • the intermediate node R2 needs to record the maximum resource reservation value that the downstream nodes R3 and R5 can provide.
  • the intermediate node R1 receives the IPv6 packets of the downstream nodes R4 and R2 that contain the resource reservation extension header, and determines that the two messages are resource query response messages according to the message identifiers in the two resource reservation extension headers. At the time, the maximum resource reservation range that the downstream nodes R2 and R4 can provide is recorded.
  • the intermediate node R1 aggregates the maximum resource reservation ranges of R2 and R4, and according to the summarized result, the maximum resource reservation range that can be provided by the sender Src is transmitted to the sender Src through the resource request response message of the resource request failure. As shown in FIG. 6, the intermediate node R1 sets the CIR in the resource request response message of the resource request failure to 0.8M, the PIR to 1.6M, and sends it to the sender Src. Similarly, the intermediate node R1 can set a weight for each load sharing item according to the resource conditions of different load sharing items recorded by it.
  • the sending end Src After receiving the resource request response message that the resource request fails, the sending end Src determines whether the flow that needs to be sent to the receiving end Dst must satisfy the resource reservation to be sent, and if the flow must satisfy the resource reservation to be sent, send The Src does not send the resource reservation request of the stream to the receiving end Dst, but periodically sends a resource query message to detect the resource condition on the path.
  • the intermediate node R1 receives the resource query of the sending end Src. When the message is sent, it continues to send resource query messages to its downstream nodes R2 and R4, and so on. When the resource query messages are respectively transmitted to the last intermediate nodes R3 and R5 reaching the receiving end Dst, R3 and R5 respectively provide them.
  • the maximum resource reservation value is fed back to its upstream node by the resource query response message, and the intermediate node receiving the resource query response message can provide the local node with the maximum resource reservation value in the resource query response message.
  • the maximum resource reservation value is fed back to the upstream node through the resource query response message, and so on. Until the transmitting end Src.
  • the CIR in the resource query response message of the intermediate node R1 received by the sender Src is set to 0.8M and the PIR is set to 1.6M.
  • the sending end Src determines that the reserved resource parameter in the received resource query response message can satisfy the resource reservation request of the flow, it sends a resource request message to the receiving end Dst again to establish an end-to-end flow state for the flow.
  • the sender Src When the sender Src receives the resource request response message that the resource request fails, and determines that the flow that needs to be sent to the receiver Dst can reduce the value of the reserved resource parameter, the sender Src adjusts the reserved resource in the resource request message.
  • the parameter value sends a new resource reservation request to the receiving end Dst.
  • the sending end Src adjusts the CIR in the resource request message to 0.8M, adjusts the PIR to 1.6M, and then sends a resource request message.
  • the intermediate nodes R1 and R2 can adjust the reserved resource parameter values sent to the downstream node according to the weights S corresponding to the respective load sharing items respectively recorded.
  • the present invention can The above stream successfully establishes an end-to-end flow state.
  • the reserved resource parameters carried by each message are not limited to CIR and PIR, and should include: commitment rate, peak rate, delay request, jitter request, minimum message length. , S large message length pre-3 ⁇ 4 resource parameters, wherein, delay play, jitter play, fl3 ⁇ 4 small message K degree, maximum message length and other reserved resource parameters in the intermediate node of the load sharing item resources 3 ⁇ 4
  • the message, the resource request response message, and the resource query response message are all the same. No : - Perform equal division, unequal division, summary, etc. according to the number of load sharing items, such as the delay of the sending end. 1 millisecond, then the delay of each load sharing should be 1 millisecond.
  • the intermediate nodes can forward the data of the flow on multiple load sharing paths according to a certain ratio.
  • the present invention provides a weighting algorithm and a HASH algorithm.
  • the triplet of the IPv6 packet of this flow is the same, that is, the source IP address, the destination IP address, and the Flow Lable are the same, so the triplet cannot be used. As an input to HASH.
  • the result of the HASH algorithm is guaranteed to be a certain length, such as a value of a minimum of 1-1000.
  • a certain length such as a value of a minimum of 1-1000.
  • the traffic ratio that can be assumed by the three load-sharing paths according to the resource request message is 17: 20: 63, and the three ratios are added to 100, if HASH
  • the result of the method is relatively short, such as 2bits. In this way, the stream can only be divided into 4 pieces of data, and the load sharing cannot be performed according to the requirements of 100 pieces of data.
  • the second path, 37C HASH results ⁇ 1000 to take the third path.
  • the HASH method can directly collect the clock information of the network device, such as the millisecond value of the collected clock information, which is 1000 milliseconds per second, so the value is 0-999, which can meet the requirements of complex load sharing.
  • the method of data stream transmission according to the weighting algorithm is as follows - the application of the weighting algorithm in streaming is simpler than the HASH method.
  • the weighting algorithm needs to generate a counter for the intermediate node, and the intermediate node processes the data packet of one stream for each time.
  • the maximum value of the counter is the sum of the weights of the load sharing items. If the counter is cleared to 0, the value of the counter falls within the range of the weight value, and the load sharing item is forwarded. For example, if an intermediate node has 3 For a load-sharing path, the traffic load ratio of the three load-sharing paths detected according to the resource request message is 17:20:63, the three ratios are added equal to 100, and the counter has a count range of 0-99.
  • the data stream is forwarded by the first load sharing item.
  • the counter count value is ⁇ 99, the data stream is forwarded through the third load sharing item.
  • the present invention provides an end-to-end node device, such as a switch, a routing device, and the like.
  • the node device is provided with a resource request module, a second query module, a judgment module, a resource reservation module, a first query module, a query response module, and a transmission module.
  • the resource requesting module, the second querying module, and the determining module in the node implement the operation of the transmitting end in the streaming.
  • the node is an intermediate node in the streaming process
  • the resource reservation module, the first query module, the query response module, and the transmission module in the node implement the operation of the intermediate node in the streaming.
  • the resource requesting module is configured to send a resource request message carrying the reserved resource parameter corresponding to the flow to the receiving end.
  • the resource request message is in the form of an IPv6 packet containing a resource reservation extension header, as described in the foregoing method.
  • the resource reservation module is mainly configured to determine, according to the sending end and the receiving end of the flow, multiple paths that are transmitted to the downstream node, and reserve resources for the flow in the multiple paths.
  • the resource reservation module is composed of a resource reservation submodule and a parameter transmission submodule.
  • the resource reservation sub-module is configured to receive a resource request message sent by the sending end to the receiving end and carry the reserved resource parameter corresponding to the flow, and determine that the resource of the node where the node is located can satisfy the reservation in the resource request message.
  • the resource parameter is used, the resource reservation is performed according to the reserved resource parameter in the resource request message, and the resource request response message of the resource request success is transmitted to the upstream node until the transmission to the sending end; the resource of the node where the node is located cannot be satisfied.
  • the resource request message is reserved in the resource request message, the first query module is notified.
  • the intermediate node that receives the resource request message is not the last intermediate node that arrives at the receiving end, the first query module is used to send a resource query message to each downstream node separately when receiving the notification of the resource reservation sub-module.
  • the first query module is used to send the local node to each upstream node when receiving the notification of the resource reservation sub-module.
  • a resource query response message that is capable of providing the largest reserved resource range for its upstream node.
  • the first query response module of the intermediate node is mainly configured to send, to the upstream node, the maximum reserved resource range that the node in which the node is located can provide the upstream node when the resource query message sent by the upstream node of the node is received. Resource query response message.
  • the parameter transmission sub-module is mainly used to determine the reserved resource parameters of each load sharing item according to the reserved resource allocation policy after the resource reservation sub-module performs resource reservation, and transmits the resource parameter to the downstream node through the resource request message.
  • the parameter transmission sub-module can adjust the reserved resource allocation policy according to the maximum reserved resource range in the resource request response message of each downstream node received by the node, where the reserved resource allocation policy can be: each load sharing item has the same weight
  • the equal-cost reserved resource allocation policy of the value may also be: a non-equivalent reserved resource allocation strategy in which each load sharing item has different weights. Specifically, it is described in the above method.
  • the resource reservation sub-module determines that the resource of the node where the resource is located cannot satisfy the reserved resource parameter in the resource request message received by the node, and receives the resource query response message, the resource request fails to transmit the resource request to the upstream node of the node where the node is located.
  • the resource consults the response message until it is transmitted to the sender.
  • the resource reservation sub-module After the resource reservation sub-module receives the resource request message, the resource reservation sub-module determines that the defect location is not the last intermediate node of the receiving end, and determines that the resource of the node where the node is located can satisfy the pre-received
  • the resource parameter is reserved
  • the resource reservation is performed according to the reserved resource parameter, and a resource request response message with a successful resource request is sent to each upstream node, and the resource request message is continuously sent to the downstream node.
  • the resource reservation sub-module When receiving the resource request response message that the resource request is successful, the resource reservation sub-module starts counting the time-to-live time, and when receiving the resource request message for the stream by the sender again in the lifetime, re-starts the time-to-live time.
  • the resource reservation submodule of the intermediate node retains its reserved resources during the lifetime. Specifically, it is described in the above method.
  • the resource reservation sub-module After the resource reservation sub-module receives the resource request message, the resource reservation sub-module determines that the node where the node is located is the last intermediate node that arrives at the receiving end, and determines that the resource of the node where the node is located can satisfy the reserved resource that is received by the node. When the parameter is used, the resource reservation submodule transmits a resource request response message requesting a successful resource request to the upstream node of the node where it is located until it is transmitted to the sender. Specifically, it is described in the above method. ⁇
  • the second april query module in the node After receiving the resource request response message that the resource request fails, the second april query module in the node is used to send a resource query message to the receiving end, for example, the second query module periodically sends a resource check. Ask for news, etc. Specifically, it is described in the above method. '
  • the query response module in the streaming intermediate node After receiving the resource S query message sent by the second query module, the query response module in the streaming intermediate node returns to the sending end a maximum reserved resource range that the local node can provide for its upstream node. Resource query response message. Specifically, it is described in the above method.
  • the judging module in the node as the stream transmitting end is mainly used to notify the resource requesting module to resend the resource to the receiving end when determining that the maximum reserved resource range in the resource query response message received by the transmitting end can satisfy the reserved resource of the stream Begging for news, from And continue the process of resource reservation mentioned above.
  • the transmitting module transmits the stream to the receiving end.
  • the transmission module is mainly used to transmit the stream transmitted by the upstream node to the downstream node according to the resource reserved by the resource reservation module for the flow, until the stream is transmitted to the receiving end. Specifically, it is described in the above method.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention a trait à un procédé pour la réalisation de transmission de flux de bout en bout et un équipement de noeuds, le principaux caractéristiques techniques sont: la réservation de ressources pour ledit flux dans plusieurs trajets entre l'extrémité d'expédition et l'extrémité de réception du flux, ledit flux étant transmis depuis l'extrémité d'expédition vers l'extrémité de réception selon les ressources réservées dans chaque trajet. L'invention permet d'éviter le phénomène par lequel le trajet avec des ressources réservées est différent des trajets réels sur lesquels le flux de données est transmis, et permet une utilisation pratique des ressources Ipv6 réservées; l'invention utilise les ressources de partage de charge au maximum, utilise à bon escient les ressources du réseau, permettant ainsi l'amélioration du taux d'utilisation de ressources de réseau et le possibilité d'exécution de statut de flux en continu de bout en bout.
PCT/CN2006/002730 2005-10-17 2006-10-17 Procede pour la realisation de transmission de flux de bout en bout et equipement de noeuds WO2007045163A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CNB2005101090561A CN100486219C (zh) 2005-10-17 2005-10-17 一种实现端到端的流传输方法
CN200510109056.1 2005-10-17

Publications (1)

Publication Number Publication Date
WO2007045163A1 true WO2007045163A1 (fr) 2007-04-26

Family

ID=37962195

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2006/002730 WO2007045163A1 (fr) 2005-10-17 2006-10-17 Procede pour la realisation de transmission de flux de bout en bout et equipement de noeuds

Country Status (2)

Country Link
CN (1) CN100486219C (fr)
WO (1) WO2007045163A1 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2010094595A1 (fr) * 2009-02-20 2010-08-26 Thomson Licensing Réservation de ressource synchronisée dans le temps sur des réseaux à commutation de paquets
FR2958490B1 (fr) * 2010-03-31 2012-03-09 Alcatel Lucent Procede pour controler l'etablissement d'une connexion dans un reseau de transport
CN103281252B (zh) * 2013-05-14 2017-04-26 华为技术有限公司 一种基于多路径传输的报文流量控制方法和装置
CN113395735B (zh) * 2020-03-11 2023-07-07 华为技术有限公司 一种报文传输方法、装置和网络设备

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000216818A (ja) * 1999-01-22 2000-08-04 Chokosoku Network Computer Gijutsu Kenkyusho:Kk ネットワ―ク資源予約方法
WO2002084427A2 (fr) * 2001-04-16 2002-10-24 Nokia Corporation Procede et appareil permettant l'acheminement efficace de paquets de noeuds mobiles
CN1691636A (zh) * 2004-04-26 2005-11-02 华为技术有限公司 流状态建立的方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000216818A (ja) * 1999-01-22 2000-08-04 Chokosoku Network Computer Gijutsu Kenkyusho:Kk ネットワ―ク資源予約方法
WO2002084427A2 (fr) * 2001-04-16 2002-10-24 Nokia Corporation Procede et appareil permettant l'acheminement efficace de paquets de noeuds mobiles
CN1691636A (zh) * 2004-04-26 2005-11-02 华为技术有限公司 流状态建立的方法

Also Published As

Publication number Publication date
CN100486219C (zh) 2009-05-06
CN1953415A (zh) 2007-04-25

Similar Documents

Publication Publication Date Title
EP3528440B1 (fr) Procédé et système de sélection de trajet, noeud d'accélération de réseau et système d'accélération de réseau
JP3923863B2 (ja) リクエストルータ装置
US7702816B2 (en) Facilitating application synchronization with a reservation protocol at a sender without application receiver participation
JP4796157B2 (ja) ネットワーク通信における資源配分を実施するためのシステム及び方法
WO2014082538A1 (fr) Procédé et appareil de planification opérationnelle et dispositif de convergence
US20100074107A1 (en) Avoiding unnecessary rsvp-based preemptions
JP2004147334A (ja) 端末ベースのリソース予約プロトコル
JPH11163854A (ja) データ通信方法
JP2003078556A (ja) ネットワークシステム、ネットワーク中継装置、ネットワーク中継監視装置およびネットワーク運用方法
JP2010521857A (ja) サービス・フローを管理するためのポリシーの適用
JP2002232427A (ja) 帯域制御装置
WO2012116614A1 (fr) Procédé, nœud de réseau et système de distribution de volume de trafic de réseau
EP3078174B1 (fr) Regroupement de protocole sctp
WO2008037187A1 (fr) Procédé et dispositif de traitement des voies bgp
WO2011044396A2 (fr) Procédé et appareil d'assistance à des communications réseau
WO2012065531A1 (fr) Procédé, dispositif, et système pour effectuer une sélection de relais
US20220124040A1 (en) Traffic sending method and apparatus
WO2012065466A1 (fr) Procédé et dispositif permettant d'attribuer une bande passante de liaisons agrégées dans un réseau à commutation de paquets
WO2009056013A1 (fr) Procédé et système de commande de politique pour dispositif de couche deux
CN117201407B (zh) 一种应用感知的IPv6网络快速拥塞检测与避免方法
WO2007045163A1 (fr) Procede pour la realisation de transmission de flux de bout en bout et equipement de noeuds
Hashemi et al. 3CP: Coordinated congestion control protocol for named-data networking
WO2015014197A1 (fr) Méthode de sélection de trajet dans un scénario de charge de multidiffusion, et routeur
Subramaniam et al. Efficient buffer management protocol for multicast streaming in MANET
JP7298690B2 (ja) コンテンツ配信システム、マルチキャストユニキャスト／マルチキャストマルチキャスト変換装置、マルチキャストユニキャスト変換装置、コンテンツ配信方法及びコンテンツ配信プログラム

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: 06804949

Country of ref document: EP

Kind code of ref document: A1