WO2013150691A1 - Serveur de gestion et procédé de traitement de flux - Google Patents

Serveur de gestion et procédé de traitement de flux Download PDF

Info

Publication number
WO2013150691A1
WO2013150691A1 PCT/JP2012/083498 JP2012083498W WO2013150691A1 WO 2013150691 A1 WO2013150691 A1 WO 2013150691A1 JP 2012083498 W JP2012083498 W JP 2012083498W WO 2013150691 A1 WO2013150691 A1 WO 2013150691A1
Authority
WO
WIPO (PCT)
Prior art keywords
flow
communication
traffic
path
information
Prior art date
Application number
PCT/JP2012/083498
Other languages
English (en)
Japanese (ja)
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 JP2014509003A priority Critical patent/JP5883926B2/ja
Publication of WO2013150691A1 publication Critical patent/WO2013150691A1/fr

Links

Images

Classifications

    • 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/02—Capturing of monitoring data
    • H04L43/026—Capturing of monitoring data using flow identification
    • 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/0876—Network utilisation, e.g. volume of load or congestion level

Definitions

  • the present invention relates to a management server and a flow processing method.
  • a flow is a logically distinct unit of traffic (a group). For example, a set of frames with the same source address and destination address set is divided into one same flow.
  • Non-Patent Document 1 for a plurality of flows flowing on the network system, means for measuring the traffic of the flows as measured data is implemented in each switch in the network system. As a result, the administrator who has obtained the measured data of each switch can identify the switch where the flow is concentrated in the network system, and change the concentrated switch to a high-performance switch. Overall congestion can be avoided.
  • the Fat Tree configuration of the network topology may be used.
  • multipaths in the Fat Tree configuration it is possible to use multiple paths simultaneously as paths for transmitting the same flow, and the concentration of traffic to specific switches on the path route can be suppressed. .
  • the actual measurement data of each switch in the network system is data indicating the communication status of the network system with high accuracy, but the actual measurement cost is high. This is because the actual measurement means shown in Non-Patent Document 1 and the like is prepared in advance in all the switches of the network system, and the processing capability of each switch is not only the data transfer process that is the original task of each switch but also the transferred data. This is because the processing capability for operating the actual measurement processing of the quantity is necessary.
  • what is more burdensome in the data amount measurement process is the process of specifying the flow to which each data frame belongs than the data amount acquisition process of each data frame. Since the flow specific information to which each data frame belongs is stored at various frame positions in each data frame, the flow specific information position specifying process or the flow specific information from the specified position is read. By performing the processing for each of a large number of data frames, the data amount actual measurement processing becomes a heavy load.
  • the main object of the present invention is to solve the above-described problems and to acquire highly accurate data indicating the communication status of the network system at a low cost.
  • the present invention is a flow processing method by a management server that processes a traffic amount of a flow that defines communication of a data frame from a transmission source device to a destination device
  • the management server is For each flow, collect flow correspondence information of flow identification information for identifying the flow, route information of the identified flow, and traffic of the identified flow from the transmission source device, For each flow correspondence information collected from the transmission source device, for each communication device included in the flow path information, the communication amount of the flow corresponding to the flow specifying information is added to the communication amount flowing through the communication device.
  • the amount of communication flowing through each of the communication devices is created as traffic estimation data. Other means will be described later.
  • FIG. 3A shows the hardware configuration of the apparatus
  • FIG. 3B shows an ID address correspondence table.
  • FIG. 4 shows the detail of the function structure of FIG. 4 regarding one Embodiment of this invention.
  • FIG. 7A shows a flow information individual table
  • FIG. 7B shows each table read by the traffic estimation unit.
  • FIG. 8A shows a path route table
  • FIG. 8B shows a traffic estimation table.
  • It is a flowchart which shows the transmission process of the data frame of the network system regarding one Embodiment of this invention.
  • It is a flowchart which shows the route change process of the network system regarding one Embodiment of this invention.
  • FIG. 11A shows the state before the route is changed, and FIG. 11B shows the time when the route is changed. It is explanatory drawing which shows the path
  • FIG. 1 is a configuration diagram showing a network system.
  • the network topology of each device illustrated in FIG. 1 is merely an example, and the number of devices and the connection configuration between the devices may be different configurations.
  • the network system includes an ASW2 (2a to 2c) that is an aggregation switch, a TSW3 (3a to 3d) that is a ToR (Top of Rack) switch, and a physical machine 7, each link (L11 to L13, L21 to L23, L31 to L33, L41 to L43, and L91 to L94). That is, the communication device of the network system includes each device (ASW2, TSW3, physical machine 7) and a link between the devices.
  • the management server 1 is connected to each physical machine 7 in order to estimate the amount of flow that passes through each link in the network system.
  • the flow is a collection of information of data frames having common attributes transferred within the network system.
  • Each ASW 2 has a Fat Tree configuration connected to each TSW 3 with a full mesh, and each TSW 3 accommodates one physical machine 7.
  • VSW8 and VM9 which are virtual machines constructed by software using hardware resources, are configured.
  • VSW8 (8a to 8d) is a virtual switch connected to TSW3, and VM9 (VM911 to 913, VM921 to 923, VM931 to 933, VM941 to 943) is a virtual computer accommodated in VSW8.
  • a flow is a data frame transferred from one VM 9 to another VM 9.
  • the starting point (source) and end point (destination) of the flow are not limited to the VM 9 and may be other devices (ASW2, TSW3, physical machine 7, VSW8).
  • FIG. 2 is an explanatory diagram showing data frame transmission processing in a tunneling environment.
  • the flow f1 is a flow that sequentially passes from the transmission source: VM911 ⁇ VSW8a ⁇ TSW3a ⁇ ASW2a ⁇ TSW3d ⁇ VSW8d ⁇ VM941 (see also FIG. 12A described later).
  • Each data frame of the flow f1 includes, in addition to data and a footer, a VMSA (Virtual Machine Source Address) indicating a transmission source of the flow f1 as information for specifying the flow of the flow f1 (hereinafter, flow specifying information), a flow A pair with a VMDA (Virtual Machine Destination Address) indicating the destination of f1 is attached to the header.
  • VMSA Virtual Machine Source Address
  • the flow f1 is transferred using a path (path passing through VSW8a ⁇ TSW3a ⁇ ASW2a ⁇ TSW3d ⁇ VSW8d) which is a tunnel of VXLAN (Virtual eXtensible Local Area Network).
  • path specifying information VSSA (Virtual Switch Source Address) indicating the source of the path and VSDA ( A pair of (Virtual-Switch-Destination-Address) is encapsulated in the header.
  • Each address information may be a device address assigned to each virtual machine or an interface address assigned to each network interface accommodated by the virtual machine.
  • the specific information includes a source / destination MAC (Media Access Control) address, a source / destination IP address, a source / destination port number, Information indicating a difference in communication of a specific target, such as a UUID (Universally Unique Identifier) of a device and a protocol number, may be configured alone or as a combination of a plurality of pieces of information.
  • each parameter of these enumerated specific information is an example to the last, It is not limited to the enumerated parameter, You may use arbitrary parameters as specific information.
  • the tunnel is not necessarily VXLAN, and may be another tunnel system in which a header is newly added to the original frame format.
  • FIG. 3 is a configuration diagram showing a hardware configuration of each device of the network system.
  • Each device shown in FIG. 3A includes a CPU 111, a memory 112, a storage device 113, an external medium reading device 114, a communication device 115, an input device 116, an output device 117, and one or more ports 118.
  • a program and data being executed are recorded.
  • Programs and data in each device may be stored in the memory 112 in advance, may be stored in the storage device 113, or may be input from the external medium reading device 114. Further, the function realized by the corresponding program may be realized by dedicated hardware. Examples of the storage medium handled by the external medium reading device 114 include an SD memory card and a CD-ROM.
  • the port 118 is a network interface for communicating with other devices, and performs communication based on, for example, the Ethernet (registered trademark) standard defined by IEEE802.3.
  • the ID address correspondence table shown in FIG. 3B is data stored in the storage device 113 of each device shown in FIG.
  • the ID address correspondence table is a table in which “machine ID” in the left column and “machine address (2 digits ⁇ 6 MAC addresses are illustrated in the figure)” in the right column are associated with each other on a 1: 1 basis.
  • the device uses the “machine ID” associated with the ID address correspondence table by reversible conversion from these pieces of address information.
  • the data amount of the data frame can be compressed.
  • one ID may be associated with a combination of a plurality of address information.
  • FIG. 4 is a configuration diagram showing a functional configuration of each device of the network system.
  • FIG. 4 is a drawing for enumerating the components of each device, and details of each component will be made clear from FIG.
  • the management server 1 includes an OS 11, a transfer unit 12, a transfer table 13, a path route table 14, a traffic management unit 15, and a route management unit 16.
  • the physical machine 7 includes an OS 71, a transfer unit 72, a transfer table 73, a traffic measurement unit 74, a VSW 8, and a VM 9.
  • the VSW 8 includes a management server communication unit 81, a path control unit 82, a DA correspondence table 83, a tunnel processing unit 84, and a VSW control unit 85.
  • the VSW control unit 85 is a virtual switch configured as a virtual computer capable of executing the functions of a computer with software using components on the physical machine 7 such as the CPU 111, the memory 112, and the communication device 115. SW is controlled.
  • the VM control unit 91 reads a VM disk image 92 stored in a storage device 113 that is built in or externally connected to the physical machine 7, uses the CPU 111 of the physical machine 7 and a partial area of the memory 112, and physically Inside the machine 7, a VM 9 is generated as a virtual machine that can execute the function of a computer with software. Since the VM 9 is connected to the bus of the physical machine 7, each interface (external medium reading device 114, communication device 115, input device 116, output device 117) of the physical machine 7 can be used.
  • FIG. 5 is a block diagram showing details of the functional configuration of FIG. Details of each component shown in FIG. 5 (input / output relationship indicated by arrows in FIG. 5 and the like) will be clarified in FIG. 6 and subsequent figures.
  • the traffic measurement unit 74 includes a flow information measurement unit 41, a flow information individual table 42, and a management server communication unit 43.
  • the traffic management unit 15 includes a physical machine communication unit 51, a flow information recording unit 52, a flow information aggregation table 53, a traffic estimation unit 54, a traffic recording unit 55, a traffic estimation table 56, and a path change determination unit 57. And have.
  • the route management unit 16 includes a physical machine communication unit 61, a path route management unit 62, a DA correspondence table 63, a VM accommodation management table 64, an SA correspondence table 65, and a route map 66.
  • the route management unit 16 collects this information from each device.
  • the route map 66 is data indicating a network topology (links between devices).
  • FIG. 6 is a flowchart showing traffic estimation processing.
  • the flow information measurement unit 41 records the amount of traffic transmitted from the VSW 8, that is, the number of data frames in a predetermined time, in the flow information individual table 42.
  • the management server communication unit 43 reads the traffic amount recorded in the flow information individual table 42 in S201, and transmits it to the management server 1 at regular intervals in association with the flow identification information.
  • the physical machine communication unit 51 passes the traffic amount information received in S ⁇ b> 202 to the flow information recording unit 52.
  • the flow information recording unit 52 writes the information received in S203 into the flow information aggregation table 53 (details are described in FIG. 7A).
  • the traffic estimation unit 54 determines the flow information aggregation table 53, the path route table 14, the DA correspondence table 63, the VM accommodation management table 64 (see FIG. 5), and the SA correspondence table 65 (see FIG. 5).
  • the route map 66 is read.
  • the traffic estimation unit 54 calculates a communication amount for each flow specifying information based on each table read in S205 (for details, see FIG. 7B and FIG. 8).
  • the traffic estimation unit 54 passes the calculation result of S206 to the traffic recording unit 55.
  • the traffic recording unit 55 writes the calculation result of S207 into the traffic estimation table 56.
  • FIG. 7 is a block diagram showing details of each table in FIG.
  • stored data may be continuously accumulated, or data older than a predetermined period may be deleted.
  • time t is arbitrary and may represent date and time.
  • time measurement intervals indicated as t + 1, t + 2,... are not limited to certain intervals, and may be arbitrary intervals. For example, it may be 100 milliseconds or 1 second or 10 seconds.
  • the flow information individual table 42 Since the flow information individual table 42 is created for each physical machine 7 to be accommodated, the flow information individual table 42 in the first physical machine 7 that is the transmission source of the flow f1 and the transmission source of the flow f2. The contents may differ from the flow information individual table 42 in the second physical machine 7.
  • the flow information aggregation table 53 written by the flow information recording unit 52 is a table in which the management server 1 aggregates the data contents of one or more flow information individual tables 42, and the stored data format is individual flow information. The same as the table 42. As in the flow information individual table 42, the information in the flow information aggregation table 53 may be updated at regular intervals or may be stored in the past. The flow information aggregation table 53 may be divided into a plurality of tables instead of a single table.
  • FIG. 7B shows each table read by the traffic estimation unit 54 in S205.
  • the contents of each table are continuously updated in response to the notification from the end node VSW 8 of the path according to the setting status of the path that changes every moment.
  • the traffic estimation unit 54 clarifies the details of the process of specifying the path specifying information of the path through which the flow passes (hereinafter referred to as the path solving process) based on the flow specifying information.
  • the VM accommodation management table 64 is correspondence data between the VSW 8 (the VSID that is the device ID) accommodated in the same physical machine 7 and the VM 9, and is a table showing the accommodation relationship between the VSW 8 and the VM 9. For example, in the VSW 8a in FIG. 1, three VMs 9 (VMs 911 to 913) are accommodated, and this accommodation relationship is reflected in the records of the first to third rows in the VM accommodation management table 64. Yes.
  • the traffic estimation unit 54 refers to the VM accommodation management table 64 to resolve the path specifying information (VSID) from the flow specifying information (VMSA).
  • the DA correspondence table 63 is a table showing a correspondence relationship between the VM 9 indicated by the VMDA and the VSW 8 (VSDA) in which the VM 9 is accommodated.
  • the traffic estimation unit 54 refers to the DA correspondence table 63 to resolve the path identification information (VSDA) from the flow identification information (VMDA).
  • VSDA path identification information
  • the VMDA of the flow f1 is the VM 941
  • the VM 941 is accommodated in the VSW 8d. Therefore, the correspondence relationship between the VMDA “VM 941” and the VSDA “VSW 8d” is described in the third row of the DA correspondence table 63. Yes.
  • the SA correspondence table 65 is a table showing the correspondence between the VSID that is the ID of the VSW 8 and the VSSA assigned to the VSW 8. The reason why three VSSAs (VSW8a1 to VSW8a3) are assigned to one VSW8 (for example, VSW8a) is because ASW2 through which paths associated with each VSSA pass is different.
  • the traffic estimation unit 54 refers to the SA correspondence table 65 to resolve the path specifying information (VSSA) from the path specifying information (VSID).
  • the traffic estimation unit 54 uses the DA correspondence table 63, the VM accommodation management table 64, and the SA correspondence table 65 to identify the flow identification information (if flow f1, VMSA “VM911”, VMDA “VM941”). )),
  • the path identification information (VSSA “VSW8a1”, VSDA “VSW8d”) can be resolved.
  • the resolved path specifying information is a header that is encapsulated in a flow, as described in FIG.
  • FIG. 8 is a configuration diagram showing details of each table of the network system.
  • the path route table 14 in FIG. 8A is a table in which, for each path specifying information, the route through which the path passes is described in the order of the link that passes.
  • the first line of the path route table 14 describes that the path specifying information (VSSA “VSW8a1”, VSDA “VSW8d”) through which the flow f1 passes passes in the order of link L11 ⁇ link L41.
  • the path route table 14 is another information that can specify the path route instead of holding the path route itself as information associated with the path specifying information (a path determination function held by the ASW2 or TSW3, The path of the path using specific information as an argument may be associated.
  • the traffic estimation table 56 in FIG. 8B stores, for each link shown in the route map 66, traffic flowing through the link (flow communication amount) for each component indicated by the flow identification information.
  • the flow identification information of the flow flowing in the link L11 is “VM911 ⁇ VM943 flow f1”, and the flow traffic amount of the flow f1 alone is Since it is “100” and there is no other flow flowing in the link L11, it is described that the total amount of flow traffic is also “100”.
  • the traffic estimation unit 54 specifies the record of the link L11 and the record of the link L41 by referring to the path route table 14 as a record in the traffic estimation table 56 for registering the flow traffic of the flow f1. . Then, the traffic estimation unit 54 stores the flow identification information of the flow f1 and the flow traffic of the flow f1 in association with each of the identified records of the links L11 and L41. That is, the traffic estimation unit 54 creates the traffic estimation table 56 by performing an operation for obtaining the amount of flow traffic for each link through which the path passes based on the path identification information solved from the flow identification information.
  • the requested flow traffic amount may not be for each link, but may be the total value of each flow traffic amount or the traffic amount of a flow related to a specific tenant. That is, here, the record of the traffic estimation table 56 is a record for each link, but not only the link but also a record for each device (ASW2, TSW3) connected by the link may be added to the traffic estimation table 56. . In this case, the traffic estimation unit 54 may create the traffic estimation table 56 by performing a calculation for obtaining the amount of flow traffic for each link and each device through which the path passes.
  • the flow communication amount obtained for each link or device may be a total value of flows grouped according to a predetermined standard. For example, the total value of each flow communication amount may be used, or the communication amount of a flow related to a specific tenant over a plurality of links may be used.
  • the management server 1 can utilize this traffic estimation table 56 for various purposes as described below. Hereinafter, three uses of the traffic estimation table 56 will be exemplified.
  • the first application is network monitoring.
  • the management server 1 reads the traffic amount information of the traffic estimation table 56 from, for example, the management server 1 and provides a GUI (Graphical User Interface) that is displayed on a display device built in or connected to the management server 1.
  • GUI Graphic User Interface
  • each flow passing on the network as shown in FIG. 12 is displayed, or the total amount of flow traffic in the traffic estimation table 56 is displayed on each link in the network topology diagram as shown in FIG. Or display.
  • the GUI may be displayed in such a manner that all flows are shown separately. For example, traffic of the own tenant, traffic of other tenants, and surplus traffic may be displayed.
  • the information to be displayed may be acquired from each physical machine 7 instead of being acquired from the management server 1.
  • This GUI display makes it clear which route the traffic between which end nodes flows, so even if congestion or failure occurs, the affected end node can be immediately identified. be able to.
  • the second application is automatic fault detection.
  • the management server 1 separately acquires actual traffic volume measurement data from each switch (ASW2, TSW3, VSW8) in addition to the estimation data of the traffic estimation table 56.
  • the management server 1 can perform verification, for example, by detecting a failure or a mistake in a route rule by comparing data contents (such as traffic type and amount) with the estimated data and the measured data.
  • the management server 1 may be connected not only to each physical machine 7 but also to ASW 2 and TSW 3.
  • the range of influence can be specified when congestion or failure occurs in the network system.
  • Japanese Patent Application Laid-Open No. 2007-189615 describes that when a failure or congestion occurs, information is acquired from the network device and its influence range is analyzed.
  • the network range that can be collected is limited only by using the actual traffic volume measurement data without using the estimated data of the traffic estimation table 56, and therefore the range of influence when congestion or failure occurs is specified. Is difficult.
  • the third use is to change the flow path.
  • the flow traffic amount for each link is known in time series, so that it is possible to detect that a certain link is congested at a current time or a certain time in the future.
  • FIG. 9 is a flowchart showing data frame transmission processing in the network system.
  • FIG. 9 shows processing of the physical machine 7 on the transmission side (apparatus that accommodates the VSW 8a) in the flow f1.
  • the tunnel processing unit 84 encapsulates (adds a header) the path specifying information solved in S102 to the data frame of S101.
  • the tunnel processing unit 84 passes the data frame of S103 to the VSW control unit 85.
  • the VSW control unit 85 passes the data frame of S ⁇ b> 104 to the transfer unit 72.
  • the transfer unit 72 refers to the transfer table 73, uses the path specifying information encapsulated in the data frame of S104 as a search key, and next hops of the path route indicated by the path specifying information from the transfer table 73 (here, The TSW 3a) connected by the link L91 is specified.
  • the transfer unit 72 transmits the data frame of S104 to the identified next hop.
  • FIG. 10 is a flowchart showing the route change processing of the network system.
  • the traffic estimation table 56 describes the flow traffic volume for each link, and performs processing to distribute the route through which the data frame passes so that traffic is not biased to the link where the flow traffic volume is large and congestion may occur. This will be described below.
  • the route change determination unit 57 monitors the traffic estimation table 56 and detects a link in which the total amount of flow traffic using the link exceeds a predetermined threshold (see FIG. 11 for details). Instead of the link detection processing exceeding the predetermined threshold based on the traffic estimation table 56, the predetermined threshold is set by the notification processing to the management server 1 before transmission of a flow requiring a wide band from another device (such as VM9). You may detect links that exceed.
  • the flow specifying information of the flow group passing through the link detected in S301 is associated with the link exceeding the predetermined threshold value and notified to the path route management unit 62 as the target flow for route change. It should be noted that notification may be made after narrowing down to a part of a flow group passing through the link (a flow having the highest flow communication rate increase rate, a flow having the latest update time, etc.).
  • the path route management unit 62 obtains path specifying information through which the flow passes from the flow specifying information in S302 (path solving process). For this purpose, for example, the path route management unit 62 extracts the VSID (virtual switch ID) of the VM accommodation management table 64 from the VMSA. In S304, the path route management unit 62 refers to the path route table 14 and the route map 66. In S305, the path route management unit 62 calculates the address of a path that does not pass through a link (congestion link) exceeding a predetermined threshold, thereby selecting the path as a change destination path.
  • VSID virtual switch ID
  • the path route management unit 62 calculates the address of a path that does not pass through a link (congestion link) exceeding a predetermined threshold, thereby selecting the path as a change destination path.
  • the path route management unit 62 executes the VMDA of the path group (which can be specified from the SA correspondence table 65) having the source of the VSW 8 accommodating the VM 9 of the VMSA.
  • a path that does not pass through a link exceeding a predetermined threshold is extracted from a path group destined for the VSW 8 that accommodates the VM 9.
  • the link route information can be acquired from the path route sequence in the path route table 14 referred to in S304.
  • the path route management unit 62 updates and writes the information in the DA correspondence table 63 based on the address of the VSW 8 calculated in S305.
  • the physical machine communication unit 61 detects that the address information in the DA correspondence table 63 has been updated.
  • the physical machine communication unit 61 transmits the address information of the DA correspondence table 63 detected in S ⁇ b> 307 to the management server communication unit 81.
  • the management server communication unit 81 passes the address information received in S308 to the route control unit 82.
  • the path control unit 82 updates the DA correspondence table 83 based on the address information received in S309.
  • FIG. 11 is a graph showing the flow traffic of the link L41.
  • the vertical axis of the graph is the bandwidth, and the horizontal axis is the time.
  • the “upper limit value” on the vertical axis is the maximum bandwidth with which the link L41 can communicate
  • the “threshold value” on the vertical axis is a threshold used for determination by the route change determination unit 57 in S301.
  • the threshold value may be changed so that the value becomes an optimum value during operation.
  • the method of changing the value is not particularly limited. For example, a method of changing by a command line may be used, or a GUI for changing interactively may be provided.
  • FIG. 11A there are two flows using the link L41 (flow f1 and flow f2), and there is a margin in the bandwidth of the link L41. Therefore, in S301, it is not determined that the link exceeds the predetermined threshold.
  • FIG. 11B as a result of the addition of the third flow (flow f3) using the link L41, the sum of the three flow traffic volumes exceeds the threshold at the time of the path change trigger.
  • the route change determination unit 57 detects the link L41 as a link exceeding the predetermined threshold in S301. That is, three flows (flows f1 to f3) are detected as the route change target flows in the processing of FIG.
  • FIG. 12 is an explanatory diagram showing a route for each flow.
  • the flow f1 is a flow that sequentially passes from the transmission source in the order of VM911 ⁇ VSW8a ⁇ TSW3a ⁇ ASW2a ⁇ TSW3d ⁇ VSW8d ⁇ VM941.
  • illustration of VM9 (VM911, VM941) is omitted.
  • the flow f2 goes through VM921 ⁇ VSW8b ⁇ TSW3b ⁇ ASW2a ⁇ TSW3d ⁇ VSW8d ⁇ VM941.
  • the flow f3 goes through VM932 ⁇ VSW8c ⁇ TSW3c ⁇ ASW2a ⁇ TSW3d ⁇ VSW8d ⁇ VM941.
  • the route of the flow f3 is returned to FIG.
  • the number of devices used for flow transfer may be reduced. Thereby, it is possible to suppress the consumption of extra power by consolidating the routes through which the data frames flow into a part of the routes and stopping the network devices configuring the unused routes.
  • the traffic estimation unit 54 assigns the flow traffic amount described in the flow information aggregation table 53 to the passing link for each flow described in the path route table 14, A traffic estimation table 56 is created. Therefore, in order to create the traffic estimation table 56, a means for measuring the flow traffic volume to be transferred by the transfer responsible part of the network system such as ASW2 or TSW3 is not necessary, and the network apparatus responsible for the flow transfer is not required. No load is required. Thereby, data indicating the communication status of the network system can be acquired at low cost. Furthermore, since the data in the traffic estimation table 56 reflects the amount of flow communication for each flow that the VM 9 actually transfers, data that indicates a communication state with higher accuracy than the prediction data for each device such as ASW2 and TSW3. It is. The acquired data in the traffic estimation table 56 can be used for network monitoring processing, automatic failure detection processing, and flow path change processing for avoiding a congestion link.
  • the network system to which the management server 1 performs flow processing is not limited to a tunneling environment such as VXLAN operating on the virtual computers (VSW8, VM9) shown in FIG.
  • VXLAN virtual computers
  • a normal LAN environment that does not use tunneling that operates on a physical switch having a function of VSW8 and a user terminal having a function of VM9 may be used.
  • the traffic estimation unit 54 uses the flow identification information collected by the flow information recording unit 52 (flow collection processing unit) as a key to create the traffic estimation table 56.
  • the DA correspondence table 63, the VM accommodation management table 64, and the SA correspondence table 65 (the DA correspondence table 63, the VM accommodation management table 64, and the SA correspondence table 65 collected by the management unit 16 (path collection processing unit) are combined. And the path specifying information corresponding to the flow specifying information is derived.
  • the speculation processing unit searches the path route table 14 and the route map 66 (the flow route information is combined with the path route table 14 and the route map 66) using the derived path specifying information as a key, thereby specifying the flow.
  • the flow path specified by the information was specified.
  • a table corresponding to the path route table 14 using the flow identification information collected by the flow collection processing unit as a key that is, the above example
  • a table corresponding to the path route table 14 in which the correspondence status between the flow specification information and the route is recorded is prepared.
  • the flow identification information is identified by searching the table and the route map 66 (the table corresponding to the path route table 14 and the route map 66 are collectively referred to as flow route information). Specify the flow path to be performed.

Abstract

Un serveur de gestion (1) rassemble des informations de correspondance d'écoulement à partir d'une VM (911) par écoulement, ledit écoulement informations de correspondance indiquant la correspondance entre des informations d'identification de flux pour identifier le flux informations de chemin du flux identifié, et le volume de communication du flux identifié. Pour chaque pièce de correspondance de flux des informations recueillies à partir d'un dispositif expéditeur, le serveur de gestion (1) ajoute le volume de communication de l'écoulement correspondant à l'écoulement des informations de correspondance au volume de communication s'écoulant à travers chaque dispositif de communication inclus dans les informations de chemin d'écoulement de manière à préparer une table d' estimation de trafic pour la volume de communication s' écoulant à travers chaque dispositif de communication.
PCT/JP2012/083498 2012-04-06 2012-12-25 Serveur de gestion et procédé de traitement de flux WO2013150691A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2014509003A JP5883926B2 (ja) 2012-04-06 2012-12-25 管理サーバ、および、フロー処理方法

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2012-087799 2012-04-06
JP2012087799 2012-04-06

Publications (1)

Publication Number Publication Date
WO2013150691A1 true WO2013150691A1 (fr) 2013-10-10

Family

ID=49300201

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2012/083498 WO2013150691A1 (fr) 2012-04-06 2012-12-25 Serveur de gestion et procédé de traitement de flux

Country Status (2)

Country Link
JP (1) JP5883926B2 (fr)
WO (1) WO2013150691A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015071973A1 (fr) * 2013-11-13 2015-05-21 株式会社日立製作所 Système de réseau et procédé de répartition de charge associé
JP2015149695A (ja) * 2014-02-10 2015-08-20 Kddi株式会社 網利用推定装置、方法及びプログラム
JP2019169783A (ja) * 2018-03-22 2019-10-03 日本電気株式会社 経路制御システム、経路制御方法、及び、プログラム
WO2023181139A1 (fr) * 2022-03-22 2023-09-28 日本電信電話株式会社 Dispositif de commande de communication, système de communication et procédé de commande de communication

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1560366A1 (fr) * 2004-01-30 2005-08-03 Microsoft Corporation Détection d'erreur et diagnostic
US20060062150A1 (en) * 2004-09-23 2006-03-23 International Business Machines Corporation Optimal interconnect Utilization in a data processing network
JP2008005368A (ja) * 2006-06-26 2008-01-10 Nippon Telegr & Teleph Corp <Ntt> 複数拠点間トラフィック制御方法及びシステム
JP2009200995A (ja) * 2008-02-25 2009-09-03 Nippon Telegr & Teleph Corp <Ntt> 迂回経路決定装置および迂回経路決定方法
WO2010107714A1 (fr) * 2009-03-16 2010-09-23 Qualcomm Incorporated Appareil et procede pour employer des codes dans les telecommunications
JP2012060604A (ja) * 2010-09-13 2012-03-22 Nippon Telegr & Teleph Corp <Ntt> ネットワーク可視化装置

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1560366A1 (fr) * 2004-01-30 2005-08-03 Microsoft Corporation Détection d'erreur et diagnostic
US20060062150A1 (en) * 2004-09-23 2006-03-23 International Business Machines Corporation Optimal interconnect Utilization in a data processing network
JP2008005368A (ja) * 2006-06-26 2008-01-10 Nippon Telegr & Teleph Corp <Ntt> 複数拠点間トラフィック制御方法及びシステム
JP2009200995A (ja) * 2008-02-25 2009-09-03 Nippon Telegr & Teleph Corp <Ntt> 迂回経路決定装置および迂回経路決定方法
WO2010107714A1 (fr) * 2009-03-16 2010-09-23 Qualcomm Incorporated Appareil et procede pour employer des codes dans les telecommunications
JP2012060604A (ja) * 2010-09-13 2012-03-22 Nippon Telegr & Teleph Corp <Ntt> ネットワーク可視化装置

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015071973A1 (fr) * 2013-11-13 2015-05-21 株式会社日立製作所 Système de réseau et procédé de répartition de charge associé
JP2015149695A (ja) * 2014-02-10 2015-08-20 Kddi株式会社 網利用推定装置、方法及びプログラム
JP2019169783A (ja) * 2018-03-22 2019-10-03 日本電気株式会社 経路制御システム、経路制御方法、及び、プログラム
JP7067170B2 (ja) 2018-03-22 2022-05-16 日本電気株式会社 経路制御システム、経路制御方法、及び、プログラム
WO2023181139A1 (fr) * 2022-03-22 2023-09-28 日本電信電話株式会社 Dispositif de commande de communication, système de communication et procédé de commande de communication

Also Published As

Publication number Publication date
JPWO2013150691A1 (ja) 2015-12-17
JP5883926B2 (ja) 2016-03-15

Similar Documents

Publication Publication Date Title
US9935851B2 (en) Technologies for determining sensor placement and topology
US20230171332A1 (en) Packet Processing Method, Network Node, and System
US10911355B2 (en) Multi-site telemetry tracking for fabric traffic using in-band telemetry
US10560311B2 (en) Management apparatus, management method, and recording medium
JP7035227B2 (ja) データパケット検出方法、デバイス、及びシステム
EP3042477B1 (fr) Surveillance de latence de trajet dans des réseaux définis par logiciel
US8867402B2 (en) Apparatus and method for generating topology tree
JP5534481B2 (ja) 通信品質監視システム、通信品質監視方法、及び記憶媒体
US8274911B2 (en) Network monitoring system and path extracting method
JP5530864B2 (ja) ネットワークシステム、管理サーバ、及び、管理方法
JP5316178B2 (ja) 通信経路推定プログラム、方法及びコンピュータ
JP5883926B2 (ja) 管理サーバ、および、フロー処理方法
JP2013062775A (ja) ネットワーク管理システム、及び装置
US10110458B2 (en) VM-to-VM traffic estimation in multi-tenant data centers
US10805206B1 (en) Method for rerouting traffic in software defined networking network and switch thereof
US9294376B2 (en) Apparatus for searching route in layer 2 network
JP6295681B2 (ja) 通信解析装置、通信解析システム、通信解析方法、及び、プログラム
CN114157595B (zh) 一种通信系统、数据处理方法以及相关设备
JP2006157313A (ja) 経路作成システム、経路作成装置及び経路作成プログラム
JP7164140B2 (ja) 通信解析装置、通信解析方法およびプログラム
US11616731B1 (en) Determining a time-to-live budget for network traffic
CN116915643A (zh) 用于规则评估的机器学习
CN116911398A (zh) 用于度量采集的机器学习
CN116909831A (zh) 用于规则推荐的机器学习
WO2017058137A1 (fr) Métadonnées de suivi de latence pour un paquet de données de commutateur de réseau

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

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2014509003

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12873714

Country of ref document: EP

Kind code of ref document: A1