Method and device for testing network flow pressure based on massive distributed nodes

Abstract

The invention relates to a network flow pressure testing method and device based on massive distributed nodes. The method comprises the following steps: acquiring all available nodes in a preset radius of a node to be tested; obtaining the sum of the flows of all the available nodes in the preset radius, updating the preset radius to obtain a new preset radius when the sum of the flows of all the available nodes in the preset radius does not conform to the test flow of the to-be-tested node, obtaining all the available nodes in the new preset radius, and obtaining the test flow of the to-be-tested node; the sum of the flows of all the available nodes in the new preset radius is judged, iteration is conducted in sequence, and when the sum of the flows of all the available nodes in the new preset radius after updating conforms to the test flow of the to-be-tested node, iteration is stopped; the to-be-tested node tests the flow uploading or downloading pressure of the to-be-tested node by using the information sent or received by all the available nodes; the cost required for providing traffic through a supplier or a cloud manufacturer in the testing process is reduced, and the testing cost is reduced.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a method, device, electronic equipment and medium for performing network traffic stress testing based on massive distributed nodes. Background Art

[0002] Among the huge number of CDN nodes, it is of great significance to be able to perceive whether the network is abnormal in advance. Its role is to let external equipment perform stress testing on CDN nodes during the off-peak period, let the CDN nodes know the current service capabilities, and timely warn and rectify before the peak period to avoid affecting the customer's business during the peak period. At present, when testing the node pressure, the upload and download pressure of the node is tested through the traffic nodes of the operator or cloud vendor. During the test, the traffic prices provided by the supplier or cloud vendor are relatively expensive, which causes a huge economic burden on the customer during the test. Summary of the invention

[0003] In order to solve the problems existing in the prior art, the present application provides a method, device, electronic device and medium for performing network traffic stress testing based on massive distributed nodes, which uses pre-stored traffic data within a preset radius of the node to be tested to test the traffic of the node to be tested, avoids using the traffic provided by suppliers or cloud vendors for stress testing during the testing phase, and effectively reduces the testing cost.

[0004] The present application is implemented through the following technical solutions: 1. A method for performing network traffic stress testing based on massive distributed nodes, comprising: Get all available nodes within the preset radius of the node to be tested; Obtain the sum of the traffic of all available nodes within the preset radius. When the sum of the traffic of all available nodes within the preset radius does not meet the test traffic of the node to be tested, update the preset radius to obtain a new preset radius, obtain all available nodes within the new preset radius, determine the sum of the traffic of all available nodes within the new preset radius, iterate in sequence, and stop iterating when the sum of the traffic of all available nodes within the new preset radius after update meets the test traffic of the node to be tested; The node to be tested uses the information sent or received by all available nodes to test the upload or download traffic pressure of the node to be tested.

[0005] Preferably, the method for obtaining all available nodes is: The node to be tested sends a request to every node within the preset radius; When a node accepts a request from a node to be tested, the node sends the traffic size data of its own upload or download to the node to be tested. After receiving the traffic size data sent by the node, the node to be tested marks the node as an available node; If the node to be tested does not receive the traffic size data sent by the node, the node is marked as an unavailable node.

[0006] Preferably, the method for performing a traffic pressure test on the node to be tested using all available nodes includes: Use the flow pressure of the node to be tested to match the matching flow of each available node; When the node to be tested is undergoing a download traffic stress test, each available node matches the transmission data that meets the size of the matching traffic according to the determined matching traffic, and sends the transmission data to the node to be tested for downloading, thereby performing a download traffic stress test; When the node to be tested performs an upload traffic stress test, the node to be tested determines the transmission data to be sent to each available node using the traffic matched by each available node, and sends the transmission data to each available node for an upload traffic test.

[0007] Preferably, the relationship between the sum of the traffic of all available nodes within the preset radius and the test traffic of the node to be tested is that the sum of the traffic of all available nodes is greater than or equal to 140% of the test traffic of the node to be tested.

[0008] Preferably, the transmission data sent by each available node to the node to be tested includes one or more of video data, audio data or text data cached or downloaded by the available node.

[0009] Preferably, each available node is graded according to its own traffic size, and the graded situation is sent to the node to be tested. The graded situation of each available node to be tested is prioritized, and when performing pressure testing, the transmission data sent by the available nodes is obtained or the transmission data is sent to the available nodes in the order of sorting.

