WO2018010618A1 - 一种数据报文的路径信息获取方法及设备 - Google Patents

一种数据报文的路径信息获取方法及设备 Download PDF

Info

Publication number
WO2018010618A1
WO2018010618A1 PCT/CN2017/092387 CN2017092387W WO2018010618A1 WO 2018010618 A1 WO2018010618 A1 WO 2018010618A1 CN 2017092387 W CN2017092387 W CN 2017092387W WO 2018010618 A1 WO2018010618 A1 WO 2018010618A1
Authority
WO
WIPO (PCT)
Prior art keywords
router
data packet
network device
address
network
Prior art date
Application number
PCT/CN2017/092387
Other languages
English (en)
French (fr)
Inventor
周兴旺
李峰
李晋
朱夏
李从娟
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to KR1020197001964A priority Critical patent/KR102208873B1/ko
Priority to EP17826954.4A priority patent/EP3471351B1/en
Priority to JP2019501729A priority patent/JP6801075B2/ja
Publication of WO2018010618A1 publication Critical patent/WO2018010618A1/zh
Priority to US16/241,006 priority patent/US11240164B2/en

Links

Images

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/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
    • 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/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • 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/14—Routing performance; Theoretical aspects
    • 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/20—Hop count for routing purposes, e.g. TTL
    • 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/74—Address processing for routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/11—Identifying congestion
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/25—Flow control; Congestion control with rate being modified by the source upon detecting a change of network conditions
    • 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
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion

