WO2017084487A1 - 用于获得目标传输路径的方法和网络节点 - Google Patents
用于获得目标传输路径的方法和网络节点 Download PDFInfo
- Publication number
- WO2017084487A1 WO2017084487A1 PCT/CN2016/104055 CN2016104055W WO2017084487A1 WO 2017084487 A1 WO2017084487 A1 WO 2017084487A1 CN 2016104055 W CN2016104055 W CN 2016104055W WO 2017084487 A1 WO2017084487 A1 WO 2017084487A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- node
- network
- delay
- network node
- topology information
- Prior art date
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 213
- 238000000034 method Methods 0.000 title claims abstract description 53
- 230000001934 delay Effects 0.000 claims abstract description 15
- 238000005259 measurement Methods 0.000 claims description 91
- 238000013507 mapping Methods 0.000 claims description 19
- 230000008569 process Effects 0.000 description 8
- 230000006870 function Effects 0.000 description 7
- 238000004891 communication Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 230000007246 mechanism Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
- H04L43/106—Active monitoring, e.g. heartbeat, ping or trace-route using time related information in packets, e.g. by adding timestamps
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/70—Routing based on monitoring results
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/56—Queue scheduling implementing delay-aware scheduling
Definitions
- the present invention relates to the field of communications, and more particularly to a method and network node for obtaining a target transmission path.
- IP Network Protocol
- MPLS Multi-Protocol Label Switching
- the current IP or MPLS network has a Quality of Service (QoS) technology such as Differentiated Services (DiffServ), it can transmit the traffic on the same path according to different QoS, or according to QoS. Differently transmitted through different paths, but since it is essentially a packet-multiplexed network, it is still impossible to avoid high-priority packets from being queued or even blocked in the queue, causing the delay to exceed the threshold, and even In the worst case, packet loss occurs, and there is no guarantee that the end-to-end delay of the traffic of the low-latency service in the actual forwarding process does not exceed a certain threshold.
- QoS Quality of Service
- DiffServ Differentiated Services
- IS-IS Intermediate System to Intermediate System
- OSPF Open Shortest Path First
- the OAM mechanism is fixedly configured based on the MEP. It cannot be associated with a specific queue, nor can it measure the delay path of the entire network in a distributed manner, and its delay measurement has its inherent defects.
- the service layer OAM enters the same way as the service. Queues, so the instantaneous length of the queue has an impact on the delay measurement; the link layer OAM cannot measure the node dwell time.
- the main purpose is to measure the actual delay of the service, and adopt the service-associated channel, which is inherently insufficient for obtaining the path delay a priori.
- the present invention provides a method and network node for obtaining a target transmission path, which helps the target transmission path to meet the service demand for delay.
- a method for obtaining a target transmission path comprising: obtaining, by a first network node in the network domain, between an ingress node and an egress node in the network domain Topology information of a plurality of network nodes included in each path, the topology information including a physical link delay between two adjacent network nodes of the plurality of network nodes, and each of the plurality of network nodes a node dwell time of the node; the first network node obtains a transmission delay of each path between the ingress node and the egress node according to the topology information, where a transmission delay of each path includes the path The sum of the physical link delay between the adjacent two network nodes and the node dwell time of the plurality of network nodes; the first network node determines the ingress node according to the transmission delay of each path The destination transmission path between the egress nodes.
- each network in a network domain The node measures the physical link delay and the node dwell time between the neighboring nodes, and the topology information enables each network node to obtain the physical link delay and the node dwell time between other network nodes, thereby determining
- the target transmission path that meets the delay requirement in the network domain is transmitted, and the low-latency service packet is transmitted through the target, so that the transmission of the low-latency service in the network can be ensured to meet the delay requirement, and the entry node to the egress node in the network can be Multiple low-latency paths between them are more fully utilized to improve the reliability of transmitting low-latency services.
- the method further includes: obtaining, by the first network node, topology information of each network node in the network domain, where topology information of each network node includes the network domain phase a physical link delay between two adjacent network nodes, and a node dwell time of each network node in the network domain; the first network node obtains an ingress node and an egress node in the network domain according to the topology information
- the transmission delay of each path, the transmission delay of each path includes the sum of the physical link delay between two adjacent network nodes on each path and the node dwell time of each network node
- the first network node determines a target transmission path between the ingress node and the egress node according to a transmission delay of each path.
- the topology information includes first topology information, where the first network node in the network domain obtains an ingress node and an egress node in the network domain.
- the topology information of the multiple network nodes included in each path includes: obtaining, by the first network node, a first physical link delay in the first topology information, where the first physical link delay is the first a link delay between a network node and an adjacent first neighbor node; the first network node obtains a node camp time of the first network node in the first topology information.
- the topology information includes second topology information, where the first network node in the network domain obtains an ingress node and an egress node in the network domain.
- the topology information of the multiple network nodes included in each path includes: the first network node receives the second topology information sent by the second network node of the multiple network nodes, where the second topology information includes the a second physical link delay between the second network node and a second neighboring node of the plurality of network nodes, and a node dwell time of the second network node, the second neighboring node being the second network The neighbor node of the node.
- the first network node sends the first topology information to the second network node, so that the second network node is configured according to the first A topology information that determines the target transmission path.
- the first network node obtains a node camp time of the first network node in the first topology information, including: the first Obtaining, by the network node, a load of the first network node; the first network node acquiring, according to the load and the mapping table, a node resident time of the first network node, where the mapping table includes a load and a node resident of the first network node The correspondence between time.
- the first network node obtains a first physical link delay in the first topology information, including: the first network node Receiving a delay measurement packet directly sent by the first neighboring node, where the delay measurement packet includes a sending timestamp of the first neighboring node sending the delay measurement packet; and the first network node receives the packet according to receiving the delay measurement packet The timestamp and the transmission timestamp in the delay measurement packet obtain the first physical link delay between the first network node and the first neighbor node.
- the first network node obtains a first physical link delay in the first topology information, including: the first network node Receiving, by the first neighboring node, a plurality of delay measurement packets, where each of the plurality of delay measurement packets includes a transmission timestamp of the first neighboring node sending the delay measurement packet; Obtaining, by the first network node, a plurality of physics between the first network node and the first neighbor node according to the receiving timestamp of receiving each delay measurement packet and the sending timestamp in the each delay measurement packet The link delay is performed; the first network node performs statistics on the multiple physical link delays to determine the first physical link delay.
- the target transmission path is used to transmit a low-latency service packet in the low-latency packet queue, and the transmission delay of the target transmission path is satisfied.
- the latency requirement for this low latency traffic packet is satisfied.
- the first network node determines, according to the transmission delay of each path, the target transmission path, including: A network node determines, as the target transmission path, a path corresponding to a minimum transmission delay in all paths between the ingress node and the egress node, and transmits a low-delay service packet through the target transmission path, thereby ensuring low-latency services in the network.
- the transmission in the middle meets the delay requirement.
- the first network node determines the target transmission path according to the transmission delay of each path, including: the first network node One of the plurality of paths in which the transmission delay meets the delay requirement in all paths between the ingress node and the egress node is determined as the target transmission path.
- the first network node determines the target transmission path according to the transmission delay of each path, including: the first network node Determining at least two of the plurality of paths in which the transmission delay meets the delay requirement of the low-latency service packet in the path between the ingress node and the egress node is determined as the target transmission path, in the at least two paths Each path transmits each low-latency service packet in the low-latency packet queue separately, thereby improving the reliability of transmitting low-latency services.
- the first network node determines the target transmission path according to the transmission delay of each path, including: the first network node At least two of the plurality of paths in the path between the ingress node and the egress node that meet the delay requirement of the low-latency service packet are determined as the target transmission path, and the at least two paths are loaded by the load.
- the low-latency service packet in the low-latency packet queue is transmitted in a shared manner, so that multiple low-latency paths between the ingress node and the egress node in the network can be more fully utilized, and the reliability of transmitting low-delay services is improved.
- the first network node is the ingress node or the egress node.
- the second network node is the ingress node or the egress node.
- a network node for obtaining a target transmission path, where the network node is a first network node in a network domain, and the first network node includes:
- a first obtaining unit configured to obtain each path between the ingress node and the egress node in the network domain Topology information of a plurality of network nodes included in the path, the topology information including a physical link delay between two adjacent network nodes of the plurality of network nodes, and each of the plurality of network nodes The node dwell time of the network node;
- a second obtaining unit configured to obtain, according to the topology information, a transmission delay of each path between the ingress node and the egress node, where a transmission delay of each path includes each path The sum of the physical link delay between the adjacent two network nodes and the node dwell time of the plurality of network nodes;
- a determining unit configured to determine, according to the transmission delay of each path, a target transmission path between the ingress node and the egress node.
- the topology information includes first topology information
- the first obtaining unit is specifically configured to:
- the first physical link delay is a link delay between the first network node and a neighboring first neighbor node, where The first neighbor node and the first network node belong to the plurality of network nodes;
- the topology information includes second topology information
- the first obtaining unit is specifically configured to:
- the second topology information includes the second network node and a second neighbor node of the multiple network nodes a second physical link delay, and a node dwell time of the second network node, the second neighbor node being a neighbor node of the second network node.
- the first obtaining unit is specifically configured to:
- the mapping table includes a correspondence between the load of the first network node and the dwell time of the node.
- the first obtaining unit is specifically configured to:
- the first obtaining unit is specifically configured to:
- each of the plurality of delay measurement packets includes sending, by the first neighbor node, the sending of each delay measurement packet Timestamp
- the target transmission path is used to transmit a low-delay service packet in a low-latency packet queue And the transmission delay of the target transmission path satisfies the delay requirement of the low-latency service packet.
- the determining unit is specifically configured to:
- the network node for obtaining the target transmission path provided by the second aspect may be used to perform the above The method of any of the first aspect or any of the possible implementations of the first aspect.
- the network node comprises means for performing the method of any of the above-described first aspect or any of the possible implementations of the first aspect.
- a network node for obtaining a target transmission path comprising: a storage unit and a processor, the storage unit is configured to store an instruction, the processor is configured to execute the instruction stored by the memory, and when the processor When the instructions stored by the memory are executed, the execution causes the processor to perform the method of the first aspect or any of the possible implementations of the first aspect.
- a computer readable medium for storing a computer program comprising instructions for performing the method of the first aspect or any of the possible implementations of the first aspect.
- FIG. 1 is a schematic diagram of a network domain according to an embodiment of the present invention.
- FIG. 2 is a flowchart of a method for obtaining a target transmission path according to an embodiment of the present invention.
- FIG. 3 is a schematic diagram of forwarding scheduling of a delay measurement packet according to an embodiment of the present invention.
- FIG. 4 is a schematic diagram of a network node for obtaining a target transmission path according to an embodiment of the present invention.
- FIG. 5 is another schematic diagram of a network node for obtaining a target transmission path according to an embodiment of the present invention.
- FIG. 1 can be seen as a partial schematic diagram of a metropolitan area network.
- the network domain here can be connected to the physical topology and run all the same routing protocol. a collection of network nodes; and the network domain can support embodiments of the present invention The described route implementation method.
- SRC source end
- DST destination end
- PE1 and PE2 multiple intermediate network nodes, that is, network node 1 are included.
- these network nodes constitute a plurality of transmission paths between PE1 and PE2, wherein PE1 and PE2 are edge nodes, that is, Provider Edge (PE) devices.
- PE Provider Edge
- each of the edge nodes PE1 and PE2 and each of the intermediate nodes in the intermediate node is configured with a plurality of queues to buffer the received packets.
- the commonly used queues have priority.
- Level queues, fair queues, and weighted fair queues, etc. each network node can be arranged in a different queue according to the priority of the received packets.
- the total length of the packet queue and the specific scheduling mechanism are related to the actual configuration of the device implementation and operation, and the present invention is not limited thereto.
- the low-latency service packet is mainly required for the transmission delay.
- the network node acquires the low-latency service packet, the network node generally arranges the packet into the high-priority packet queue.
- the transmission delay on the transmission path of the packet queue from the ingress node to the egress node is less than or equal to a preset value, for example, the transmission path from the ingress node to the egress node may be a path from PE1 to PE2.
- the method 100 includes:
- the first network node in the network domain obtains topology information of multiple network nodes included in each path between the ingress node and the egress node in the network domain, where the topology information includes two adjacent ones of the multiple network nodes. Physical link delay between network nodes, and node dwell time of each of the plurality of network nodes;
- the first network node obtains the ingress node and the egress node according to the topology information. a transmission delay between each path, the transmission delay of each path including a physical link delay between two adjacent network nodes on each path and a node resident of the plurality of network nodes The sum of time;
- the first network node determines, according to the transmission delay of each path, a target transmission path between the ingress node and the egress node.
- each network node in the network domain can support a protocol similar to high-precision clock synchronization, and can maintain high-precision time synchronization in the network for a long time.
- the first network node can measure the physical link delay between the network node and the neighboring node, and can also measure the first The node dwell time of a network node. After each network node measures the physical link delay and the node dwell time, the physical link delay between each network node and the neighbor node and the node dwell time of each network node can be sent to the network information through the topology information.
- the first network node may receive a physical link delay sent by other network nodes and a node camp time of each network node, and may also be the first network node and the neighbor node The physical link delay and the node dwell time of the first network node are sent to other nodes.
- the first network node can determine a target transmission path between the ingress node and the egress node in the network domain according to the physical link delay of each node in the network domain and the dwell time of the node, and the target transmission path satisfies the delay requirement. Can be used to transmit low latency traffic packets.
- each network node in the network domain measures a physical link delay and a node camp time between the neighbor nodes, and makes each network node through the topology information.
- the physical link delay between other nodes and the node dwell time of other nodes can be obtained, thereby determining a target transmission path that meets the delay requirement in the network domain, and transmitting a low-delay service packet through the target, thereby ensuring The transmission of the low-latency service in the network satisfies the delay requirement, and can more fully utilize multiple low-latency paths between the ingress node and the egress node in the network, thereby improving the reliability of transmitting low-latency services.
- the first network node in the network domain may obtain topology information of multiple network nodes included in each path between the ingress node and the egress node in the network domain, where the topology information includes the a physical link delay between two adjacent network nodes of the plurality of network nodes, and a node dwell time of each of the plurality of network nodes, wherein the first network node is in a network domain
- Each of the network nodes may include a plurality of network nodes on each path between the ingress node and the egress node, and the plurality of network nodes included on each path include an ingress node and an egress node.
- the first network node may further obtain topology information of each network node of the other network nodes included in the network domain, where the topology information includes a physical link delay of the network node and the neighbor network node.
- the node dwell time of each network node may be obtained.
- the topology information obtained by the first network node may include the first topology information, and may further include the second topology information.
- the first topology information is obtained by the first network node, where the first topology information includes a first physical link delay between the first network node and the first neighbor node, and the first network node a node dwell time, the first neighbor node is a neighbor node of the first network node, and also belongs to a path between the ingress node and the egress node; and the second topology information is sent by the first network node to the second network node.
- the second network node is a network node other than the first network node in the network domain, and the second network node also belongs to a path between the ingress node and the egress node, where the second topology information includes the second a second physical link delay between the network node and the second neighbor node, and a node dwell time of the second network node, the second neighbor node is Two neighbor nodes of the network node, and likewise belongs to the path between the ingress node and egress node.
- the first network node may not obtain the first topology information of the first network node, but only obtain the between the ingress node and the egress node.
- the topology information of the network node included in each path that is, the second topology information of the second network node on the path between the ingress node and the egress node.
- the first network node may also obtain the first topology information of the first network node, and may also obtain the relationship between the ingress node and the egress node.
- the topology information of the network node included in each path can also obtain topology information of other network nodes that do not belong to the path between the ingress node and the egress node, that is, the first network.
- the node can obtain topology information of each network node in the network domain, so that the first network node can obtain the path included in each path between the ingress node and the egress node, regardless of changes in the ingress node and the egress node.
- the topology information of the network node avoids repeated measurement and acquisition of topology information, but the embodiment of the present invention is not limited thereto.
- the first network node obtains the first topology information as an example, and the first network node is any one of the network nodes in the network domain.
- the first network node may perform physical link delay measurement by sending a delay measurement packet, that is, the first network node may obtain the first physical link delay between the first network node and its neighbor node by using the delay measurement packet.
- the first network node receives the delay measurement packet sent by the first neighbor node, where the first neighbor node is adjacent to the first network node, and the delay measurement packet includes the first neighbor node sending the delay measurement packet.
- the first network node may obtain the physical link between the first network node and the first neighboring node according to the receiving timestamp of receiving the delay measurement packet and the sending timestamp in the delay measurement packet.
- the delay measurement packet is sent by the first neighbor node directly to the first network node.
- the node 6 sends a delay measurement packet to the node 4, where the delay measurement packet includes a transmission timestamp t1 at which the node 6 transmits the delay measurement packet, and the node 4 receives the delay measurement packet. Thereafter, the reception time stamp t2 is obtained, and according to the reception time stamp t2 and the transmission time stamp t1, the physical link delay between the node 6 and the node 4 can be obtained.
- the delay of the first network node to the first neighbor node may be seen.
- the delay from the first neighboring node to the first network node is equal, that is, the delay from the first network node to the first neighboring node is equal to the delay of the first neighboring node to the first network node; optionally, The delay of the first network node to the first neighboring node is regarded as not equal to the delay of the first neighboring node to the first network node, and the delay of the first network node to the first neighboring node may be separately measured, and the first The delay of the neighbor node to the first network node, the present invention is not limited thereto.
- the delay measurement packet can be inserted into the head of the low-latency service queue, thereby avoiding the impact of the queue itself, and the specific queuing delay within the same low-latency service queue can be ignored.
- the low-latency packet queue occupied by the low-latency service packet may be a high-priority queue, and the delay measurement packet may be located at the head of the low-latency packet queue, followed by other Priority queue, the invention is not limited to this.
- multiple delay measurement packets may be sent, and multiple measurements may be performed, and the results of the multiple measurements are counted. For example, the average value is calculated, or the expected value is calculated, or the maximum value is taken, or the minimum value is taken, etc., to obtain the physical link delay between the two adjacent network nodes.
- the first neighboring node sends multiple delay measurement packets to the first network node, and may send the multiple delay measurement packets according to the same time interval; or send the multiple according to a random manner, that is, the time interval is a random number.
- the delay measurement packet is subjected to measurement of multiple physical link delays, and the present invention is not limited thereto.
- the packet delay measurement packet on an unloaded network node may have a very small dwell time, and in one On a network node that is close to full load, it may be large. Therefore, in order to more accurately reflect the dwell time of the packet, the dwell time of each network node can be obtained by querying the mapping table between the node load and the dwell time.
- the node dwell time of the network node can also be determined by the network topology, the link medium and length, and the device implementation of the node itself.
- a mapping table between the node load and the dwell time of the network node may be pre-established in each network node in the network domain, or the mapping table may be obtained by online measurement, and the present invention is not limited thereto.
- the mapping table of load and dwell time in the network node is: (0%, 0ms); (10%, 0.01ms); (20%, 0.05ms); ... (50% , 0.5ms)....
- the load of the network node is 20%
- the camping time of the network node is 0.05 ms.
- the network node can obtain the load status in the current state, that is, the network boundary can be obtained through the query mapping table.
- the node dwell time, wherein the load in the current state can take the load at any time, or take the average value of the load in a certain period of time, or set the load to take a certain time, and the embodiment of the present invention is not limited to this.
- each network node may directly send the node dwell time of obtaining the network node to another network node, or may also send the mapping table of the load and dwell time of the network node to other network nodes. And sending the load condition of the network node, the other network node can obtain the node dwell time of the network node by querying the mapping table through the load condition of the network node, and the present invention is not limited thereto.
- each network node in the network domain may obtain a physical link delay between the neighboring nodes and a node dwell time of each of the network nodes.
- the first network node may obtain topology information, where the topology information may include first topology information and second topology information, where the first topology information is Obtaining, by the network node, the first topology information includes a first physical link delay between the first network node and the first neighboring node, and a node camping time of the first network node, where the first neighboring node is a neighboring node of the first network node; and the second topology information is sent by the first network node to the second network node, where the second network node is any network node other than the first network node in the network domain, the first The second topology information includes a second physical link delay between the second network node and the second neighbor node, and a node dwell time of the second network node, where the
- node 1 obtains three physical link delays with node 3, node 4, and PE1, respectively, and node 1 also obtains node resident of node 1.
- the node 1 can send topology information to its neighbor node 4, which includes the three physical link delays obtained by the node 1 and the node dwell time of the node 1.
- the node 4 may forward the topology information, so that each network node can receive the topology information of the node 1, and the node 4 can also send the node 4 to other nodes.
- the topology information of the node 4 may include the physical link delay of the node 4 and each neighbor node, and the node camp time of the node 4, then each network in the network domain The node can obtain the topology information of the node 4. And so on, each node in the network domain can obtain topology information of all network nodes in the network domain.
- the network node transmits the topology information
- the extended routing protocol can be extended.
- the routing protocol can utilize existing protocols such as OSPF and IS-IS, and only needs to extend a new routing capability and can The physical link delay and the node dwell time parameter corresponding to each measured neighbor node may be carried, and routing information is exchanged with other network nodes in the network domain.
- the first network node obtains a transmission delay of each path between the ingress node and the egress node in the network domain according to the topology information, where a transmission delay of each path includes a phase on each path.
- each network node in the network domain can acquire topology information of all network nodes in the network domain, and each node in the network domain, or a part of nodes in the network domain, or any one of the network domains.
- the node, or the ingress node or the egress node in the network domain can calculate the transmission delay of each path between the ingress node and the egress node in the network domain, and the present invention is not limited thereto.
- the transmission delay of the path is equal to PE1 and the node. 1.
- the transmission delay of each path in the network domain is calculated in sequence. For example, as shown in FIG. 1 , if there are 12 paths between the ingress node PE1 and the egress node PE2, any network node in the network domain can calculate each The transmission delay of the paths.
- the first network node determines a target transmission path between the ingress node and the egress node according to the transmission delay of each path.
- the first network node in the network domain may determine, according to the transmission delay of each path between the ingress node and the egress, that the transmission path that meets the delay requirement is the target transmission path.
- the target transmission path may be A path can also be transmitted together for multiple paths that meet the delay requirement.
- the transmission path between the ingress node and the egress node meets a delay requirement, and the delay requirement may be that the transmission delay is less than or equal to the low delay service packet.
- a path with a transmission delay less than or equal to the preset value may be determined as a target transmission path, and the target transmission path is used to transmit a low delay queue. Low latency business grouping.
- the transmission path with the smallest transmission delay may be determined as the target transmission path.
- the target transmission path For example, as shown in Figure 1, if PE1 is the ingress node and PE2 is the egress node, there are 12 paths between PE1 and PE2, calculate the transmission delay of each path, and determine the transmission path with the smallest transmission delay as the destination transmission path.
- the low-latency service packet is transmitted through the target transmission path, so that the transmission of the low-latency service in the network can be guaranteed to meet the delay requirement.
- one of the at least two transmission paths may be arbitrarily selected as the target transmission path.
- the at least two transmission paths may be determined as the target transmission path, and the low delay is transmitted on each target transmission path.
- Each low-latency traffic packet in the packet queue For example, as shown in Figure 1, if PE1 is the ingress node and PE2 is the egress node, there are 12 paths between PE1 and PE2, and the transmission delay of each path is calculated. It is assumed that the transmission delay meets the delay requirement. Three, PE1-1-3-6-PE2, PE1-1-4-7-PE2, and PE1-2-4-6-PE2, respectively, the three transmission paths can be determined as the target transmission path, which will be low. Each low-latency service packet in the delayed packet queue is transmitted in the three paths, thereby improving the reliability of transmitting low-latency services.
- the at least two transmission paths may be determined as the target transmission path, and load sharing is performed on each target transmission path.
- the way to transmit low-latency traffic packets in a low-latency packet queue For example, as shown in Figure 1, if PE1 is the ingress node and PE2 is the egress node, there are 12 paths between PE1 and PE2, and the transmission delay of each path is calculated. It is assumed that the transmission delay meets the delay requirement.
- the three transmission paths can be determined as the target transmission path, according to load sharing Way, follow
- the load distributes the low-latency service packets in the low-latency packet queue to the three target transmission paths according to the load, that is, respectively transmits a part of the low-latency service packets and three target transmission paths in each of the three target transmission paths.
- the transmission of the low-latency service packet is completed together, so that multiple low-latency paths between the ingress node and the egress node in the network can be more fully utilized, and the reliability of transmitting low-delay services is improved.
- the size of the sequence numbers of the above processes does not mean the order of execution, and the order of execution of each process should be determined by its function and internal logic, and should not be directed to the embodiments of the present invention.
- the implementation process constitutes any limitation.
- each network node in the network domain measures a physical link delay and a node camp time between the neighbor nodes, and makes each network node through the topology information.
- the physical link delay between other nodes and the node dwell time of other nodes can be obtained, thereby determining a target transmission path that meets the delay requirement in the network domain, and transmitting a low-delay service packet through the target, thereby ensuring The transmission of the low-latency service in the network satisfies the delay requirement, and can more fully utilize multiple low-latency paths between the ingress node and the egress node in the network, thereby improving the reliability of transmitting low-latency services.
- a method for obtaining a target transmission path according to an embodiment of the present invention is described in detail above with reference to FIG. 1 to FIG. 3, and a method for obtaining a target transmission path according to an embodiment of the present invention will be described below with reference to FIGS. 4 to 5.
- Network node
- the network node 200 for obtaining a target transmission path is a first network node in a network domain, and the network node 200 may include:
- a first obtaining unit 210 configured to obtain topology information of the network domain, where the topology information includes a physical link delay between each two network nodes, and the multiple networks The node dwell time of each network node in the node;
- a second obtaining unit 220 configured to obtain, according to the topology information, a transmission delay of each path between the ingress node and the egress node of the multiple network nodes, where a transmission delay of each path includes the foregoing The sum of the physical link delay between the various network nodes on the strip path and the node dwell time of the respective network nodes;
- the determining unit 230 is configured to determine a target transmission path according to the transmission delay of each path.
- each network node in the network domain measures the physical link delay and the node dwell time with the neighbor node, and passes through the topology information.
- Each network node can obtain the physical link delay between other nodes and the node dwell time of other nodes, thereby determining a target transmission path that meets the delay requirement in the network domain, and transmitting a low delay through the target transmission path.
- Service grouping which can ensure that the transmission of low-latency services in the network meets the delay requirement, and can more fully utilize multiple low-latency paths between the ingress node and the egress node in the network, thereby improving the transmission of low-latency services. reliability.
- the first obtaining unit 210 is further configured to: obtain topology information of each network node in the network domain, where the topology information of each network node includes a physical link between two adjacent network nodes in the network domain. Deferred, and, the node dwell time of each network node in the network domain.
- the topology information includes the first topology information
- the first obtaining unit 210 is specifically configured to: obtain a first physical link delay in the first topology information, where the first physical link delay is the first a link delay between a network node and an adjacent first neighbor node, the first neighbor node and the first network node belong to the plurality of network nodes; obtaining the first network node in the first topology information Node dwell time.
- the topology information includes second topology information
- the first obtaining unit 210 is configured to: receive the second topology information sent by the second network node of the multiple network nodes, where the second topology information includes the a second physical link delay between the second network node and a second neighboring node of the plurality of network nodes, and a node dwell time of the second network node, the second neighboring node being the second network The neighbor node of the node.
- the first obtaining unit 210 is specifically configured to: obtain a load of the first network node; acquire, according to the load and a mapping table, a node camping time of the first network node, where the mapping table includes the first network The correspondence between the load of the node and the dwell time of the node.
- the first obtaining unit 210 is configured to: receive a delay measurement packet directly sent by the first neighbor node, where the delay measurement packet includes a sending timestamp of the first neighbor node sending the delay measurement packet; Receiving a time stamp based on receiving the delay measurement packet and the delay measurement packet The sending timestamp obtains the first physical link delay between the first network node and the first neighboring node.
- the first obtaining unit 210 is configured to: receive multiple delay measurement packets directly sent by the first neighboring node, where each of the plurality of delay measurement packets includes the first neighbor node Transmitting a transmission timestamp of each delay measurement packet; obtaining the first network node and the first according to the reception timestamp of receiving each delay measurement packet and the transmission timestamp in the each delay measurement packet A plurality of physical link delays between the neighboring nodes; the multiple physical link delays are counted to determine the first physical link delay.
- the target transmission path is used to transmit the low-latency service packet in the low-latency packet queue, and the transmission delay of the target transmission path satisfies the delay requirement of the low-latency service packet.
- the determining unit 230 is specifically configured to: determine, as the target transmission path, a path corresponding to a minimum transmission delay among all paths between the ingress node and the egress node.
- the determining unit 230 is configured to determine, as the target transmission path, one of the multiple paths in the path between the ingress node and the egress node that meets the delay requirement.
- the determining unit 230 is specifically configured to determine, by using at least two paths, that the transmission delay in all paths between the ingress node and the egress node meets a delay requirement of the low-latency service packet, For the target transmission path, each of the at least two paths respectively transmits each low-latency traffic packet in the low-latency packet queue.
- the determining unit 230 is specifically configured to determine, by using at least two paths, that the transmission delay in all paths between the ingress node and the egress node meets a delay requirement of the low-latency service packet, For the target transmission path, the at least two paths transmit low-latency service packets in the low-latency packet queue in a load-sharing manner.
- the first network node is the ingress node or the egress node.
- the second network node is the ingress node or the egress node.
- the network node 200 herein is embodied in the form of a functional unit.
- the term "unit” herein may refer to an Application Specific Integrated Circuit (ASIC), Electronic circuitry, a processor for executing one or more software or firmware programs (eg, a shared processor, a proprietary processor, or a group processor, etc.) and memory, merge logic, and/or other suitable support for the described functionality Component.
- ASIC Application Specific Integrated Circuit
- the network node 200 may be specifically the first network node in the above embodiment, and the above operations and/or functions of the respective units in the network node 200 are respectively implemented in order to implement the map. The corresponding flow of each method in 2, for the sake of brevity and avoiding repetition, will not be repeated here.
- each network node in the network domain measures the physical link delay and the node dwell time with the neighbor node, and passes through the topology information.
- Each network node can obtain the physical link delay between other nodes and the node dwell time of other nodes, thereby determining a target transmission path that meets the delay requirement in the network domain, and transmitting a low delay through the target transmission path.
- Service grouping which can ensure that the transmission of low-latency services in the network meets the delay requirement, and can more fully utilize multiple low-latency paths between the ingress node and the egress node in the network, thereby improving the transmission of low-latency services. reliability.
- an embodiment of the present invention further provides a network node 300 for obtaining a target transmission path, where the network node is a first network node in a network domain that includes multiple network nodes, and the network node 300 includes Processor 310, memory 320, and bus system 330.
- the processor 310 and the memory 320 are connected by a bus system 330 for storing instructions for executing instructions stored by the memory 320.
- the network node 300 shown in FIG. 5 may further include a communication interface (not shown in FIG. 5) that communicates with the outside.
- the processor 310 can communicate with an external device through a communication interface.
- the memory 320 stores program code, and the processor 310 can call the program code stored in the memory 320 to perform the following operations: obtaining topology information of the network domain, the topology information including each of the plurality of network nodes a physical link delay between, and a node dwell time of each of the plurality of network nodes; obtaining, between the entry node and the egress node, the plurality of network nodes according to the topology information Transmission delay of each path, the transmission delay of each path includes a sum of a physical link delay between each network node on each path and a node dwell time of each network node; The transmission delay of each path, determining the target Transmission path.
- each network node in the network domain measures the physical link delay and the node dwell time with the neighbor node, and passes through the topology information.
- Each network node can obtain the physical link delay between other nodes and the node dwell time of other nodes, thereby determining a target transmission path that meets the delay requirement in the network domain, and transmitting a low delay through the target transmission path.
- Service grouping which can ensure that the transmission of low-latency services in the network meets the delay requirement, and can more fully utilize multiple low-latency paths between the ingress node and the egress node in the network, thereby improving the transmission of low-latency services. reliability.
- the processor 310 may be a central processing unit (CPU), and the processor 310 may also be other general-purpose processors, digital signal processors (DSPs), and dedicated processors. Integrated circuit (ASIC), off-the-shelf programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware component, etc.
- the general purpose processor may be a microprocessor or the processor or any conventional processor or the like.
- the memory 320 can include read only memory and random access memory and provides instructions and data to the processor 310. A portion of the memory 320 may also include a non-volatile random access memory. For example, the memory 320 can also store information of the device type.
- the bus system 330 may include a power bus, a control bus, a status signal bus, and the like in addition to the data bus. However, for clarity of description, various buses are labeled as bus system 330 in the figure.
- each step of the foregoing method may be completed by an integrated logic circuit of hardware in the processor 310 or an instruction in a form of software.
- the steps of the method disclosed in the embodiments of the present invention may be directly implemented as a hardware processor, or may be performed by a combination of hardware and software modules in the processor.
- the software module can be located in a conventional storage medium such as random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, and the like.
- the storage medium is located in the memory 320, and the processor 310 reads the information in the memory 320 and combines the hardware to perform the steps of the above method. To avoid repetition, it will not be described in detail here.
- the processor 310 is further configured to: obtain each network in the network domain.
- the topology information of the network node, the topology information of each network node includes a physical link delay between two adjacent network nodes in the network domain, and a node camp time of each network node in the network domain.
- the topology information includes first topology information
- the processor 310 is further configured to: obtain a first physical link delay in the first topology information, where the first physical link delay is a link delay between the first network node and the adjacent first neighbor node, the first neighbor node and the first network node belong to the multiple network nodes; obtaining the first network in the first topology information The node's node dwell time.
- the topology information includes second topology information
- the processor 310 is further configured to: receive the second topology information sent by the second network node of the multiple network nodes, where the second topology information is And including a second physical link delay between the second network node and a second neighboring node of the plurality of network nodes, and a node dwell time of the second network node, where the second neighbor node is the first Two neighbor nodes of the network node.
- the processor 310 is further configured to: obtain a load of the first network node; acquire, according to the load and a mapping table, a node camp time of the first network node, where the mapping table includes the first The correspondence between the load of a network node and the dwell time of a node.
- the processor 310 is further configured to: receive a delay measurement packet directly sent by the first neighbor node, where the delay measurement packet includes a sending time of the first neighbor node sending the delay measurement packet. And obtaining the first physical link delay between the first network node and the first neighboring node according to the receiving timestamp of receiving the time delay measurement packet and the sending timestamp in the time delay measurement packet.
- the processor 310 is further configured to: receive, by the first neighbor node, a plurality of delay measurement packets, where each of the plurality of delay measurement packets includes the first And sending, by the neighboring node, a sending timestamp of each time delay measurement packet; obtaining the first network node according to the receiving timestamp of receiving each delay measurement packet and the sending timestamp in the each time delay measurement packet A plurality of physical link delays between the first neighboring nodes; performing statistics on the multiple physical link delays to determine the first physical link delay.
- the target transmission path is used to transmit a low delay packet queue.
- a low-latency service packet, and the transmission delay of the target transmission path satisfies the delay requirement of the low-latency service packet.
- the processor 310 is further configured to determine, as the target transmission path, a path that minimizes a transmission delay in all paths between the ingress node and the egress node.
- the processor 310 is further configured to determine, by using one of the multiple paths in the path between the ingress node and the egress node that the transmission delay meets the delay requirement, to determine the target transmission. path.
- the processor 310 is further configured to: at least two of the multiple paths in which the transmission delay in all paths between the ingress node and the egress node meets the delay requirement of the low-latency service packet.
- the strip path is determined to be the target transmission path, and each of the at least two paths respectively transmits each low-latency service packet in the low-latency packet queue.
- the processor 310 is further configured to: at least two of the multiple paths in which the transmission delay in all paths between the ingress node and the egress node meets the delay requirement of the low-latency service packet.
- the path is determined as the target transmission path, and the at least two paths transmit the low-latency service packet in the low-latency packet queue in a load-sharing manner.
- the first network node is the ingress node or the egress node.
- the second network node is the egress node. If the first network node is an egress node, the second network node is the ingress node.
- the network node 300 for obtaining a target transmission path may correspond to the network node 200 for obtaining a target transmission path in the embodiment of the present invention, and may correspond to performing according to an embodiment of the present invention.
- the above-described and other operations and/or functions of the respective entities in the method 100 and the respective modules in the network node 300 for obtaining the target transmission path are respectively implemented in order to implement the respective processes of the respective methods in FIG. 2, for the sake of brevity, Let me repeat.
- each network node in the network domain measures the physical link delay and the node dwell time with the neighbor node, and passes through the topology information.
- Network nodes can obtain physical link delays between other nodes as well as The node dwell time of other nodes, thereby determining the target transmission path that meets the delay requirement in the network domain, and transmitting the low-latency service packet through the target transmission path, thereby ensuring that the transmission of the low-latency service in the network satisfies the delay It is required and can make more full use of multiple low-latency paths between the ingress node and the egress node in the network, thereby improving the reliability of transmitting low-latency services.
- the disclosed systems, devices, and methods may be implemented in other manners.
- the device embodiments described above are merely illustrative.
- the division of the unit is only a logical function division.
- there may be another division manner for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed.
- the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.
- the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
- each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
- the function is implemented in the form of a software functional unit and sold or used as a standalone product It can be stored in a computer readable storage medium.
- the technical solution of the present invention which is essential or contributes to the prior art, or a part of the technical solution, may be embodied in the form of a software product, which is stored in a storage medium, including
- the instructions are used to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present invention.
- the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like. .
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Health & Medical Sciences (AREA)
- Cardiology (AREA)
- General Health & Medical Sciences (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims (16)
- 一种用于获得目标传输路径的方法,其特征在于,所述方法应用于网络域中,所述方法包括:所述网络域中的第一网络节点获得所述网络域中入口节点与出口节点之间每条路径上包括的多个网络节点的拓扑信息,所述拓扑信息包括所述多个网络节点中相邻两个网络节点之间的物理链路时延,和,所述多个网络节点中每个网络节点的节点驻留时间;所述第一网络节点根据所述拓扑信息,获得所述入口节点和所述出口节点之间所述每条路径的传输时延,所述每条路径的传输时延包括所述每条路径上的相邻两个网络节点之间的物理链路时延和所述多个网络节点的节点驻留时间之和;所述第一网络节点根据所述每条路径的传输时延,确定所述入口节点和所述出口节点之间的目标传输路径。
- 根据权利要求1所述的方法,其特征在于,所述拓扑信息包括第一拓扑信息,所述网络域中的第一网络节点获得所述网络域中入口节点和出口节点之间每条路径上包括的多个网络节点的拓扑信息包括:所述第一网络节点获得所述第一拓扑信息中的第一物理链路时延,所述第一物理链路时延为所述第一网络节点与相邻的第一邻居节点之间的链路时延;所述第一网络节点获得所述第一拓扑信息中的第一网络节点的节点驻留时间。
- 根据权利要求1或2所述的方法,其特征在于,所述拓扑信息包括第二拓扑信息,所述网络域中的第一网络节点获得所述网络域中入口节点和出口节点之间每条路径上包括的多个网络节点的拓扑信息,包括:所述第一网络节点接收所述多个网络节点中的第二网络节点发送的所述第二拓扑信息,所述第二拓扑信息包括所述第二网络节点与所述多个网络节 点中的第二邻居节点之间的第二物理链路时延,和,所述第二网络节点的节点驻留时间,所述第二邻居节点为所述第二网络节点的邻居节点。
- 根据权利要求2所述的方法,其特征在于,所述第一网络节点获得所述第一拓扑信息中的第一网络节点的节点驻留时间,包括:所述第一网络节点获得所述第一网络节点的负载;所述第一网络节点根据所述负载和映射表,获取所述第一网络节点的节点驻留时间,所述映射表包括所述第一网络节点的负载和节点驻留时间之间的对应关系。
- 根据权利要求2或4所述的方法,其特征在于,所述第一网络节点获得所述第一拓扑信息中的第一物理链路时延,包括:所述第一网络节点接收所述第一邻居节点直接发送的时延测量分组,所述时延测量分组包括所述第一邻居节点发送所述时延测量分组的发送时间戳;所述第一网络节点根据接收所述时延测量分组的接收时间戳与所述时延测量分组中的所述发送时间戳,获得所述第一物理链路时延。
- 根据权利要求2或4所述的方法,其特征在于,所述第一网络节点获得所述第一拓扑信息中的第一物理链路时延,包括:所述第一网络节点接收所述第一邻居节点直接发送的多个时延测量分组,所述多个时延测量分组中每个时延测量分组包括所述第一邻居节点发送所述每个时延测量分组的发送时间戳;所述第一网络节点根据接收所述每个时延测量分组的接收时间戳与所述每个时延测量分组中的所述发送时间戳,获得所述第一网络节点与所述第一邻居节点之间的多个物理链路时延;所述第一网络节点将所述多个物理链路时延进行统计,确定所述第一物理链路时延。
- 根据权利要求1至6中任一项所述的方法,其特征在于,所述目标传输路径用于传输低延迟分组队列中的低延迟业务分组,且所 述目标传输路径的传输时延满足所述低延迟业务分组的时延要求。
- 根据权利要求1至7中任一项所述的方法,其特征在于,所述第一网络节点根据所述每条路径的传输时延,确定目标传输路径,包括:所述第一网络节点将所述入口节点和所述出口节点之间所有路径中传输时延满足所述低延迟业务分组的时延要求的多条路径中的至少两条路径,确定为所述目标传输路径,所述至少两条路径按负载分担方式传输低延迟分组队列中的低延迟业务分组。
- 一种用于获得目标传输路径的网络节点,其特征在于,所述网络节点为网络域中的第一网络节点,所述第一网络节点包括:第一获得单元,用于获得所述网络域中入口节点与出口节点之间每条路径上包括的多个网络节点的拓扑信息,所述拓扑信息包括所述多个网络节点中相邻两个网络节点之间的物理链路时延,和,所述多个网络节点中每个网络节点的节点驻留时间;第二获得单元,用于根据所述拓扑信息,获得所述入口节点和所述出口节点之间所述每条路径的传输时延,所述每条路径的传输时延包括所述每条路径上的相邻两个网络节点之间的物理链路时延和所述多个网络节点的节点驻留时间之和;确定单元,用于根据所述每条路径的传输时延,确定所述入口节点和所述出口节点之间的目标传输路径。
- 根据权利要求9所述的网络节点,其特征在于,所述拓扑信息包括第一拓扑信息,所述第一获得单元具体用于:获得所述第一拓扑信息中的第一物理链路时延,所述第一物理链路时延为所述第一网络节点与相邻的第一邻居节点之间的链路时延,所述第一邻居节点与所述第一网络节点属于所述多个网络节点;获得所述第一拓扑信息中的第一网络节点的节点驻留时间。
- 根据权利要求9或10所述的网络节点,其特征在于,所述拓扑信息 包括第二拓扑信息,所述第一获得单元具体用于:接收所述多个网络节点中的第二网络节点发送的所述第二拓扑信息,所述第二拓扑信息包括所述第二网络节点与所述多个网络节点中的第二邻居节点之间的第二物理链路时延,和,所述第二网络节点的节点驻留时间,所述第二邻居节点为所述第二网络节点的邻居节点。
- 根据权利要求10所述的网络节点,其特征在于,所述第一获得单元具体用于:获得所述第一网络节点的负载;根据所述负载和映射表,获取所述第一网络节点的节点驻留时间,所述映射表包括所述第一网络节点的负载和节点驻留时间之间的对应关系。
- 根据权利要求10或12所述的网络节点,其特征在于,所述第一获得单元具体用于:接收所述第一邻居节点直接发送的时延测量分组,所述时延测量分组包括所述第一邻居节点发送所述时延测量分组的发送时间戳;根据接收所述时延测量分组的接收时间戳与所述时延测量分组中的所述发送时间戳,获得所述第一物理链路时延。
- 根据权利要求10或12所述的网络节点,其特征在于,所述第一获得单元具体用于:接收所述第一邻居节点直接发送的多个时延测量分组,所述多个时延测量分组中每个时延测量分组包括所述第一邻居节点发送所述每个时延测量分组的发送时间戳;根据接收所述每个时延测量分组的接收时间戳与所述每个时延测量分组中的所述发送时间戳,获得所述第一网络节点与所述第一邻居节点之间的多个物理链路时延;将所述多个物理链路时延进行统计,确定所述第一物理链路时延。
- 根据权利要求9至14中任一项所述的网络节点,其特征在于,所述目标传输路径用于传输低延迟分组队列中的低延迟业务分组,且所述目标传输路径的传输时延满足所述低延迟业务分组的时延要求。
- 根据权利要求9至15中任一项所述的网络节点,其特征在于,所述确定单元具体用于:将所述入口节点和所述出口节点之间所有路径中传输时延满足所述低延迟业务分组的时延要求的多条路径中的至少两条路径,确定为所述目标传输路径,所述至少两条路径按负载分担方式传输低延迟分组队列中的低延迟业务分组。
Priority Applications (6)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
ES16865664T ES2772714T3 (es) | 2015-11-18 | 2016-10-31 | Método de obtención de camino de transmisión objetivo y nodo de red |
JP2018525659A JP6907203B2 (ja) | 2015-11-18 | 2016-10-31 | ターゲット送信パスを取得する方法及びネットワークノード |
KR1020187016121A KR102071439B1 (ko) | 2015-11-18 | 2016-10-31 | 타깃 전송 경로를 획득하는 방법 및 네트워크 노드 |
EP16865664.3A EP3367617B1 (en) | 2015-11-18 | 2016-10-31 | Method for obtaining target transmission path and network node |
US15/982,489 US10965581B2 (en) | 2015-11-18 | 2018-05-17 | Method and network node for obtaining target transmission path |
US17/191,041 US11757754B2 (en) | 2015-11-18 | 2021-03-03 | Method and network node for obtaining target transmission path |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510796056.7A CN106713141B (zh) | 2015-11-18 | 2015-11-18 | 用于获得目标传输路径的方法和网络节点 |
CN201510796056.7 | 2015-11-18 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/982,489 Continuation US10965581B2 (en) | 2015-11-18 | 2018-05-17 | Method and network node for obtaining target transmission path |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2017084487A1 true WO2017084487A1 (zh) | 2017-05-26 |
Family
ID=58717291
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2016/104055 WO2017084487A1 (zh) | 2015-11-18 | 2016-10-31 | 用于获得目标传输路径的方法和网络节点 |
Country Status (7)
Country | Link |
---|---|
US (2) | US10965581B2 (zh) |
EP (1) | EP3367617B1 (zh) |
JP (1) | JP6907203B2 (zh) |
KR (1) | KR102071439B1 (zh) |
CN (1) | CN106713141B (zh) |
ES (1) | ES2772714T3 (zh) |
WO (1) | WO2017084487A1 (zh) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2020532216A (ja) * | 2017-08-22 | 2020-11-05 | 華為技術有限公司Huawei Technologies Co.,Ltd. | 遅延ベースの伝送経路制御方法、ネットワークコントローラ、およびシステム |
CN112600753A (zh) * | 2020-12-08 | 2021-04-02 | 广州技象科技有限公司 | 根据设备接入量的设备节点通信路径选择方法及装置 |
Families Citing this family (29)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP3465996A1 (en) | 2016-06-06 | 2019-04-10 | Telefonaktiebolaget LM Ericsson (Publ) | Determining a path in a communication network |
CN109005078B (zh) * | 2017-06-06 | 2021-03-19 | 腾讯科技(深圳)有限公司 | 路由策略生成方法、装置及计算机可读存储介质 |
CN109150722B (zh) * | 2017-06-16 | 2021-03-30 | 华为技术有限公司 | 一种业务转发的方法及网络设备 |
US11477100B2 (en) | 2017-09-26 | 2022-10-18 | Zte Corporation | Residence time measurement for traffic engineered network |
CN108092888B (zh) * | 2017-10-31 | 2021-06-08 | 华为技术有限公司 | 一种基于Overlay网络的传输方法、网关及传输系统 |
CN110380965B (zh) * | 2018-04-13 | 2021-05-18 | 成都华为技术有限公司 | 用于业务传输的方法和装置 |
CN110391920B (zh) * | 2018-04-16 | 2022-04-26 | 中兴通讯股份有限公司 | 一种网络切片管理方法和装置、及设备 |
WO2019219203A1 (en) * | 2018-05-17 | 2019-11-21 | Telefonaktiebolaget Lm Ericsson (Publ) | Tearing down a label switched path through a communications network |
CN110661633B (zh) * | 2018-06-29 | 2022-03-15 | 中兴通讯股份有限公司 | 物理网元节点的虚拟化方法、装置、设备及存储介质 |
WO2020036399A1 (en) | 2018-08-13 | 2020-02-20 | Samsung Electronics Co., Ltd. | Wireless communication network in wireless communication system |
CN109041012A (zh) * | 2018-08-21 | 2018-12-18 | 上海交通大学 | 基于综合通信与计算能力的基站选择方法和系统 |
US10979488B2 (en) * | 2018-11-16 | 2021-04-13 | International Business Machines Corporation | Method for increasing file transmission speed |
CN111200848B (zh) * | 2018-11-19 | 2022-03-25 | 华为技术有限公司 | 一种通信方法及装置 |
CN109660462B (zh) * | 2018-12-13 | 2021-07-20 | 中国北方车辆研究所 | 车辆异构互连网络中的信息自适应传输方法 |
CN111327657A (zh) * | 2018-12-14 | 2020-06-23 | 诺基亚通信公司 | 数据缓冲的方法、设备和计算机可读介质 |
US20220094623A1 (en) * | 2019-01-11 | 2022-03-24 | Telefonaktiebolaget Lm Ericsson (Publ) | Network device, control device and methods therein |
CN113366805A (zh) | 2019-02-03 | 2021-09-07 | 华为技术有限公司 | 报文调度方法、调度器、网络设备和网络系统 |
JP2021022838A (ja) * | 2019-07-28 | 2021-02-18 | 株式会社フェアーウェイ | データ伝送装置およびプログラム |
CN112653626A (zh) * | 2019-10-12 | 2021-04-13 | 华为技术有限公司 | 一种高时延链路确定方法、路由发布方法及装置 |
CN113556221A (zh) * | 2020-04-23 | 2021-10-26 | 西门子股份公司 | 冗余网络中校时的方法及装置 |
CN111585895B (zh) * | 2020-05-12 | 2021-11-09 | 北京交通大学 | 无需时间同步的时间触发的数据传输方法 |
CN114448903A (zh) * | 2020-10-20 | 2022-05-06 | 华为技术有限公司 | 一种报文处理方法、装置和通信设备 |
CN112988313B (zh) * | 2021-05-13 | 2021-09-14 | 金锐同创(北京)科技股份有限公司 | 路径确定方法、装置及电子设备 |
CN113300958A (zh) * | 2021-05-24 | 2021-08-24 | 北京字跳网络技术有限公司 | 一种报文传输方法、装置、电子设备和存储介质 |
CN113190358A (zh) * | 2021-05-25 | 2021-07-30 | 曙光信息产业(北京)有限公司 | 作业分配方法、装置、电子设备及可读存储介质 |
CN113949659A (zh) * | 2021-10-14 | 2022-01-18 | 中电福富信息科技有限公司 | 一种流量承载路径智能选路方法及其装置 |
KR102627167B1 (ko) * | 2021-10-25 | 2024-01-18 | 에스케이텔레콤 주식회사 | 광 선로를 이용한 기지국에 클럭을 공급하기 위한 시스템 |
CN116248589A (zh) * | 2021-12-07 | 2023-06-09 | 中兴通讯股份有限公司 | 业务报文转发方法、路径建立方法及存储介质 |
CN115242301B (zh) * | 2022-07-22 | 2024-05-14 | 中国电信股份有限公司 | 网络链路监测方法及装置、存储介质、通信设备 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060050635A1 (en) * | 2004-09-03 | 2006-03-09 | Fujitsu Limited | Delay guarantee path setting system |
CN101001102A (zh) * | 2007-01-10 | 2007-07-18 | 北京航空航天大学 | 提高天基信息网络服务质量的路由装置及方法 |
US20080159142A1 (en) * | 2006-12-29 | 2008-07-03 | Lucent Technologies Inc. | Link access delay aware routing over mobile ad hoc networks (manets) |
CN102447980A (zh) * | 2010-09-30 | 2012-05-09 | 中兴通讯股份有限公司 | 一种路由控制方法、系统及路由计算装置 |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP3550655B2 (ja) * | 2000-05-19 | 2004-08-04 | 日本電気株式会社 | パケット遅延特性計測方法及び方式 |
US6724727B2 (en) * | 2001-12-03 | 2004-04-20 | Nokia Corporation | Policy-based forward error correction in packet networks |
JP4494357B2 (ja) * | 2006-03-08 | 2010-06-30 | 富士通株式会社 | パス経路計算方法及び,この方法を適用する光通信ネットワーク |
CN101252533B (zh) * | 2008-03-26 | 2011-01-05 | 中国科学院计算技术研究所 | 一种覆盖网系统和路由选择方法 |
EP2107735A1 (en) * | 2008-03-31 | 2009-10-07 | British Telecmmunications public limited campany | Admission control in a packet network |
JP2015012580A (ja) * | 2013-07-02 | 2015-01-19 | キヤノン株式会社 | 受信装置、受信方法及びプログラム |
US9872210B2 (en) * | 2013-10-16 | 2018-01-16 | At&T Mobility Ii Llc | Adaptive rate of congestion indicator to enhance intelligent traffic steering |
CN105874752B (zh) * | 2013-12-31 | 2020-07-21 | 华为技术有限公司 | 一种用于一个或多个时延段的源路由的系统和方法 |
US9843405B2 (en) * | 2014-12-11 | 2017-12-12 | Khalifa University of Science, Technology, and Research | Method and devices for clock synchronization over links with asymmetric transmission rates |
US9671822B2 (en) * | 2014-12-11 | 2017-06-06 | Khalifa University Of Science, Technology And Research | Method and devices for time transfer using end-to-end transparent clocks |
US10135708B2 (en) * | 2015-09-25 | 2018-11-20 | Intel Corporation | Technologies for performance inspection at an endpoint node |
-
2015
- 2015-11-18 CN CN201510796056.7A patent/CN106713141B/zh active Active
-
2016
- 2016-10-31 KR KR1020187016121A patent/KR102071439B1/ko active IP Right Grant
- 2016-10-31 EP EP16865664.3A patent/EP3367617B1/en active Active
- 2016-10-31 WO PCT/CN2016/104055 patent/WO2017084487A1/zh active Application Filing
- 2016-10-31 ES ES16865664T patent/ES2772714T3/es active Active
- 2016-10-31 JP JP2018525659A patent/JP6907203B2/ja active Active
-
2018
- 2018-05-17 US US15/982,489 patent/US10965581B2/en active Active
-
2021
- 2021-03-03 US US17/191,041 patent/US11757754B2/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060050635A1 (en) * | 2004-09-03 | 2006-03-09 | Fujitsu Limited | Delay guarantee path setting system |
US20080159142A1 (en) * | 2006-12-29 | 2008-07-03 | Lucent Technologies Inc. | Link access delay aware routing over mobile ad hoc networks (manets) |
CN101001102A (zh) * | 2007-01-10 | 2007-07-18 | 北京航空航天大学 | 提高天基信息网络服务质量的路由装置及方法 |
CN102447980A (zh) * | 2010-09-30 | 2012-05-09 | 中兴通讯股份有限公司 | 一种路由控制方法、系统及路由计算装置 |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2020532216A (ja) * | 2017-08-22 | 2020-11-05 | 華為技術有限公司Huawei Technologies Co.,Ltd. | 遅延ベースの伝送経路制御方法、ネットワークコントローラ、およびシステム |
JP6991313B2 (ja) | 2017-08-22 | 2022-01-12 | 華為技術有限公司 | 遅延ベースの伝送経路制御方法、ネットワークコントローラ、およびシステム |
US11245605B2 (en) | 2017-08-22 | 2022-02-08 | Huawei Technologies Co., Ltd. | Latency-based transmission path control method, network controller, and system |
CN112600753A (zh) * | 2020-12-08 | 2021-04-02 | 广州技象科技有限公司 | 根据设备接入量的设备节点通信路径选择方法及装置 |
Also Published As
Publication number | Publication date |
---|---|
EP3367617B1 (en) | 2019-12-04 |
JP2018534873A (ja) | 2018-11-22 |
CN106713141A (zh) | 2017-05-24 |
EP3367617A4 (en) | 2018-10-31 |
US20210194789A1 (en) | 2021-06-24 |
KR102071439B1 (ko) | 2020-01-30 |
EP3367617A1 (en) | 2018-08-29 |
US10965581B2 (en) | 2021-03-30 |
US11757754B2 (en) | 2023-09-12 |
ES2772714T3 (es) | 2020-07-08 |
US20180270144A1 (en) | 2018-09-20 |
KR20180081768A (ko) | 2018-07-17 |
JP6907203B2 (ja) | 2021-07-21 |
CN106713141B (zh) | 2020-04-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2017084487A1 (zh) | 用于获得目标传输路径的方法和网络节点 | |
US10230605B1 (en) | Scalable distributed end-to-end performance delay measurement for segment routing policies | |
CN107547393B (zh) | 一种计算转发路径的方法及网络设备 | |
CN107786465B (zh) | 一种用于处理低延迟业务流的方法和装置 | |
WO2019184925A1 (zh) | 一种报文发送的方法、网络节点和系统 | |
US11265228B2 (en) | Scalable service level agreement (SLA) verification and action using a data plane | |
WO2021057447A1 (zh) | 确定传输数据流的需求带宽的方法、设备和系统 | |
WO2019214561A1 (zh) | 一种报文发送的方法、网络节点和系统 | |
US9032068B2 (en) | Service assurance using network measurement triggers | |
CN112019395A (zh) | 增强型双向主动测量协议 | |
WO2016000481A1 (zh) | 路径切换的方法和网络设备 | |
KR20210002548A (ko) | 멀티캐스트 패킷 처리 방법 및 네트워크 디바이스 | |
WO2023155802A1 (zh) | 数据调度方法、装置、设备及存储介质 | |
EP4311195A1 (en) | Method and apparatus for ensuring deterministic latency of network slice, storage medium, and product | |
US10097468B2 (en) | Method and a system for finding smallest hop-specific data transfer speed |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 16865664 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2018525659 Country of ref document: JP |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2016865664 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 20187016121 Country of ref document: KR Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020187016121 Country of ref document: KR |