[0010] A network traffic stress testing device based on massive distributed nodes, comprising: An available node acquisition unit is used to acquire all available nodes within a preset radius of the node to be tested; A radius update unit, which obtains the sum of the traffic of all available nodes within a preset radius. When the sum of the traffic of all available nodes within the preset radius does not meet the test traffic of the node to be tested, the preset radius is updated to obtain a new preset radius, all available nodes within the new preset radius are obtained, and the sum of the traffic of all available nodes within the new preset radius is determined. The iteration is performed in sequence, and when the sum of the traffic of all available nodes within the new preset radius after the update meets the test traffic of the node to be tested, the iteration is stopped; The test unit tests the upload or download traffic pressure of the node to be tested by using the information sent or received by all available nodes.

[0011] An electronic device, comprising: one or more processors; A storage device is used to store one or more programs. When the one or more programs are executed by the one or more processors, the one or more processors implement the network traffic stress testing method based on massive distributed nodes.

[0012] A computer-readable medium stores a computer program, which, when executed by a processor, implements the network traffic stress testing method based on massive distributed nodes.

[0013] The beneficial effects of this application are: In the present application, when conducting a traffic stress test, all available nodes within a preset radius of the node to be tested are obtained, and the available nodes jointly provide the node to be tested with the upload or download traffic data required for the test, thereby avoiding the use of traffic provided by suppliers or cloud vendors, reducing the cost of providing traffic through suppliers or cloud vendors during the test, and reducing the cost of the test. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0015] Figure 1 This is a flow chart of a method for performing network traffic stress testing based on massive distributed nodes in an embodiment of the present invention; Figure 2 It is a block diagram of a network traffic stress testing device based on massive distributed nodes in an embodiment of the present invention; Figure 3 is a schematic diagram of the structure of the computer system of the electronic device in this embodiment; DETAILED DESCRIPTION Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this application will be more comprehensive and complete and fully convey the concept of the example embodiments to those skilled in the art.

[0016] In addition, described feature, structure or characteristic can be combined in one or more embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present application. However, those skilled in the art will appreciate that the technical scheme of the present application can be put into practice without one or more of the specific details, or other methods, components, devices, steps, etc. can be adopted. In other cases, known methods, systems, implementations or operations are not shown or described in detail to avoid blurring the various aspects of the application.

[0017] The block diagrams shown in the accompanying drawings are merely functional entities and do not necessarily correspond to physically independent entities. That is, these functional entities may be implemented in software form, or in one or more hardware modules or integrated circuits, or in different networks and / or processor devices and / or microcontroller devices.

[0018] The flowcharts shown in the accompanying drawings are only exemplary and do not necessarily include all the contents and operations / steps, nor must they be executed in the order described. For example, some operations / steps can be decomposed, and some operations / steps can be combined or partially combined, so the actual execution order may change according to actual conditions.

[0019] The solution provided in this embodiment is implemented based on the current large number of CDN nodes. At present, a large number of CDN nodes such as TVs, tablet computers, mobile phones, oil spills, etc. store a large amount of traffic data such as video data, voice data, and text data during use. These data are not effectively used. Since these data are public and unused data (i.e., useless cache data), they will occupy resources and cannot generate value. However, these data can be used for uploading or downloading and testing traffic. In view of this, this embodiment provides the following Figure 1 A method for performing network traffic stress testing based on massive distributed nodes is provided, comprising: Obtain all available nodes within a preset radius of the node to be tested; the available nodes in this embodiment represent nodes that can provide download or upload traffic data for the node to be tested, and the nodes include home mobile phones, computers, tablet computers, routers, and other nodes with cached data; This embodiment provides a method for obtaining available nodes. The method for obtaining available nodes within the preset radius includes: The node to be tested sends a request to every node within the preset radius; the preset radius is self-set. For example, if the preset radius is within 1 km, then when sending a request, the request is sent to the nodes within the radius of 1 km. The nodes that can send requests are all authenticated nodes, that is, the nodes that can accept requests need to be authenticated. The purpose of authentication is to ensure that the node and the node to be tested can interconnect data and ensure mutual authentication. Only after all nodes are authenticated can they send requests and data to each other. After the node to be tested sends a request to the nodes within a preset radius, the node chooses to receive the request or reject the request according to its own situation. Rejected requests include nodes that are not powered on or manually rejected. When the node within the preset radius accepts the request sent by the node to be tested, the node needs to send its own uploaded or downloaded traffic size data to the node to be tested. The traffic size data refers to the maximum traffic data that the node can receive from the node to be tested, such as 100Mbps, that is, its own download or upload traffic size. After the node to be tested receives the traffic data sent by the node, it is considered that the node can provide traffic data to the node to be tested or can accept traffic data sent by the node to be tested during the test process of the node to be tested. At this time, the node is marked as an available node; if the node to be tested does not receive the traffic size data sent by the node, the node is marked as an unavailable node In another embodiment, the nodes within the radius can be obtained through an intermediate server, and the intermediate server can be used to determine whether the nodes within the preset radius of the nodes are available nodes. The specific method is that the node to be tested sends the task that needs to be pressure tested to the intermediate server. The intermediate server obtains the preset radius according to the task of testing the node to be tested, and sends a request to all nodes within the preset radius. If the node within the preset radius receives the request, the node receiving the request sends its own uploaded or downloaded traffic size data to the server. After receiving the traffic size data sent by the node, the server will mark the node as an available node. If the server does not receive the traffic data sent by the node, it will mark the node as an unavailable node.