Definitions

  • the present application relates to the field of communications, and in particular, to a method and a device for acquiring path information of a data packet.
  • a data message is a data unit exchanged and transmitted in a network, that is, a data block to be sent by a station at one time.
  • the data message contains the complete data information to be sent.
  • the length and length are very inconsistent, the length is not limited and variable, and the data message is also the unit of network transmission.
  • the transmission group will continuously encapsulate the group, packet and frame to transmit.
  • the way to encapsulate is to add some pieces of information, which are the data organized by the message header in a certain format, such as the message type, message version, message length, message entity and so on.
  • the network device such as the router's AQM (English full name: Active Queue Management, Chinese: Dynamic Queue Management) mechanism, will perform packet loss processing to alleviate congestion when the network is congested.
  • the current AQM mechanism mainly adopts random discarding; TCP congestion control algorithm
  • the main purpose is to adjust the congestion window of the TCP stream so that the TCP transmission rate is in a best match with the network physical bandwidth and congestion.
  • the current TCP congestion control algorithm mainly refers to the current transmission rate of the TCP stream when adjusting the congestion window.
  • the path information of the data packet (such as the hop count of the router or the RTT (English: Round-Trip Time) value) is also a very important reference parameter, but The prior art cannot obtain the path information of the data packet.
  • the present application provides a method and a device for acquiring path information of a data packet. Can improve the resource utilization of the network.
  • the first aspect provides a method for obtaining a path information of a data packet, where the method includes the following steps: the network device receives a data packet transmitted in the network; and the network device obtains the data according to the source address and the destination address of the data packet.
  • the path information from the source end to the destination end of the packet, the path information being: the total hop count of the router through which the data packet passes from the source end to the destination end, or the delay of the data packet from the source end to the destination end .
  • the technical solution provided by the first aspect of the present application obtains the source address and the destination address of the data packet, and obtains the path information of the source end and the destination end according to the source address and the destination address, so that the network device can obtain the network device.
  • the path information of the packet so it has the advantage of getting the path information of the packet.
  • the network device when the path information includes the total hop count of the router, obtains the path information of the source end to the destination end of the data packet according to the source address and the destination address of the data packet.
  • the method includes: calculating, according to the lifetime value of the data packet, a first hop count of the data packet from the source end to the router of the network device, and according to the destination address of the data packet, the slave address and the hop count of the router.
  • the second hop of the router from the network device to the destination address is queried in the mapping relationship, and the sum of the first hop count and the second hop count is the total hop count of the router that the source end to the destination end passes.
  • a possible design provides a specific way of obtaining the total number of routers, and supports the path information of the network device from the source end to the destination end.
  • the network device when the path information includes the total hop count of the router, the network device obtains the source end to the destination of the data packet according to the source address and the destination address of the data packet.
  • the path information of the end is specific, The method includes: querying, according to a mapping relationship between the source address and the hop count of the data packet, a third hop of the router from the source to the network device, and hopping from the router according to the destination address of the data packet.
  • the number mapping relationship queries the fourth hop of the router from the network device to the destination address, and the sum of the third hop count and the fourth hop count is the total hop count of the router that the source end to the destination end passes.
  • Another possible design provides a specific way to obtain the total number of other routers, and supports the network device to obtain the path information from the source to the destination.
  • the network device when the path information includes the total hop count of the router, obtains the source end to the destination of the data packet according to the source address and the destination address of the data packet.
  • the path information of the terminal includes: when the total number of hops of the router is not included in the data packet, the network device sends a query message to query a fifth hop of the network device to the destination end, where the The sum of the five hops and the sixth hop of the source to the network device is the total hop count of the router, and the total hop count of the router is filled to the extended field of the data packet, the query The destination address of the packet is the same as the destination address of the data packet.
  • Another possible design provides a specific way of obtaining the total number of routers, which supports the path information of the network device from the source to the destination.
  • the total hop count of the router in the above-mentioned possible design may be loaded in the extension field of the service packet corresponding to the data packet.
  • the mapping between the foregoing address and the number of hops of the router includes: the network device receives the routed message that is spread in the network, and the routed message includes: an address and a diffusion from the address to the network. The number of network hops on each network segment where the device passes. The network device obtains the seventh hop from the network device to the edge device according to the network topology of the network segment where the network device resides. The sum of the seventh hop count is the total hop count of the router of the network device to the address, and the mapping relationship between the address and the total hop count of the router of the address is saved; the border device is the The network segment where the network device is located sends a data packet to the last device on the network segment where the network device passes through the address.
  • a specific implementation manner of how to obtain a mapping relationship between an address and a router hop count is provided, and supports one possible design, another possible design, and another possible design implementation.
  • the network device determines a packet loss policy of the data packet according to the path information when the network is congested, or the network device determines a transmission rate of the data packet according to the path information.
  • the network device application path information adjusts the packet loss policy or the data packet transmission rate of the data packet, and optimizes the packet loss policy and the transmission rate.
  • a network device in a second aspect, includes:
  • transceiver unit configured to receive data packets transmitted in the network
  • a processing unit configured to obtain, according to the source address and the destination address of the data packet, path information from the source end to the destination end of the data packet, where the path information is: the data packet is from the source end to the destination end The total number of hops of the passed router or the delay of the data packet from the source to the destination.
  • the network device After receiving the data packet, the network device provided by the second aspect of the present application obtains the source address and the destination address of the data packet, and obtains the path information of the source end and the destination end according to the source address and the destination address, so that the network device can obtain the network device.
  • the path information of the packet so it has the advantage of getting the path information of the packet.
  • the above processing unit may be used to perform one possible design of the first aspect described above, One possible design, one possible design, the next possible design, one possible design, and the latter possible design.
  • FIG. 1 is a schematic flowchart of a method for acquiring path information of a data packet according to the present application
  • FIG. 2 is a schematic diagram of an implementation scenario of multiple networks provided by an embodiment of the present application.
  • FIG. 3 is a schematic diagram of another implementation scenario of multiple networks provided by an embodiment of the present application.
  • FIG. 4 is a schematic structural diagram of a network device provided by the present application.
  • FIG. 5 is a schematic structural diagram of hardware of a network device provided by the present application.
  • FIG. 1 is a method for acquiring path information of a data packet according to an embodiment of the present disclosure.
  • the method is applied to a network device, where the network device includes but is not limited to: a router, a node, a server, and the like.
  • the method is shown in Figure 1, and includes the following steps:
  • Step 101 The network device receives a data packet transmitted in the network.
  • the receiving in the foregoing step 101 may be received by wire, or may be received by using a wireless method. This embodiment does not limit the manner of receiving.
  • Step 102 The network device obtains the path information from the source end to the destination end of the data packet according to the source address and the destination address of the data packet, where the path information may be: the data packet passes through the source end to the destination end. The total number of hops of the router or the delay of the data packet from the source to the destination;
  • the network device can obtain the path information of the source end to the destination end of the data packet according to the source address and the destination address, which may include:
  • the network device obtains the TTL (Time To Live, Chinese: Time to Live) value in the data packet, and calculates the first hop of the data packet from the source to the router of the network device according to the TTL value, according to the datagram.
  • the destination address of the text is the second hop of the router from the network device to the destination address.
  • the sum of the first hop and the second hop is the source to the destination. The total number of hops for the router.
  • the first hop of the router that calculates the data packet from the source to the network device according to the TTL value may be, according to the TCP protocol, the initial value of the TTL is 64, and the value is decremented by one after each router, so the direct use is 64 The TTL value of the data packet is subtracted to obtain the first hop count of the passing router.
  • the manner of obtaining the mapping relationship between the foregoing address and the number of hops of the router may specifically include:
  • the network device receives the routing message that is flooded in the network, and the routing message includes: an address (generally an IP address of the source device that diffuses the routing message) and each network segment that is extended from the address to the network device.
  • the hop count of the network segment router the network device obtains the seventh hop of the network device to the border device according to the network topology of the network segment where the network device is located, and the sum of the hop count of the network segment router of each network segment and the seventh hop count 1 is the total hop count of the router of the network device to the address, and the mapping relationship between the address and the total hop count of the router of the address is saved; the border device sends a datagram for the network segment where the network device is located. The last device of the network segment where the network device passes through the address.
  • routing packets can be implemented by extending the routing information of the IGP (English name: Interior Gateway Protocol, Chinese: Internal Gateway Protocol).
  • the format of the extended routing packets is shown in Table 1:
  • the number of hops of the network segment of each network segment of the router can be obtained by the following method:
  • the router in the network area (commonly known as the network segment) can sense the network topology in the network area, according to the network topology.
  • the destination address of the data packet can obtain the number of router hops in the network area that passes through.
  • the specific implementation manner can be: according to the IGP protocol, each router can learn the network topology structure of the area in which the network is located, according to the network topology.
  • the structure can obtain that each router can send data packets to the destination address.
  • the application extends a Distance field in the routing message, and the Distance field is added to the network segment router hop count of each network segment, and the following is an actual The example shows how the router hop count is obtained.
  • the network device is replaced by “R”, the number following R represents the label of the network device, and “R2” is taken as an example, which represents the second network in the network.
  • the specific implementation method of the device is as follows.
  • the AS_PATH attribute of the route packet adds the number of router hops from R2 to 10.0.1.0/24 on the basis of the original information (as shown in the last line of the following code). ):
  • the path segment value: 100, 2 is the identifier of the network area that passes through, and 2 is the number of router hops that the data packet passes in the network area indicated by 100.
  • R5 uses the IGP of AS 200 to calculate the number of router hops from R5 to R3, and adds it to the Update packet and then spreads it to AS300.
  • Path segment value 100, 2, 200, 3
  • path segment value 100, 2, 200, 3 is the identifier of the network area where R3 is located, and 200, 3 means the number of router hops passed in the network area indicated by 200, which assumes that the address is established.
  • the network device of the mapping between the total number of hops of the router is R8, and the address carried by the routing message is 10.0.0.1.0/24.
  • the AS300 sends The last device that the data packet passes to 10.0.1.0/24 is R7, so R7 is the border device. You can know that the router hop count from R8 to R7 is 1 through the network topology, so it goes through R8 to 10.0.1.0/24.
  • R5 in AS200 is taken as an example to illustrate how R5 can establish the mapping relationship between 10.0.1.0/24 and the total number of hops of the router.
  • the implementation method of the foregoing step 102 may specifically be:
  • mapping relationship Querying, according to the mapping relationship between the source address and the hop count of the data packet, the third hop of the router from the source to the network device, and the number of hops from the address and the router according to the destination address of the data packet.
  • the mapping relationship queries the fourth hop of the router from the network device to the destination address, and the sum of the third hop count and the fourth hop count is the total hop count of the router that the source end to the destination end passes.
  • the method of obtaining the time delay from the source to the destination may be obtained by the source network device or the destination network device, and the method for sending the probe packet and the delay may be referred to the TCP protocol. As shown in the following, after the source network device obtains the delay, the network device can carry the delay in the data packet.
  • Step 103 when network congestion occurs, the network device determines the packet loss policy or the data packet transmission speed of the data packet according to the path information of the data packet.
  • the packet loss policy in the foregoing step 103 may specifically include the following policies:
  • the network device sets the discarding probability of the data packet with a large delay from the source end to the destination end, and the discarding probability of the data packet with a small delay from the source end to the destination end.
  • the packet loss policy in the foregoing step 103 may specifically include the following policies:
  • the network device sets the probability of dropping the data packet with a large total hop count of the router to be lower than the data packet with a small hop count of the router;
  • the packet loss policy in the foregoing step 103 may specifically include the following policies:
  • the queue length of the interval with a large total hop count of the router is larger than the queue length of the interval with a small number of hops of the router.
  • the queue threshold of the interval with a large total hop count of the router is larger than the queue threshold of the interval with a small number of hops of the router, and the total hop count of the router is large.
  • the packet loss probability of the interval is smaller than the packet loss probability of the router with a small hop count.
  • the above step 103 can be replaced by the following method.
  • the network device determines the transmission rate of the data packet according to the path information of the data packet.
  • the network device sets the transmission rate of the data packet with the large delay from the source end to the destination end to be higher than the drop probability of the data packet with the small delay from the source end to the destination end.
  • the network device sets the transmission rate of the data packet with a large total hop count of the router to be higher than the transmission rate of the data packet with a small total hop count of the router.
  • the technical solution provided by the present application has the advantage of obtaining the path information of the data packet after receiving the data packet, and then determining the packet loss of the data packet according to the path information.
  • the policy or the transmission rate, so that the targeted data packets to be sent are discarded, and the resource utilization of the network is improved as much as possible.
  • FIG. 2 the technical solution for preventing network congestion by using path information is as shown in FIG. 2.
  • the system shown in FIG. 2 includes six network devices. To conveniently distinguish six network devices, we name each of the six network devices. R1, R2, R3, R4, R5, and R6 are connected as shown by the solid line in Figure 2. For convenience of distinction, the links between the above six network devices are named: L1, L2, L3, L4, L5, it is assumed that the network device shown in Figure 2 has only two streams. For convenience of distinction, the two streams are named Flow1 and Flow2. Flow1 can be sent to R6 through R4 through R5.
  • the link through which the route can pass is: L4 and L5
  • Flow1 can be sent to R6 through R1, R2, R3, and R4, and the link through which it can pass is: L1, L2, L3, and L5; here, it is assumed that the maximum network speed of L5 is 100Mbps, L1, L2.
  • the maximum network speed of L3 and L4 is 60Mbps.
  • the number of packets passing the Flow1 (the number of hops passing through the router is one):
  • the L1, L2, and L3 links are not affected.
  • the network speed of the link corresponding to the packet loss is reduced by half, so L4 is reduced to 30 Mbps, L5 is reduced to 90 Mbps, and L5 is less than the maximum.
  • the network speed is 100Mbps, and there is no congestion.
  • the resource utilization rate of the network is only 50% of the resource utilization rate of L4, and the resource utilization ratio of L1, L2, and L3 is 100%.
  • L4 link is not affected.
  • L1, L2, and L3 are all reduced to 30 Mbps, L5 is reduced to 90 Mbps, L5 is less than the maximum network speed of 100 Mbps, and congestion does not occur.
  • the resource utilization of the network has resources of L1, L2, and L3.
  • the utilization rate is 50%, and the resource utilization rate of L4 is 100%.
  • the resource usage of the packets that drop the Flow2 is lower than the resource usage of the packets that are discarded by the Flow1. That is, the data packets transmitted on the stream with the larger number of hops are discarded. Links that are farther away are affected, which reduces the overall resource utilization of the network. Conversely, dropping data packets transmitted on the stream with smaller hop counts will improve the overall resource utilization of the network.
  • FIG. 4 provides a network device 400, which includes, but is not limited to, an intelligent terminal, a computer, a server, a switch, a router, and the like, capable of transmitting or forwarding data packets.
  • a network device 400 includes, but is not limited to, an intelligent terminal, a computer, a server, a switch, a router, and the like, capable of transmitting or forwarding data packets.
  • the network device 400 includes:
  • the transceiver unit 401 is configured to receive a data packet transmitted in the network
  • the processing unit 402 is configured to obtain, according to the source address and the destination address of the data packet, path information from the source end to the destination end of the data packet, where the path information is: the data packet is from the source end to the destination end. The total number of hops of the router that passed through or the delay of the data packet from the source to the destination.
  • the network device provided by the application After receiving the data packet, the network device provided by the application obtains the source address and the destination address of the data packet, and obtains the path information of the source end and the destination end according to the source address and the destination address, so that the network device can obtain the data packet.
  • Path information so it has the advantage of getting the path information of the packet.
  • the processing unit 402 is further configured to perform the refinement of step 102, step 103, step 102, and step 103 in the foregoing embodiment shown in FIG. 1 .
  • FIG. 5 is a simplified schematic diagram of a network device 50 according to an embodiment of the present disclosure.
  • the network device 50 includes, but is not limited to, a mobile phone, a tablet computer, a server, a base station, a mobile switching center, and the like.
  • the network device 50 includes a processor 501, a memory 502, a transceiver 503, and a bus 504.
  • the transceiver 503 is configured to transmit and receive data with and from an external device.
  • the number of processors 501 in network device 50 may be one or more.
  • processor 501, memory 502, and transceiver 503 may be connected by a bus system or other means.
  • Network device 50 can be used to perform the method illustrated in FIG. For the meaning and examples of the terms involved in the embodiment, reference may be made to the corresponding embodiment of FIG. 1. I will not repeat them here.
  • the transceiver 503 is configured to receive a data packet transmitted in the network or receive an extended routing message in the network.
  • the program code is stored in the memory 502.
  • the processor 501 is configured to call the program code stored in the memory 502 for performing the following operations:
  • the processor 501 is configured to obtain path information of the source end to the destination end of the data packet according to the source address and the destination address of the data packet, where the path information is: the data packet is from the source end to the destination end. The total number of hops of the router that passed through or the delay of the data packet from the source to the destination.
  • the processor 701 is specifically configured to perform the refinement of step 102, step 103, step 102, and step 103 in the embodiment shown in FIG.
  • step 102, step 103, step 102, and step 103 in the embodiment shown in FIG.
  • the processor 501 herein may be a processing component or a general term of multiple processing components.
  • the processing component may be a central processing unit (CPU), an application specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present application.
  • DSPs digital signal processors
  • FPGAs Field Programmable Gate Arrays
  • the memory 503 may be a storage device or a collective name of a plurality of storage elements, and is used to store executable program code or parameters, data, and the like required for the application running device to operate. And the memory 503 may include random access memory (RAM), and may also include non-volatile memory such as a magnetic disk memory, a flash memory, or the like.
  • RAM random access memory
  • non-volatile memory such as a magnetic disk memory, a flash memory, or the like.
  • the bus 504 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus.
  • ISA Industry Standard Architecture
  • PCI Peripheral Component
  • EISA Extended Industry Standard Architecture
  • the bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 5, but it does not mean that there is only one bus or one type of bus.
  • the network device may also include input and output devices coupled to bus 504 for connection to other portions, such as processor 501, via a bus.
  • the input/output device can provide an input interface for the operator, so that the operator can select the control item through the input interface, and can also be other interfaces through which other devices can be externally connected.
  • the program may be stored in a computer readable storage medium, and the storage medium may include: Flash disk, read-only memory (English: Read-Only Memory, referred to as: ROM), random accessor (English: Random Access Memory, referred to as: RAM), disk or optical disk.
  • ROM Read-Only Memory
  • RAM Random Access Memory