[0020] Since the traffic required by the node to be tested is greater than its own traffic during the traffic stress test, the data traffic sent by the available nodes to it needs to be greater than or equal to 140% to meet the test requirements of the node to be tested. Then it is necessary to count the traffic data of all available nodes within the preset radius to see if the requirement is met. If not, it is necessary to add new available nodes. The specific implementation includes: After obtaining the traffic data sent by all available nodes within the preset radius, the node or server to be tested adds up the traffic data of all available nodes to obtain the sum of the traffic of all available nodes. When the sum of the traffic obtained is greater than or equal to 140% of the traffic required by the node to be tested, the available nodes within the preset radius are used to test the traffic pressure of the node to be tested. When the sum of the traffic of all available nodes within the preset radius does not meet the test traffic of the node to be tested, that is, it is less than 140%, the preset radius is updated to obtain a new preset radius, that is, the radius is expanded. When the radius is expanded, it can be expanded by 1 kilometer each time according to demand, from the original 1 kilometer to 2 kilometers, and then the available nodes within 2 kilometers are obtained according to the method of obtaining available nodes within 1 kilometer, and then the sum of the traffic of the available nodes within 2 kilometers is calculated. If the sum of the traffic is greater than or equal to 140% of the traffic required by the node to be tested, all the expanded available nodes are used for the test traffic of the node to be tested. If it continues to be less than 140%, continue to expand the radius to obtain new available nodes until the sum of the traffic of all available nodes obtained after the expanded radius is greater than or equal to 140% of the traffic required by the node to be tested, then stop expanding and updating.

[0021] After obtaining all available nodes, the node to be tested uses the information sent or received by all available nodes to test the upload or download traffic pressure of the node to be tested.

[0022] Specific testing methods include: When performing a download stress test on a node to be tested, the node to be tested matches the traffic size that each available node can provide according to its own test traffic size, or the server matches the traffic size that each available node can provide according to the test traffic size of the node to be tested; During the test, the available nodes match the transmission data of the corresponding flow size according to the provided flow size, and send the transmission data to the node to be tested. The node to be tested uses the sent transmission data to test the download flow pressure. When performing an upload stress test, the node to be tested matches the traffic size that each available node can receive based on its own test traffic size, or the server matches the traffic size that each available node can receive based on the test traffic size of the node to be tested; During the test, the node to be tested sends its own data that meets the traffic size according to the traffic size that each available node can receive, and performs an upload stress test.

[0023] This embodiment abandons the traditional IDC or CDN resources of operators or cloud vendors for stress testing, greatly improves the resource integration capability, and reduces the cost to a limit. Without any waste of traffic, the service capacity value of the CDN node is stress tested with the minimum and most accurate traffic.

[0024] In another embodiment, each available node is classified according to its own traffic size, as shown below: S level: data volume (traffic) greater than 1000Mbps Class A: 500Mbps<=data volume<1000Mbps Class B: 300Mbps<=data volume<500Mbps Class C: 100Mbps<=data volume<300Mbps Class D: 50Mbps<=data volume<100Mbps Class E: 20Mbps<=data volume<50Mbps The node will send data to the node or server to be tested according to its own level. The node or server to be tested will prioritize the level of each available node and obtain the transmission data sent by the available nodes or send transmission data to the available nodes in the order of ranking when performing pressure testing.

[0025] Specifically during testing: Assume that a 500Mbps stress test task is received If there are 2 500Mbps resources within the preset range, it is a very good situation. However, resources above level C are very rare. The more common ones are level D and level E. Relatively speaking, level D and level E are at a better level in terms of cost. Assuming that there are 20 level D resources and 20 level E resources nearby, then these 40 nodes are randomly selected and the values ​​are superimposed until the value is greater than or equal to 140% of 500Mbps, indicating that the point selection is completed.

[0026] Connect the selected point to the node under stress testing. After the connection is successful, provide data for the node under stress testing to pull at the same time. During the pulling process of the node under stress testing, calculate the average value of the data per unit time, and the obtained value is the stress testing bandwidth value, which is the final result you want to get.

[0027] like Figure 2 The embodiment shown also provides a network traffic stress testing device based on massive distributed nodes, including: An available node acquisition unit is used to acquire all available nodes within a preset radius of the node to be tested; A radius update unit, which obtains the sum of the traffic of all available nodes within a preset radius. When the sum of the traffic of all available nodes within the preset radius does not meet the test traffic of the node to be tested, the preset radius is updated to obtain a new preset radius, all available nodes within the new preset radius are obtained, and the sum of the traffic of all available nodes within the new preset radius is determined. The iteration is performed in sequence, and when the sum of the traffic of all available nodes within the new preset radius after the update meets the test traffic of the node to be tested, the iteration is stopped; The test unit tests the upload or download traffic pressure of the node to be tested by using the information sent or received by all available nodes.

[0028] Figure 3 A schematic diagram of the structure of a computer system suitable for implementing an electronic device of an embodiment of the present application is shown.

[0029] It should be noted that the computer system 400 of the electronic device shown in the figure is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0030] Among them, the computer system 400 includes a central processing unit (CPU) 401, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 402 or the program loaded from the storage part 408 to the random access memory (RAM) 403, such as executing the network traffic stress testing method based on massive distributed nodes in the above embodiment. In RAM 403, various programs and data required for system operation are also stored. CPU 401, ROM 402 and RAM 403 are connected to each other through bus 404. Input / output (I / O) interface 405 is also connected to bus 404.

[0031] The following components are connected to the I / O interface 405: an input section 406 including a keyboard, a mouse, etc.; an output section 407 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 408 including a hard disk, etc.; and a communication section 409 including a network interface card such as a LAN (Local Area Network) card, a modem, etc. The communication section 409 performs communication processing via a network such as the Internet. A drive 410 is also connected to the I / O interface 405 as needed. A removable medium 411, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 410 as needed so that a computer program read therefrom is installed into the storage section 408 as needed.

[0032] In particular, according to an embodiment of the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present application includes a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a computer program for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication part 409, and / or installed from a removable medium 411. When the computer program is executed by the central processing unit (CPU) 401, various functions defined in the system of the present application are executed.

[0033] It should be noted that the computer-readable medium shown in the embodiment of the present application is used to implement the network traffic stress test method based on massive distributed nodes; the computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), a flash memory, an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, device or device. In the present application, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier, which carries a computer-readable computer program. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate, or transmit programs for use by or in conjunction with an instruction execution system, apparatus, or device. The computer program contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wired, etc., or any suitable combination of the above.

[0034] The flowchart and block diagram in the accompanying drawings illustrate the possible architecture, functions and operations of the system, method and computer program product according to various embodiments of the present application. Wherein, each box in the flowchart or block diagram can represent a module, a program segment, or a part of the code, and the above-mentioned module, program segment, or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flowchart, and the combination of boxes in the block diagram or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0035] The units involved in the embodiments described in this application may be implemented by software or hardware, and the units described may also be set in a processor. The names of these units do not, in some cases, constitute limitations on the units themselves.

[0036] According to one aspect of the present application, a computer program product or a computer program is provided, the computer program product or the computer program comprising computer instructions, the computer instructions being stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the methods provided in the above-mentioned various optional implementations.

[0037] As another aspect, the present application also provides a computer-readable medium, which may be included in the electronic device described in the above embodiment; or may exist independently without being assembled into the electronic device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by an electronic device, the electronic device implements the method described in the above embodiment.

[0038] It should be noted that, although several modules or units of the equipment for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present application, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into being embodied by multiple modules or units.