Landscapes

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

Abstract

本申请公开了一种数据报文的路径信息获取方法及设备，所述方法包括如下步骤：网络设备接收网络中传输的数据报文；网络设备获取所述数据报文的源端到目的端的路径信息，所述路径信息为：所述数据报文从源端到目的端所经过的路由器的总跳数或所述数据报文从源端到目的端的时延。本申请具有获取数据包的路径信息的优点。

Description

一种数据报文的路径信息获取方法及设备 技术领域
本申请涉及通信领域，尤其涉及一种数据报文的路径信息获取方法及设备。
背景技术
数据报文是网络中交换与传输的数据单元，即站点一次性要发送的数据块。数据报文包含了将要发送的完整的数据信息，其长短很不一致，长度不限且可变，数据报文也是网络传输的单位，传输过程中会不断的封装成分组、包、帧来传输，封装的方式就是添加一些信息段，那些就是报文头以一定格式组织起来的数据，比如里面有报文类型，报文版本，报文长度，报文实体等等信息。
在实现现有技术的方案中，发现现有技术存在如下技术问题：
网络设备比如路由器的AQM(英文全称：Active Queue Management，中文：动态队列管理)机制在网络拥塞时会进行丢包处理以缓解拥塞状况，当前AQM机制主要是采用随机丢弃的方式；TCP拥塞控制算法主要是调节TCP流的拥塞窗口，以使TCP的发送速率与网络物理带宽、拥塞状况处于一个最好的匹配状态，当前TCP拥塞控制算法在调节拥塞窗口时主要参考了TCP流的当前发送速率和丢包状况等，但是对于网络拥塞来说，数据报文的路径信息(例如路由器的跳数或RTT(英文全称：Round-Trip Time，中文：往返时延)值)也是非常重要参考参数，但是现有技术的无法得到数据包的路径信息。
发明内容
本申请提供一种数据报文的路径信息获取方法及设备。可以提高网络的资源利用率。
第一方面，提供数据报文的路径信息获取方法，所述方法包括如下步骤：网络设备接收网络中传输的数据报文；网络设备根据所述数据报文的源地址和目的地址得到所述数据报文的源端到目的端的路径信息，所述路径信息为：所述数据报文从源端到目的端所经过的路由器的总跳数或所述数据报文从源端到目的端的时延。
本申请第一方面提供的技术方案在接收到数据报文后，获取数据报文的源地址和目的地址，依据源地址和目的地址得到该源端到目的端的路径信息，进而使得网络设备能够获取数据包的路径信息，所以其具有得到数据包的路径信息的优点。
在一种可能的设计中，当路径信息包括路由器的总跳数时，所述网络设备根据所述数据报文的源地址和目的地址得到所述数据报文的源端到目的端的路径信息具体，包括：依据所述数据报文的生存时间值计算出所述数据报文从源端到网络设备的路由器的第一跳数，依据所述数据报文的目的地址从地址与路由器跳数的映射关系中查询出所述网络设备到目的地址的路由器的第二跳数，第一跳数和第二跳数的和即为源端到目的端所经过的路由器的总跳数。
一种可能的设计提供了一种路由器的总条数的具体得到方式，支持了网络设备得到源端到目的端的路径信息。
在另一种可能设计中，当所述路径信息包括所述路由器的总跳数时，所述网络设备根据所述数据报文的源地址和目的地址得到所述数据报文的源端到目的端的路径信息具体， 包括：依据所述数据报文的源地址从地址与路由器跳数的映射关系中查询出源端到网络设备的路由器的第三跳数，依据所述数据报文的目的地址从地址与路由器跳数的映射关系查询出所述网络设备到目的地址的路由器的第四跳数，第三跳数和第四跳数的和即为源端到目的端所经过的路由器的总跳数。
另一种可能的设计提供了另一种路由器的总条数的具体得到方式，支持了网络设备得到源端到目的端的路径信息。
在又一种可能设计中，当所述路径信息包括所述路由器的总跳数时，所述网络设备根据所述数据报文的源地址和目的地址得到所述数据报文的源端到目的端的路径信息具体，包括：当所述数据报文中未包括所述路由器的总跳数时，所述网络设备发送查询报文查询出所述网络设备到目的端的第五跳数，所述第五跳数与源端到所述网络设备的第六跳数的和即为所述路由器的总跳数，将所述路由器的总跳数填充至所述数据报文的扩展字段，所述查询报文的目的地址与所述数据报文的目的地址相同。
又一种可能的设计提供了又一种路由器的总条数的具体得到方式，支持了网络设备得到源端到目的端的路径信息。
在下一种可能设计中，可以将上述可能设计中的路由器的总跳数加载在所述数据报文对应业务报文的扩展字段中。
在还一种可能设计中，上述地址与路由器跳数的映射关系具体，包括：网络设备接收网络中扩散的路由报文，所述路由报文包括：地址以及从所述地址扩散至所述网络设备所经过的每个网段的网段路由器跳数，网络设备依据网络设备所在网段的网络拓扑得到网络设备到边界设备的第七跳数，每个网段的网段路由器跳数与所述第七跳数的和加1即为网络设备到所述地址的路由器的总跳数，将所述地址与所述地址的路由器的总跳数的映射关系保存；所述边界设备为所述网络设备所在网段发送数据报文至所述地址所经过的所述网络设备所在网段的最后一个设备。
在还一种可能设计中提供了如何获得地址和路由器跳数的映射关系的具体实现方式，支持了上述一种可能设计、另一种可能设计以及又一种可能设计的实现。
在后一种可能设计中，网络设备在网络拥塞时依据所述路径信息确定所述数据报文的丢包策略或网络设备依据所述路径信息确定所述数据报文的传输速率。
在后一种可能设计中网络设备应用路径信息对数据报文的丢包策略或数据报文的传输速率进行调整，优化了丢包策略以及传输速率。
第二方面，提供一种网络设备，所述网络设备包括：
收发单元，用于接收网络中传输的数据报文；
处理单元，用于根据所述数据报文的源地址和目的地址得到所述数据报文的源端到目的端的路径信息，所述路径信息为：所述数据报文从源端到目的端所经过的路由器的总跳数或所述数据报文从源端到目的端的时延。
本申请第二方面提供的网络设备在接收到数据报文后，获取数据报文的源地址和目的地址，依据源地址和目的地址得到该源端到目的端的路径信息，进而使得网络设备能够获取数据包的路径信息，所以其具有得到数据包的路径信息的优点。
在后续的可能设计中，上述处理单元可以用于执行上述第一方面的一种可能设计、另 一种可能设计、又一种可能设计、下一种可能设计、还一种可能设计以及后一种可能设计。
附图说明
为了更清楚地说明本申请实施例的技术方案，下面将对实施例描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图是本申请的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。
图1是本申请提供的一种数据报文的路径信息获取方法的流程示意图；
图2是本申请一实施例提供的多个网络的实现场景示意图；
图3是本申请一实施例提供的多个网络的另一个实现场景示意图；
图4是本申请提供的网络设备的结构示意图；
图5是本申请提供的网络设备的硬件结构示意图。
具体实施方式
参阅图1，图1为本申请一实施例提供的一种数据报文的路径信息获取方法，该方法应用在网络设备中，该网络设备包括但不限于：路由器、节点、服务器等设备，该方法如图1所示，包括如下步骤：
步骤101、网络设备接收网络中传输的数据报文；
上述步骤101中的接收可以是通过有线方式接收，当然也可以是通过无线方式接收，本实施例并不局限上述接收的方式。
步骤102、网络设备根据所述数据报文的源地址和目的地址得到所述数据报文的源端到目的端的路径信息，该路径信息可以为：该数据报文从源端到目的端所经过的路由器的总跳数或该数据报文从源端到目的端的时延；
当该路径信息可以为该路由器的总跳数时，网络设备可以依据源地址以及目的地址获取该数据报文的源端到目的端的路径信息，具体可以包括：
网络设备获取数据报文中的TTL(英文全称：Time To Live，中文：生存时间)值，依据该TTL值计算出数据报文从源端到网络设备的路由器的第一跳数，依据数据报文的目的地址从地址与路由器跳数的映射关系中查询到该网络设备到目的地址的路由器的第二跳数，第一跳数和第二跳数的和即为源端到目的端所经过的路由器的总跳数。
依据该TTL值计算出数据报文从源端到网络设备的路由器的第一跳数实现方式可以为，依据TCP协议，TTL的初始值为64，每经过一个路由器，数值减1，所以直接用64减去数据报文的TTL值即可得到经过的路由器的第一跳数。
上述地址与路由器跳数的映射关系的获取方式具体可以包括：
网络设备接收网络中扩散的路由报文，该路由报文包括：地址(一般为扩散该路由报文的源端设备的IP地址)以及从所述地址扩散至网络设备所经过的每个网段的网段路由器跳数，网络设备依据网络设备所在网段的网络拓扑得到网络设备到边界设备的第七跳数，每个网段的网段路由器跳数与所述第七跳数的和加1即为网络设备到所述地址的路由器的总跳数，将所述地址与所述地址的路由器的总跳数的映射关系保存；所述边界设备为所述网络设备所在网段发送数据报文至所述地址所经过的所述网络设备所在网段的最后一个设备。
上述路由报文具体可以通过扩展IGP(英文全称：Interior Gateway Protocol，中文：内部网关协议)的路由报文来实现，扩展后的路由报文格式如表1所示：
表1：
Figure PCTCN2017092387-appb-000001
其中，表1中其他字段的定义可以参见IGP路由协议的规定，这里不在赘述，本申请中每个网段的网段路由器跳数携带在表1中的Distance字段内。
上述路由器的每个网段的网段路由器跳数可以通过下述方式来获取，依据IGP协议，本网络区域(俗称网段)内的路由器可以感知本网络区域内的网络拓扑，依据该网络拓扑以及数据报文的目的地址即可以得到所经过的网络区域内的路由器跳数，具体的实现方式可以为：依据IGP协议，每个路由器均可以获知其所在区域的网络拓扑结构，依据该网络拓扑结构可以得到每个路由器可以将数据报文发送至那个目的地址，本申请在路由报文内扩展一个Distance字段，该Distance字段增加到每个网段的网段路由器跳数，下面以一个实际的例子来说明该路由器跳数是如何来得到的。
以图3所示的网络为例，为了描述的方便，这里将网络设备用“R”替代，R后面的数字表示网络设备的标号，以“R2”为例，其表示网络中第2个网络设备，具体的实现方法如下所示，
R2将10.0.1.0/24网段扩散至AS 200时，路由报文的AS_PATH属性在原有信息的基础上增加R2至10.0.1.0/24网段的路由器跳数(如下面代码的最后一行所示)：
AS path segment：100
path segment type：AS_SEQUENCE(2)
path segment length：1AS
path segment value：100，2
其中，path segment value：100，2中的100为所经过的网络区域的标识，2表示数据报文在100所示的网络区域中所经过的路由器跳数。
同理，R3扩散该信息至R5后，R5利用AS 200的IGP计算出R5至R3的路由器跳数，并添加至Update报文中后扩散至AS300，
AS path segment：100 200
path segment type：AS_SEQUENCE(2)
path segment length：2AS
path segment value：100，2，200，3
其中，path segment value：100，2，200，3中200为R3所在网络区域的标识，200，3的含义为在200所示的网络区域中所经过的路由器跳数3，这里假设建立地址与路由器的总跳数的映射关系的网络设备为R8，路由报文携带的地址为10.0.1.0/24，那个对于R8来说，Distance的值为2+3＝5，对于AS300来说，AS300发送数据报文到10.0.1.0/24所经过的最后一个设备为R7，所以R7为边界设备，通过网络拓扑可以获知R8到R7的路由器跳数为1，所以从R8到10.0.1.0/24所经过的路由器的总跳数为，2+3+1+1＝7，则R8存储路由器的总跳数7与地址10.0.1.0/24的映射关系。
为了更好的说明上述映射关系的建立，这里以AS200中的R5为例来说明如何来R5如何建立10.0.1.0/24与路由器总跳数的映射关系，对于R5来说，Distance的值为2(仅为AS100的路由器跳数)，R5所在网段为AS200，AS200发送数据报文至10.0.1.0/24的最后一个设备为R3，依据AS200的拓扑结构，R5到R3所经过的路由器跳数为2，则R5到10.0.1.0/24总跳数为2+2+1＝5，R5存储路由器的总跳数5与地址10.0.1.0/24的映射关系。
如该路由信息包括路由器的总跳数时，上述步骤102的实现方法具体还可以为：
依据所述数据报文的源地址从地址与路由器跳数的映射关系中查询出源端到网络设备的路由器的第三跳数，依据所述数据报文的目的地址从地址与路由器跳数的映射关系查询出所述网络设备到目的地址的路由器的第四跳数，第三跳数和第四跳数的和即为源端到目的端所经过的路由器的总跳数。
上述地址与路由器跳数的映射关系的获取方式可以参见上述描述，这里不再赘述。
上述源端到目的端的时延的获取方式可以由源端网络设备或目的端网络设备发送探测报文来获取，具体的探测报文的发送方式以及时延的获取方式可以参见TCP协议的规定，这里不再赘述，源端网络设备在获取到该时延后，将该时延携带在数据报文内即可。
步骤103(图中未画出)、当发生网络拥塞时，网络设备依据该数据报文的路径信息确定该数据报文的丢包策略或数据报文的传输速度。
如该路径信息包括数据报文从源端到目的端的时延时，上述步骤103的丢包策略具体可以包括如下策略：
网络设备设定所述源端到目的端的时延大的数据报文的丢弃概率低于所述源端到目的端的时延小的数据报文的丢弃概率。
上述步骤103中的丢包策略具体可以包括如下策略：
网络设备设定路由器的总跳数大的数据报文的丢弃概率低于经过路由器跳数小的数据报文；
当然上述步骤103中丢包策略具体还可以包括如下策略：
依据路由器的总跳数大小划分多个不同的区间，对每个区间制定不同的队列长度、队列阈值和丢包概率，其中，
路由器的总跳数大的区间的队列长度大于路由器跳数小的区间的队列长度，路由器的总跳数大的区间的队列阈值大于路由器跳数小的区间的队列阈值，路由器的总跳数大的区间的丢包概率小于路由器跳数小的区间的丢包概率。
当然上述步骤103也可以采用下述方案来替换，网络设备依据该数据报文的路径信息确定所述数据报文的传输速率。
或网络设备设定所述源端到目的端的时延大的数据报文的传输速度高于所述源端到目的端的时延小的数据报文的丢弃概率。
或网络设备设定路由器的总跳数大的数据报文的传输速度高于路由器的总跳数小的数据报文的传输速率。
本申请提供的技术方案通过在接收到数据报文后，获取数据报文的路径信息，所以其具有获取数据报文的路径信息的优点，然后依据该路径信息来确定该数据报文的丢包策略或传输速率，从而有针对性的对待发送的数据报文进行丢弃，并且尽可能的提高网络的资源利用率。
下面通过一个附图2来说明本申请一实施例提供的技术方案的技术效果。如图2所示为利用路径信息防止网络拥塞的技术方案，如图2所示，图2所示的系统包括6个网络设备，为了方便区分6个网络设备，我们将6个网络设备分别命名为R1、R2、R3、R4、R5、R6，其连接方式如图2实线所示，为了方便区分，将上述6个网络设备之间的链路命名为：L1、L2、L3、L4、L5，这里假设图2所示的网络设备只有2条流，为了方便区分，将两条流命名为Flow1和Flow2；其中，Flow1可以为R5通过R4发送至R6，其通过的链路可以为：L4和L5，Flow1可以为R1通过R1、R2、R3、R4发送至R6，其通过的链路可以为：L1、L2、L3和L5；这里假设L5的最大网速为100Mbps，L1、L2、L3、L4的最大网速均为60Mbps。
这里假设如图2所示的所有的链路均为最大网速，则对于R4来说，由于L5的最大网速为100Mbps，L3、L4的最大网速均为60Mbps，其网速的和为120Mbps，所以如果所有的链路均为最大网速，对于R4来说将会发生拥塞，此时，如果要解决拥塞，只能做丢包处理，那么对于R4来说，由于只有两条流Flow1和Flow2，其丢包的选择可以为，丢弃Flow1的数据报文或丢弃Flow2的数据报文，下面分别分析丢弃Flow1或Flow2数据报文的网络的资源利用率。
丢Flow1的报文(经过的路由器跳数为1个)：
L1，L2，L3链路不受影响，依据TCP协议的规定，当出现丢包时，其丢包对应的链路的网速降低一半，所以L4降至30Mbps，L5降至90Mbps，L5小于最大网速100Mbps，不会出现拥塞，此时，网络的资源利用率仅有L4的资源利用率为50％，L1，L2，L3的资源利用率均为100％。
丢Flow2的报文(经过的路由器跳数为3个)：
L4链路不受影响，L1，L2，L3均降至30Mbps，L5降至90Mbps，L5小于最大网速100Mbps，不会出现拥塞，此时，网络的资源利用率有L1，L2，L3的资源利用率均为50％，L4的资源利用率为100％。
由此可见，丢弃Flow2的报文的资源利用率比丢弃Flow1的报文的资源利用率低，也即丢弃经过路由器跳数越大的流上传输的数据报文会导致更多的、距拥塞点更远的链路受到影响，从而降低网络整体的资源利用率，反之丢弃经过路由器跳数越小的流上传输的数据报文会提高网络整体的资源利用率。
参阅图4，图4为本申请提供一种网络设备400，该网络设备包括但不限于：智能终端、计算机、服务器、交换机、路由器等能够发送或转发数据报文的设备。关于本实施例涉及的术语的含义以及举例，可以参考图1对应的实施例。此处不再赘述。该网络设备400包括：
收发单元401，用于接收网络中传输的数据报文；
处理单元402，用于根据所述数据报文的源地址和目的地址得到所述数据报文的源端到目的端的路径信息，所述路径信息为：所述数据报文从源端到目的端所经过的路由器的总跳数或所述数据报文从源端到目的端的时延。
本申请提供的网络设备在接收到数据报文后，获取数据报文的源地址和目的地址，依据源地址和目的地址得到该源端到目的端的路径信息，进而使得网络设备能够获取数据包的路径信息，所以其具有得到数据包的路径信息的优点。
可选的，上述处理单元402还可以用于执行上述如图1所示实施例中的步骤102、步骤103以及步骤102、步骤103的细化方案。
参阅图5，图5为本申请实施例提供的一种网络设备50的简化示意图，该网络设备50包括但不限于：手机、平板电脑、服务器、基站、移动交换中心等设备。如图5所示，该网络设备50包括处理器501、存储器502、收发器503和总线504。收发器503用于与外部设备之间收发数据。网络设备50中的处理器501的数量可以是一个或多个。本申请的一些实施例中，处理器501、存储器502和收发器503可通过总线系统或其他方式连接。网络设备50可以用于执行图1所示的方法。关于本实施例涉及的术语的含义以及举例，可以参考图1对应的实施例。此处不再赘述。
收发器503，用于接收网络中传输的数据报文或接收网络中扩展的路由报文；
其中，存储器502中存储程序代码。处理器501用于调用存储器502中存储的程序代码，用于执行以下操作：
处理器501，用于据所述数据报文的源地址和目的地址得到所述数据报文的源端到目的端的路径信息，所述路径信息为：所述数据报文从源端到目的端所经过的路由器的总跳数或所述数据报文从源端到目的端的时延。
可选的，上述处理器701具体，还用于执行上图1所示实施例中的步骤102、步骤103以及步骤102、步骤103的细化方案。上述步骤的具体描述可以参见如图1所示实施例中的描述，这里不在赘述。
需要说明的是，这里的处理器501可以是一个处理元件，也可以是多个处理元件的统称。例如，该处理元件可以是中央处理器(Central Processing Unit，CPU)，也可以是特定集成电路(Application Specific Integrated Circuit，ASIC)，或者是被配置成实施本申请实施例的一个或多个集成电路，例如：一个或多个微处理器(digital signal processor，DSP)，或，一个或者多个现场可编程门阵列(Field Programmable Gate Array，FPGA)。
存储器503可以是一个存储装置，也可以是多个存储元件的统称，且用于存储可执行程序代码或应用程序运行装置运行所需要参数、数据等。且存储器503可以包括随机存储器(RAM)，也可以包括非易失性存储器(non-volatile memory)，例如磁盘存储器，闪存(Flash)等。
总线504可以是工业标准体系结构(Industry Standard Architecture，ISA)总线、外部设备互连(Peripheral Component，PCI)总线或扩展工业标准体系结构(Extended Industry Standard Architecture，EISA)总线等。该总线可以分为地址总线、数据总线、控制总线等。为便于表示，图5中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
该网络设备还可以包括输入输出装置，连接于总线504，以通过总线与处理器501等其它部分连接。该输入输出装置可以为操作人员提供一输入界面，以便操作人员通过该输入界面选择布控项，还可以是其它接口，可通过该接口外接其它设备。
需要说明的是，对于前述的各个方法实施例，为了简单描述，故将其都表述为一系列的动作组合，但是本领域技术人员应该知悉，本申请并不受所描述的动作顺序的限制，因为依据本申请，某一些步骤可以采用其他顺序或者同时进行。其次，本领域技术人员也应该知悉，说明书中所描述的实施例均属于优选实施例，所涉及的动作和模块并不一定是本申请所必须的。
在上述实施例中，对各个实施例的描述都各有侧重，某个实施例中没有详细描述的部分，可以参见其他实施例的相关描述。
本领域普通技术人员可以理解上述实施例的各种方法中的全部或部分步骤是可以通过程序来指令相关的硬件来完成，该程序可以存储于一计算机可读存储介质中，存储介质可以包括：闪存盘、只读存储器(英文：Read-Only Memory，简称：ROM)、随机存取器(英文：Random Access Memory，简称：RAM)、磁盘或光盘等。
以上对本申请实施例所提供的内容下载方法及相关设备、系统进行了详细介绍，本文中应用了具体个例对本申请的原理及实施方式进行了阐述，以上实施例的说明只是用于帮助理解本申请的方法及其核心思想；同时，对于本领域的一般技术人员，依据本申请的思想，在具体实施方式及应用范围上均会有改变之处，综上所述，本说明书内容不应理解为对本申请的限制。

Claims (16)

  1. 一种数据报文的路径信息获取方法，其特征在于，所述方法包括如下步骤：
    网络设备接收网络中传输的数据报文；
    网络设备根据所述数据报文的源地址和目的地址得到所述数据报文的源端到目的端的路径信息，所述路径信息为：所述数据报文从源端到目的端所经过的路由器的总跳数或所述数据报文从源端到目的端的时延。
  2. 根据权利要求1所述的方法，其特征在于，当所述路径信息包括所述路由器的总跳数时，所述网络设备根据所述数据报文的源地址和目的地址得到所述数据报文的源端到目的端的路径信息具体，包括：
    依据所述数据报文的生存时间值计算出所述数据报文从源端到网络设备的路由器的第一跳数，依据所述数据报文的目的地址从地址与路由器跳数的映射关系中查询出所述网络设备到目的地址的路由器的第二跳数，第一跳数和第二跳数的和即为源端到目的端所经过的路由器的总跳数。
  3. 根据权利要求1所述的方法，其特征在于，当所述路径信息包括所述路由器的总跳数时，所述网络设备根据所述数据报文的源地址和目的地址得到所述数据报文的源端到目的端的路径信息具体，包括：
    依据所述数据报文的源地址从地址与路由器跳数的映射关系中查询出源端到网络设备的路由器的第三跳数，依据所述数据报文的目的地址从地址与路由器跳数的映射关系查询出所述网络设备到目的地址的路由器的第四跳数，第三跳数和第四跳数的和即为源端到目的端所经过的路由器的总跳数。
  4. 根据权利要求1所述的方法，其特征在于，当所述路径信息包括所述路由器的总跳数时，所述网络设备根据所述数据报文的源地址和目的地址得到所述数据报文的源端到目的端的路径信息具体，包括：
    当所述数据报文中未包括所述路由器的总跳数时，所述网络设备发送查询报文查询出所述网络设备到目的端的第五跳数，所述第五跳数与源端到所述网络设备的第六跳数的和即为所述路由器的总跳数，将所述路由器的总跳数填充至所述数据报文的扩展字段，所述查询报文的目的地址与所述数据报文的目的地址相同。
  5. 根据权利要求2-4任一项所述的方法，其特征在于，所述方法还包括：
    将所述路由器的总跳数加载在所述数据报文对应业务报文的扩展字段中。
  6. 根据权利要求2-4任一项所述的方法，其特征在于，所述地址与路由器跳数的映射关系具体，包括：
    网络设备接收网络中扩散的路由报文，所述路由报文包括：地址以及从所述地址扩散至所述网络设备所经过的每个网段的网段路由器跳数，网络设备依据网络设备所在网段的网络拓扑得到网络设备到边界设备的第七跳数，每个网段的网段路由器跳数与所述第七跳数的和加1即为网络设备到所述地址的路由器的总跳数，将所述地址与所述地址的路由器的总跳数的映射关系保存；所述边界设备为所述网络设备所在网段发送数据报文至所述地址所经过的所述网络设备所在网段的最后一个设备。
  7. 根据权利要求1-4任一项所述的方法，其特征在于，所述方法还包括：
    在网络拥塞时，网络设备依据所述路径信息确定所述数据报文的丢包策略。
  8. 根据权利要求1-4任一项所述的方法，其特征在于，所述方法还包括：
    网络设备依据所述路径信息确定所述数据报文的传输速率。
  9. 一种网络设备，其特征在于，所述网络设备包括：
    收发单元，用于接收网络中传输的数据报文；
    处理单元，用于根据所述数据报文的源地址和目的地址得到所述数据报文的源端到目的端的路径信息，所述路径信息为：所述数据报文从源端到目的端所经过的路由器的总跳数或所述数据报文从源端到目的端的时延。
  10. 根据权利要求9所述的网络设备，其特征在于，当所述路径信息包括所述路由器的总跳数时，所述处理单元具体，用于：
    依据所述数据报文的生存时间值计算出所述数据报文从源端到网络设备的路由器的第一跳数，依据所述数据报文的目的地址从地址与路由器跳数的映射关系中查询出所述网络设备到目的地址的路由器的第二跳数，第一跳数和第二跳数的和即为源端到目的端所经过的路由器的总跳数。
  11. 根据权利要求9所述的网络设备，其特征在于，当所述路径信息包括所述路由器的总跳数时，所述处理单元具体，用于：
    依据所述数据报文的源地址从地址与路由器跳数的映射关系中查询出源端到网络设备的路由器的第三跳数，依据所述数据报文的目的地址从地址与路由器跳数的映射关系查询出所述网络设备到目的地址的路由器的第四跳数，第三跳数和第四跳数的和即为源端到目的端所经过的路由器的总跳数。
  12. 根据权利要求9所述的网络设备，其特征在于，当所述路径信息包括所述路由器的总跳数时，所述处理单元具体，用于：
    当所述数据报文中未包括所述路由器的总跳数时，所述网络设备发送查询报文查询出所述网络设备到目的端的第五跳数，所述第五跳数与源端到所述网络设备的第六跳数的和即为所述路由器的总跳数，将所述路由器的总跳数填充至所述数据报文的扩展字段，所述查询报文的目的地址与所述数据报文的目的地址相同。
  13. 根据权利要求9-12任一项所述的网络设备，其特征在于，所述处理单元，还用于将所述路由器的总跳数加载在所述数据报文对应业务报文的扩展字段中。
  14. 根据权利要求9-12任一项所述的网络设备，其特征在于，
    所述收发单元，还用于接收网络中扩散的路由报文，所述路由报文包括：地址以及从所述地址扩散至所述网络设备所经过的每个网段的网段路由器跳数；
    所述处理单元，用于依据网络设备所在网段的网络拓扑得到网络设备到边界设备的第七跳数，每个网段的网段路由器跳数与所述第七跳数的和加1即为网络设备到所述地址的路由器的总跳数，将所述地址与所述地址的路由器的总跳数的映射关系保存；所述边界设备为所述网络设备所在网段发送数据报文至所述地址所经过的所述网络设备所在网段的最后一个设备。
  15. 根据权利要求9-12任一项所述的网络设备，其特征在于，
    所述处理单元，还用于在网络拥塞时，依据所述路径信息确定所述数据报文的丢包策 略。
  16. 根据权利要求9-12任一项所述的网络设备，其特征在于，
    所述处理单元，还用于依据所述路径信息确定所述数据报文的传输速率。