[0039] Through the description of the above implementation methods, it is easy for those skilled in the art to understand that the example implementation methods described here can be implemented by software, or by combining software with necessary hardware. Therefore, the technical solution according to the implementation method of the present application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a touch terminal, or a network device, etc.) to execute the method according to the implementation method of the present application.

[0040] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the embodiments disclosed herein. The present application is intended to cover any variations, uses or adaptations of the present application, which follow the general principles of the present application and include common knowledge or customary technical means in the art that are not disclosed in the present application.

[0041] It should be understood that the present application is not limited to the precise structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present application is limited only by the appended claims.

Claims

1. A network traffic stress testing method based on massive distributed nodes, characterized in that: include: Get all available nodes within the preset radius of the node to be tested; Obtain the sum of the traffic of all available nodes within the preset radius. When the sum of the traffic of all available nodes within the preset radius does not meet the test traffic of the node to be tested, update the preset radius to obtain a new preset radius, obtain all available nodes within the new preset radius, determine the sum of the traffic of all available nodes within the new preset radius, iterate in sequence, and stop iterating when the sum of the traffic of all available nodes within the new preset radius after update meets the test traffic of the node to be tested; The node to be tested uses the information sent or received by all available nodes to test the upload or download traffic pressure of the node to be tested.

2. According to claim 1, a method for performing network traffic stress testing based on massive distributed nodes is characterized in that: The method to obtain all available nodes is: The node to be tested sends a request to every node within the preset radius; When a node accepts a request from a node to be tested, the node sends the traffic size data of its own upload or download to the node to be tested. After receiving the traffic size data sent by the node, the node to be tested marks the node as an available node; If the node to be tested does not receive the traffic size data sent by the node, the node is marked as an unavailable node.

3. According to claim 2, a method for performing network traffic stress testing based on massive distributed nodes is characterized in that: The method for the node to be tested to perform traffic stress testing using all available nodes includes: Use the flow pressure of the node to be tested to match the matching flow of each available node; When the node to be tested is undergoing a download traffic stress test, each available node matches the transmission data that meets the size of the matching traffic according to the determined matching traffic, and sends the transmission data to the node to be tested for downloading, thereby performing a download traffic stress test; When the node to be tested performs an upload traffic stress test, the node to be tested determines the transmission data to be sent to each available node using the traffic matched by each available node, and sends the transmission data to each available node for an upload traffic test.

4. According to claim 1, a method for performing network traffic stress testing based on massive distributed nodes is characterized in that: The relationship between the sum of the traffic of all available nodes within the preset radius and the test traffic of the node to be tested is that the sum of the traffic of all available nodes is greater than or equal to 140% of the test traffic of the node to be tested.

5. According to claim 3, a method for performing network traffic stress testing based on massive distributed nodes is characterized in that: The transmission data sent by each available node to the node to be tested includes one or more of video data, audio data or text data cached or downloaded by the available node.

6. A method for performing network traffic stress testing based on massive distributed nodes according to claim 1, characterized in that: Each available node is graded according to its own traffic size, and the graded situation is sent to the node to be tested. The graded situation of each available node in the node to be tested is prioritized. When performing pressure testing, the transmission data sent by the available nodes is obtained in the sorted order or the transmission data is sent to the available nodes.

7. A network traffic stress testing device based on massive distributed nodes, characterized in that: include: An available node acquisition unit, used to acquire all available nodes within a preset radius of the node to be tested; A radius updating unit, which obtains the sum of the traffic of all available nodes within a preset radius. When the sum of the traffic of all available nodes within the preset radius does not meet the test traffic of the node to be tested, the preset radius is updated to obtain a new preset radius, all available nodes within the new preset radius are obtained, and the sum of the traffic of all available nodes within the new preset radius is determined. The iteration is performed in sequence. When the sum of the traffic of all available nodes within the new preset radius after the update meets the test traffic of the node to be tested, the iteration is stopped. The test unit tests the upload or download traffic pressure of the node to be tested by using the information sent or received by all available nodes.

8. An electronic device, characterized in that: include: one or more processors; A storage device for storing one or more programs. When the one or more programs are executed by the one or more processors, the one or more processors implement the network traffic stress testing method based on massive distributed nodes as described in any one of claims 1 to 6.

9. A computer readable medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method for performing network traffic stress testing based on massive distributed nodes as described in any one of claims 1 to 6 is implemented.

Images