PCT/CN2017/092387 2016-07-12 2017-07-10 一种数据报文的路径信息获取方法及设备 WO2018010618A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
KR1020197001964A KR102208873B1 (ko) 2016-07-12 2017-07-10 데이터 패킷에 관한 경로 정보를 취득하는 방법 및 디바이스
EP17826954.4A EP3471351B1 (en) 2016-07-12 2017-07-10 Method and device for acquiring path information about data packet
JP2019501729A JP6801075B2 (ja) 2016-07-12 2017-07-10 データ・パケットのパス情報を得る方法及びデバイス
US16/241,006 US11240164B2 (en) 2016-07-12 2019-01-07 Method for obtaining path information of data packet and device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610547906.4A CN107612829B (zh) 2016-07-12 2016-07-12 一种数据报文的路径信息获取方法及设备
CN201610547906.4 2016-07-12

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/241,006 Continuation US11240164B2 (en) 2016-07-12 2019-01-07 Method for obtaining path information of data packet and device

Publications (1)

Publication Number Publication Date
WO2018010618A1 true WO2018010618A1 (zh) 2018-01-18

Family

ID=60952815

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/092387 WO2018010618A1 (zh) 2016-07-12 2017-07-10 一种数据报文的路径信息获取方法及设备

Country Status (6)

Country Link
US (1) US11240164B2 (zh)
EP (1) EP3471351B1 (zh)
JP (1) JP6801075B2 (zh)
KR (1) KR102208873B1 (zh)
CN (1) CN107612829B (zh)
WO (1) WO2018010618A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116232983A (zh) * 2022-12-29 2023-06-06 中国联合网络通信集团有限公司 一种以太网业务的路由确定方法、装置、设备及存储介质

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115484655A (zh) * 2021-05-31 2022-12-16 华为技术有限公司 一种业务报文的转发方法、网络设备以及无线网络

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080205292A1 (en) * 2007-02-26 2008-08-28 Lorraine Denby Detection of Asymmetric Network Routes
CN101479998A (zh) * 2006-06-23 2009-07-08 卢森特技术有限公司 用于实时服务的优先序识别的方法和设备
CN101572649A (zh) * 2008-04-30 2009-11-04 华为技术有限公司 一种时隙分配方法及装置

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7319700B1 (en) * 2000-12-29 2008-01-15 Juniper Networks, Inc. Communicating constraint information for determining a path subject to such constraints
AU2003300900A1 (en) * 2002-12-13 2004-07-09 Internap Network Services Corporation Topology aware route control
JP4222188B2 (ja) * 2003-11-11 2009-02-12 沖電気工業株式会社 通信端末および通信ネットワーク
US8155126B1 (en) * 2005-06-03 2012-04-10 At&T Intellectual Property Ii, L.P. Method and apparatus for inferring network paths
US8457005B2 (en) 2006-11-08 2013-06-04 Trellisware Technologies, Inc. Method and system for establishing cooperative routing in wireless networks
JP4798583B2 (ja) * 2007-06-28 2011-10-19 株式会社国際電気通信基礎技術研究所 無線ネットワーク、それに用いられる無線装置、それにおける転送端末の選択をコンピュータに実行させるためのプログラムおよびそのプログラムを記録したコンピュータ読み取り可能な記録媒体
JP4978796B2 (ja) 2007-10-26 2012-07-18 富士通株式会社 無線装置およびそれを備えた無線ネットワーク
CN101505279B (zh) * 2009-03-20 2012-07-25 中国人民解放军信息工程大学 一种路由查找方法和装置
CN101594264B (zh) * 2009-06-19 2012-03-14 清华大学 虚拟链路状态检测方法
US20130121192A1 (en) * 2011-11-10 2013-05-16 Path Solutions, Inc. Measuring message stream quality across networks
WO2014103014A1 (ja) 2012-12-28 2014-07-03 株式会社日立製作所 中継装置、及び中継方法
CN103428032B (zh) * 2013-08-19 2016-11-09 杭州华三通信技术有限公司 一种攻击定位、辅助定位装置和方法
US9647925B2 (en) * 2014-11-05 2017-05-09 Huawei Technologies Co., Ltd. System and method for data path validation and verification
US9729422B2 (en) * 2015-03-13 2017-08-08 Cisco Technology, Inc. Trace feature across the network (depth and breadth)-wise

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101479998A (zh) * 2006-06-23 2009-07-08 卢森特技术有限公司 用于实时服务的优先序识别的方法和设备
US20080205292A1 (en) * 2007-02-26 2008-08-28 Lorraine Denby Detection of Asymmetric Network Routes
CN101572649A (zh) * 2008-04-30 2009-11-04 华为技术有限公司 一种时隙分配方法及装置

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116232983A (zh) * 2022-12-29 2023-06-06 中国联合网络通信集团有限公司 一种以太网业务的路由确定方法、装置、设备及存储介质
CN116232983B (zh) * 2022-12-29 2024-05-03 中国联合网络通信集团有限公司 一种以太网业务的路由确定方法、装置、设备及存储介质

Also Published As

Publication number Publication date
JP2019521609A (ja) 2019-07-25
EP3471351A1 (en) 2019-04-17
KR102208873B1 (ko) 2021-01-28
US11240164B2 (en) 2022-02-01
KR20190020784A (ko) 2019-03-04
US20190140965A1 (en) 2019-05-09
CN107612829A (zh) 2018-01-19
EP3471351A4 (en) 2019-05-22
JP6801075B2 (ja) 2020-12-16
EP3471351B1 (en) 2021-02-17
CN107612829B (zh) 2021-11-26

Similar Documents

Publication Publication Date Title
US11770309B2 (en) On-demand probing for quality of experience metrics
US11005729B2 (en) Satisfying service level agreement metrics for unknown applications
US10958555B2 (en) Real-time application-driven synthetic probing
EP3654589A1 (en) Predicting application quality of experience metrics using adaptive machine learned probes
CN109981471B (zh) 一种缓解拥塞的方法、设备和系统
US10574763B2 (en) Session-identifer based TWAMP data session provisioning in computer networks
EP3716541B1 (en) Method, device and system for determining message forwarding path
WO2017025021A1 (zh) 一种处理流表的方法及装置
US9998364B2 (en) Method for processing packet and forwarder
WO2017198131A1 (zh) 用于重定向数据流的方法和系统、网络设备和控制设备
WO2015172668A1 (zh) 网络中拥塞窗口的确定方法和装置
WO2022213817A1 (zh) 路由方法和路由装置
WO2015165249A1 (zh) 一种建立业务路径的方法和设备
WO2018010618A1 (zh) 一种数据报文的路径信息获取方法及设备
US20220070736A1 (en) Traffic steering device
WO2015039616A1 (zh) 一种报文处理方法及设备
CN112714072B (zh) 一种调整发送速率的方法及装置
WO2019119836A1 (zh) 报文处理的方法和设备
CN114124804A (zh) 一种通信方法、装置以及系统
WO2024060590A1 (zh) 确定性业务报文的转发方法、边界路由器及控制器
WO2022242661A1 (zh) 通信处理方法及相关设备
CN112087380A (zh) 一种流量调节方法及装置

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

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019501729

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2017826954

Country of ref document: EP

Effective date: 20190108

ENP Entry into the national phase

Ref document number: 20197001964

Country of ref document: KR

Kind code of ref document: A