CN111983962B

CN111983962B - System and method for generating mapping relation of service flow

Info

Publication number: CN111983962B
Application number: CN201910426482.XA
Authority: CN
Inventors: 田冲
Original assignee: BMW Brilliance Automotive Ltd
Current assignee: BMW Brilliance Automotive Ltd
Priority date: 2019-05-22
Filing date: 2019-05-22
Publication date: 2024-05-07
Anticipated expiration: 2039-05-22
Also published as: CN111983962A

Abstract

The present disclosure provides a method for generating a mapping relationship of a service flow, comprising: receiving one or more first configuration files for the traffic flow; extracting a first set of parameters related to the traffic flow from the one or more first profiles; creating a first entry using the value of the first parameter in the first parameter set; inserting the value of the first parameter into a first global lookup table associated with the first parameter by mapping; creating a second entry, wherein the second entry contains at least a value of the first parameter and a value of a second parameter in the first parameter set; associating the second entry with the first entry; inserting the value of the second parameter into a second global lookup table associated with the second parameter by mapping; and generating a mapping relationship of the traffic flow based at least on the first entry and the second entry.

Description

System and method for generating mapping relation of service flow

Technical Field

The present disclosure relates to data processing, and more particularly, to a system and method for generating mappings and dependencies of traffic flows from configuration files.

Background

Manufacturing Execution Systems (MES) are currently a popular platform for use in manufacturing enterprises. The MES is at an execution layer between an Enterprise Resource Planning (ERP) layer and a field automation system, such as a field programmable logic control system (PLC), and is primarily responsible for plant production management and scheduling execution. The MES can integrate management functions such as production scheduling, product tracking, quality control, equipment fault analysis, network report and the like on a unified platform, and can simultaneously provide workshop management information services for production departments, quality inspection departments, process departments, logistics departments and the like by using a unified database and through network connection.

However, MES has no standard in the industry, and manufacturing enterprises such as medical, tobacco, shipbuilding, and vehicle manufacturing have respective MES systems. Even in the individual workshops of the enterprises, the MES system of each workshop is different due to the different production processes. For example, automobile manufacturers have processes for stamping, body, painting, assembly, engine, battery, etc., and the MES systems of these various workshops vary.

For manufacturing enterprises having different shop factories throughout the world, a set of mutually independent files, such as binary files written in the C language, may be provided in order to allow each shop factory to conveniently and flexibly complete its own MES system. Each factory can carry out self-defined assembly on software by configuring dependency and mapping relation between binary files according to the characteristics of the factory without modifying program codes.

However, as more and more PLC nodes are connected to the MES system over time, the MES system is configured to become more complex, and practitioners understand that it is more difficult to handle the system traffic and the efficiency of handling faults is lower. Furthermore, MES systems are less friendly to non-professional users because they are designed for professional IT personnel.

Accordingly, there is a need for a system and method for efficiently generating a mapping relationship of traffic flows.

Disclosure of Invention

The present disclosure provides a system and method capable of generating a mapping relationship of traffic flows from a configuration file.

According to a first aspect of the present disclosure, there is provided a method for generating a mapping relation of traffic flows, comprising: receiving one or more first configuration files for the traffic flow; extracting a first set of parameters related to the traffic flow from the one or more first profiles; creating a first entry using the value of the first parameter in the first parameter set; inserting the value of the first parameter into a first global lookup table associated with the first parameter by mapping; creating a second entry, wherein the second entry contains at least a value of the first parameter and a value of a second parameter in the first parameter set; associating the second entry with the first entry; inserting the value of the second parameter into a second global lookup table associated with the second parameter by mapping; and generating a mapping relationship of the traffic flow based at least on the first entry and the second entry.

According to a second aspect of the present disclosure, there is provided a computer system comprising: one or more processors; a memory having stored thereon computer executable instructions that when executed by the one or more processors cause the one or more processors to perform the method of the present invention.

According to a third aspect of the present disclosure, there is provided a non-transitory computer-readable medium having stored thereon computer-executable instructions which, when executed by one or more processors, cause the one or more processors to perform the method of the present invention.

According to a fourth aspect of the present disclosure, there is provided an apparatus for generating a mapping relation of traffic flows, comprising means for performing the method of the present invention.

Other features of the present invention and its advantages will become more apparent from the following detailed description of exemplary embodiments of the invention, which proceeds with reference to the accompanying drawings.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description, serve to explain the principles of the disclosure.

The disclosure may be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings in which:

FIG. 1 illustrates a schematic diagram of an enterprise system, according to an exemplary embodiment of the invention.

FIG. 2 illustrates a flow chart of parsing a task profile according to an exemplary embodiment of the invention.

FIG. 3 illustrates a schematic diagram of creating a data structure related to a task profile according to another exemplary embodiment of the present invention.

Fig. 4 shows a flowchart of parsing a PLC profile according to an exemplary embodiment of the present invention.

Fig. 5 shows a schematic diagram of a data structure related to creating a PLC profile according to an exemplary embodiment of the present invention.

Fig. 6 illustrates a flow chart of parsing an incoming message routing profile according to an exemplary embodiment of the present invention.

Fig. 7 shows a specific flow chart of step 602 in fig. 6 according to an exemplary embodiment of the invention.

Fig. 8 illustrates a flow chart of parsing a return message routing profile according to an exemplary embodiment of the present invention.

Fig. 9 is a diagram illustrating the creation of data structures associated with an incoming message profile and a return message routing profile according to an exemplary embodiment of the present invention.

Fig. 10 shows a schematic diagram of outputting a mapping relationship in the form of a command line according to an exemplary embodiment of the present invention.

Fig. 11 shows a schematic diagram of outputting a mapping relationship in the form of a signal flow diagram according to an exemplary embodiment of the present invention.

FIG. 12 illustrates an exemplary configuration of a computing device in which embodiments according to the invention may be implemented.

Detailed Description

Preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings. Details and functions not necessary for the invention are omitted so as not to obscure the understanding of the present invention.

Note that like reference numerals and letters refer to like items in the figures, and thus once an item is defined in one figure, it is not necessary to discuss it in subsequent figures.

In this disclosure, the terms "first," "second," and the like are used merely to distinguish between elements or steps and are not intended to indicate a temporal order, priority, or importance.

Hereinafter, a specific example of how to generate the mapping relationship of the service flow will be explained in conjunction with the MES system, such as a task profile, a PLC profile, a message routing profile, etc., which will be written in conjunction with the C language. It should be understood by those skilled in the art that the technical solution of the present invention is not limited to these specific configuration files, nor to development in C language, but may be applied to manufacturing execution systems of various enterprises developed in various languages.

Referring to fig. 1, fig. 1 shows a schematic diagram of an enterprise system according to an exemplary embodiment of the invention. As shown in FIG. 1, the enterprise system may include an MES layer and a PLC layer. The MES layer can include a receiver 101, a business processing module 103, a transmitter 104, and the like. The MES layer can also include an adapter 102. Note that the adapter 102 is not necessary for the MES layer. The PLC layer includes a plurality of PLC nodes plc_1 through plc_n. The receiver 101 receives an incoming (incoming) message transmitted from a PLC node, and transmits the incoming (incoming) message to the adapter 102 or the like through a match (match) check. The final message enters the service processing module 103. After the service processing module 103 performs corresponding processing on the message, a return (outbound) message is sent to the PLC node through the sender 104. As there are more and more nodes of the PLC, which may even reach thousands, and each PLC node may send several different messages, it will be quite difficult to understand and manually draw the mapping relationship of the traffic streams. Because each component in the system completes the operation through the corresponding configuration file, the invention realizes the automatic generation of the mapping relation of the service flow by analyzing the configuration file and constructing the proper data structure.

How to parse the task profile will be described below in connection with fig. 2 and 3. The task configuration file, namely the process configuration file, is an important logic configuration file, and all other file configurations have a dependency relationship with the important logic configuration file. The task profile may define the following commands:

fig. 2 is a flow chart of parsing a task profile, and fig. 3 is a schematic diagram of creating a data structure related to the task profile.

In step S201, the system receives one or more task profiles.

In step S202, the system extracts the relevant first from the task profile according to methods of parsing text symbols known to those skilled in the art. The parsing method is, for example, a bottom-up parsing method according to compiler principles, such as looking forward at the reverse rightmost derivation (LALR (1)). It should be understood that the analytical methods of the inventive concept are not so limited and that other analytical methods known to those skilled in the art can be used by those skilled in the art in light of the teachings of the present invention. The parsed parameters may include, for example, task group (TaskGroup) names, start, end parameters, and the like.

Optionally, in step S202-1, a lookup is performed in TaskGroup global hash table by task group name to determine if the task group exists. If not, then at step S203, an entry 31 is created TaskGroup with the TaskGroup name. Note that a plurality TaskGroup of items 31_1, 31_2, etc. are shown in fig. 3, and are referred to herein for convenience of description only with reference numeral 31. An example of creating TaskGroup an entry is as follows:

In step S204, the TaskGroup names are hashed to insert into TaskGroup global hash table 33.

It should be noted that the hash algorithm is merely one example mapping method that is adopted to illustrate the concepts of the present invention. Any other equivalent mapping method may be adopted by those skilled in the art under the teaching of the present inventive concept.

In addition, taskGroup entries may be inserted into the global TaskGroup linked list (see the linked list starting with pTaskGroupRoot in FIG. 3) for saving for subsequent traversal.

In step S205, TASKENTRY entry 32_1 is created. Also referred to below as 32 for TASKENTRY entries. The entry may include a group name, a task name, an execution file name, an end parameter, and the like. An example of creating TASKENTRY an entry is as follows:

At step S206, the created TASKENTRY entry 32 is associated to the next TASKENTRY pointer to which TaskGroup entry 31 points. This ensures that all TASKENTRY under the same TaskGroup are output.

In step S207, the task name (TaskName) and the execution file name (Taskexe) in the TASKENTRY entry are subjected to hash calculation, and the task name global hash table 34 and the execution program name global hash table 35 are added, respectively.

How to parse the PLC profile will be described in conjunction with fig. 4 and 5.

Fig. 4 is a flowchart of parsing a PLC profile, and fig. 5 is a schematic diagram of creating a data structure related to the PLC profile.

In step S401, the system receives one or more PLC profiles. The PLC profile may include parameters such as PLC node name and IP address.

In step S402, the system parses the PLC profile and extracts the relevant parameters.

In step S403, the PLC node number global hash table 53 is searched for according to the PLC node number.

In step S404, if the PLC node number is not found, a new tcp_info entry 51, e.g. 51_1, 51_2, etc., hereinafter collectively 51, is created, which includes at least the PLC node name and the IP address. An example of creating a TCP_INFO entry is as follows:

In step S405, the PLC node number and the IP address in the tcp_info entry are hashed, and added to the PLC node number global hash table 53 and the IP address global hash table 54, respectively.

In addition, the TCP_INFO entry may be inserted into a global TCP_INFO entry linked list (see linked list starting at pTCPRoot in FIG. 5) for saving for subsequent traversal.

How the incoming (incoming) message routing profile is parsed will be described below in connection with fig. 6 and 9.

Fig. 6 is a flow chart of parsing an incoming message routing profile, and fig. 9 is a schematic diagram of creating a data structure associated with an incoming message routing profile and a return message routing profile.

In step S601, the system receives one or more incoming message routing profiles, parses the incoming message routing profiles, and extracts relevant parameters. The extracted parameters may include, for example, a specific export file (balloon) name (SpoolName), a task name, a PLC node number, and the like.

In step S602, the system looks up the executive name global hash table 35 created in step S207 in accordance with SpoolName and returns the resulting TASKENTRY pointer.

IN step S603, an entry (in_plane_info) is created, for example, 91_1, 91_2, etc., hereinafter collectively referred to as 91, which includes at least SpoolName, task name, PLC node number, etc. An example of creating an IN_SPOOL_INFO entry is as follows:

at step S604, spoolName IN the in_spring_info entry 91 is hashed and added to the SpoolName global hash table 95.

IN addition, the IN_SPOOL_INFO entry 91 may be inserted into a global IN_SPOOL_INFO entry linked list (see linked list starting at pInSpoolRoot IN FIG. 9) for storage for subsequent traversal.

In step S605, a PLC LINK (plc_link_info) entry, for example, 92_1, 92_2, etc., hereinafter collectively 92, is created, and the plc_link_info entry 92 includes at least SpoolName, a task name, a PLC node number, an IP address, etc. An example of creating a PLC LINK INFO entry is as follows:

In step S606, the PLC node number in the plc_link_info entry 92 is hashed and added to the PLC node number global hash table 96.

In step S605, a matching pair (MATCHPAIR) entry, for example, 93_1, 93_2, etc., hereinafter collectively referred to as 93, is created, and the MATCHPAIR entry 93 includes at least a matching keyword, a message location, etc. The match key and message location are used by the receiver 101/transmitter 104 in the MES to determine if the incoming/return messages from/to the PLC match the MES system. If so, the next flow is entered. If not, discarding the corresponding message. An example of creating MATCHPAIR an entry is as follows:

In step S608, the MATCHPAIR pointer on the incoming message in the plc_link_info entry 92 points to the MATCHPAIR entry 93 created in step S607.

Different MES systems may or may not have adapters (adapters) depending on the configuration. The adapter is used for adapting the format of the message sent by the PLC so as to facilitate the next process to process the message. When the adapter exists in the system, specific configuration information exists in the task configuration file to set the association relation between the adapter and the task item respectively. When no adapter is present in the system, no configuration information about the adapter is present in the task profile. The manner in which the TASKENTRY pointer is looked up in step S602 may vary depending on the presence or absence of the adapter in the MES system. Fig. 7 shows a specific flow chart of step 602 in fig. 6.

In step s602—1, the system uses SpoolName to look up the executive name global hash table 35 created in step S207 in a manner that no adapter is present, and returns the resulting TASKENTRY pointer.

In step s602—2, it is determined whether the returned pointer is NULL (NULL). If the returned pointer is not null, then the found TASKENTRY pointer points to the final TASKENTRY entry.

If the returned pointer is NULL, at step s602—3, the global hash table 35 of the executive name created at step S207 is looked up using SpoolName in the presence of an adapter, and the resulting TASKENTRY pointer is returned.

In step s602—4, it is determined whether the returned pointer is NULL (NULL). If the returned pointer is NULL, the system reports an error and exits at step s602—5.

If the returned pointer is not null, then in step s602_6, the field representing the adapter is set to true.

Then in step s602_7, the final TASKENTRY entry is found.

How the return (outbound) message routing profile is parsed will be described below in conjunction with fig. 8 and 9.

Fig. 8 is a flow chart for parsing a return message routing profile, and fig. 9 is a schematic diagram for creating a data structure associated with an incoming message profile and a return message routing profile.

In step S801, the system receives one or more return message routing profiles, parses the return message routing profiles, and extracts relevant parameters. The extracted parameters may include, for example, a specific export file name (SpoolName), a task name, a PLC node number, and the like.

In step S802, a return message (out_scope_info) entry, such as 94_1, 94_2, etc., hereinafter collectively 94, is created, and the out_scope_info entry 94 may include SpoolName, task name, PLC node number, etc. An example of creating an out_scope_info entry is as follows:

The created out_spring_info entry 94 may be added to a return message global hash table (not shown) by hashing.

In step S803, the system looks up the PLC node number global hash table 96 for the plc_link_info entry created in step S606 according to the PLC node number.

IN step S804, the global hash table 95 for in_plane_info created IN step S604 is searched through ZPISpoolName IN the searched plc_link_info item to obtain a corresponding in_plane_info item.

IN step S805, the outing spring pointer IN the IN_SPOOL_INFO entry is pointed to the OUT_SPOOL_INFO entry.

At step S806, a matching pair (MATCHPAIR) entry for the return message is created, which MATCHPAIR entry may include matching keywords and message locations, etc.

In step S807, the MATCHPAIR pointer on the return message in the plc_link_info entry 92 is pointed to the MATCHPAIR entry created in step S806.

In step S808, the plc_link_info pointer in the out_plane_info entry 94 is pointed to the plc_link_info entry 92 found in step S803.

In step S809, the PLC node number and the IP address in the plc_link_info entry 92 are hashed, and added to the PLC node number global hash table 53 and the IP address global hash table 54 shown in fig. 5, respectively.

It should be appreciated that the above description is merely exemplary of parsing a configuration file, and those skilled in the art will appreciate that parsing more other configuration files, or parsing fewer configuration files, may occur within the contemplation of the present invention, depending on the specific configuration of the MES system and the different needs of the user for the mapping relationship. According to the steps and the designed data structure, the mapping relation of different service flows can be generated according to the requirements of users.

The output of the mapping relationship generated from the above data structure may take a variety of different forms. Fig. 10 and 11 illustrate output mappings in the form of command lines and signal flow diagrams, respectively, according to an exemplary embodiment of the present invention.

As shown in fig. 10, according to a user input command, a mapping relationship in the form of a command line may be output on a user interface. For example, the output shows that the PLC node tcp111 sent 13 messages (e.g., 17: PLSSTART: IPSTART) to the receiver vtsrvrcv of the MES system, which messages entered the adapter ADP_BS, etc., and then returned to the node tcp111 via the sender vtsrvsnd _BS, etc.

As shown in fig. 11, a mapping relationship in the form of a signal flow chart may be output on the user interface according to a user input command. For example, the output shows that the PLC node tcp317 sent 1 message to the receiver vtsrvrcv of the MES system, which message entered the adapter ADP_ NASY, etc., and then a return message was returned to the node tcp317 via the sender VTSND _ADP_SNAS, etc.

The method of the invention can quickly and efficiently generate the mapping relation of the service flow and can output the mapping relation to the user in an intuitive and user-friendly way.

FIG. 12 illustrates an exemplary configuration of a computing device 1200 in which embodiments according to the invention may be implemented. Computing device 1200 is an example of a hardware device in which the above aspects of the invention may be applied. Computing device 1200 may be any machine configured to perform processing and/or calculations. Computing device 1200 may be, but is not limited to, a workstation, a server, a desktop computer, a laptop computer, a tablet computer, a Personal Data Assistant (PDA), a smart phone, an in-vehicle computer, or a combination thereof.

As shown in fig. 12, computing device 1200 may include one or more elements that may be connected to or in communication with a bus 1202 via one or more interfaces. The bus 1202 may include, but is not limited to, an industry standard architecture (Industry Standard Architecture, ISA) bus, a micro channel architecture (Micro Channel Architecture, MCA) bus, an Enhanced ISA (EISA) bus, a Video Electronics Standards Association (VESA) local bus, and a Peripheral Component Interconnect (PCI) bus. Computing device 1200 may include, for example, one or more processors 1204, one or more input devices 1206, and one or more output devices 1208. The one or more processors 1204 may be any kind of processor and may include, but are not limited to, one or more general purpose processors or special purpose processors (such as special purpose processing chips). Input device 1206 may be any type of input device capable of inputting information to a computing device, and may include, but is not limited to, a mouse, keyboard, touch screen, microphone, and/or remote controller. The output device 1208 may be any type of device capable of presenting information and may include, but is not limited to, a display, speakers, video/audio output terminals, vibrators, and/or printers.

The computing device 1200 may also include or be connected to a non-transitory storage device 1214, which non-transitory storage device 1214 may be any storage device that is non-transitory and that may enable data storage, and may include, but is not limited to, disk drives, optical storage devices, solid state memory, floppy disks, flexible disks, hard disks, magnetic tape, or any other magnetic medium, compact disk or any other optical medium, cache memory and/or any other memory chip or module, and/or any other medium from which a computer may read data, instructions, and/or code. Computing device 1200 may also include Random Access Memory (RAM) 1210 and Read Only Memory (ROM) 1212. The ROM 1212 may store programs, utilities or processes to be executed in a non-volatile manner. The RAM 1210 may provide volatile data storage and stores instructions related to the operation of the computing device 1200. The computing device 1200 may also include a network/bus interface 1216 coupled to the data link 1218. The network/bus interface 1216 can be any kind of device or system capable of enabling communication with external equipment and/or networks, and can include, but is not limited to, modems, network cards, infrared communication devices, wireless communication devices, and/or chipsets (such as bluetooth ^TM devices, 1302.11 devices, wiFi devices, wiMax devices, cellular communication facilities, etc.).

The various aspects, embodiments, implementations, or features of the foregoing embodiments may be used singly or in any combination. The various aspects of the foregoing embodiments may be implemented by software, hardware, or a combination of hardware and software.

For example, the foregoing embodiments may be embodied as computer readable code on a computer readable medium. The computer readable medium is any data storage device that can store data which can thereafter be read by a computer system. Examples of a computer readable medium include read-only memory, random-access memory, CD-ROMs, DVDs, magnetic tape, hard drives, solid state drives, and optical data storage devices. The computer readable medium can also be distributed over network coupled computer systems so that the computer readable code is stored and executed in a distributed fashion.

For example, the foregoing embodiments may take the form of hardware circuitry. The hardware circuitry may include any combination of combinational logic circuits, clock storage devices (such as floppy disks, flip-flops, latches, etc.), finite state machines, memory such as static random access memory or embedded dynamic random access memory, custom designed circuits, programmable logic arrays, etc.

While certain specific embodiments of the invention have been illustrated in detail by way of example, it will be appreciated by those skilled in the art that the foregoing examples are intended to be illustrative only and not to limit the scope of the invention. It should be appreciated that some of the steps in the foregoing methods are not necessarily performed in the order illustrated, but they may be performed simultaneously, in a different order, or in an overlapping manner. Furthermore, one skilled in the art may add some steps or omit some steps as desired. Some of the components in the foregoing systems are not necessarily arranged as shown, and one skilled in the art may add some components or omit some components as desired. It will be appreciated by those skilled in the art that changes could be made to the embodiments described above without departing from the scope and spirit of the invention. The scope of the invention is defined by the appended claims.

Claims

1. A method for generating a mapping relationship for traffic flows in a Manufacturing Execution System (MES), comprising:

Receiving one or more first configuration files for the traffic flow;

Extracting a first set of parameters related to the traffic flow from the one or more first profiles;

Creating a first entry using the value of the first parameter in the first parameter set;

inserting the value of the first parameter into a first global lookup table associated with the first parameter by mapping;

creating a second entry, wherein the second entry contains at least a value of the first parameter and a value of a second parameter in the first parameter set;

Associating the second entry with the first entry;

Inserting the value of the second parameter into a second global lookup table associated with the second parameter by mapping;

constructing a data structure comprising the first entry, the second entry, the first global lookup table, and the second global lookup table;

receiving a user input command for analyzing the mapping relation for a specific service flow;

generating a mapping relation of the specific service flow based on the data structure; and

And outputting the mapping relation of the specific service flow on a user interface.

2. The method of claim 1, wherein prior to creating the first entry, the method further comprises: performing a lookup in the first global lookup table using the value of the first parameter to determine whether a first entry relating to the value of the first parameter exists, the step of creating the first entry being performed in response to determining that the first entry does not exist.

3. The method of claim 1, wherein the one or more first configuration files comprise a task configuration file, the first parameter is a task group name, the second parameter comprises at least one of a task name and an executive name, and the second global lookup table comprises at least one of a task name global lookup table and an executive name global lookup table.

4. The method of claim 1, further comprising:

receiving one or more second configuration files for the traffic flow;

Extracting a second set of parameters related to the traffic flow from the one or more second profiles;

Look-up in a third global look-up table associated with a third parameter in the second parameter set using the value of the third parameter to determine if there is a third entry related to the value of the third parameter;

In response to the third entry not being present:

creating a new third entry, wherein the new third entry includes at least a value of the third parameter and a value of a fourth parameter in the second parameter set; and

And inserting the value of the third parameter and the value of the fourth parameter into the third global lookup table and the fourth global lookup table respectively through mapping.

5. The method of claim 4, wherein the one or more second profiles comprise a Programmable Logic Controller (PLC) profile, the third parameter is a programmable logic controller node number, and the fourth parameter is an IP address.

6. The method of claim 4, further comprising:

receiving one or more third profiles for the traffic stream;

extracting a third set of parameters related to the traffic flow from the one or more third profiles;

Look-up in the second global look-up table using the value of a fifth parameter in the third parameter set to determine a second entry relating to the value of the fifth parameter;

creating a fourth entry, wherein the fourth entry comprises the value of the fifth parameter and the value of the second parameter contained in the second entry obtained by searching;

inserting the fourth entry into a fifth global lookup table by mapping;

Creating a fifth entry comprising the value of the second parameter, the value of the third parameter, the value of the fourth parameter, and the value of the fifth parameter;

the value of the third parameter is inserted into a sixth global lookup table by mapping.

7. The method of claim 6, wherein using the value of the fifth parameter in the third parameter set to look up in the second global lookup table to find a second entry related to the value of the fifth parameter comprises:

Searching in the second global lookup table using the value of the fifth parameter in a manner that no adapter is present in the traffic flow to determine a second entry related to the value of the fifth parameter;

in response to the second entry being found to be empty:

searching in the second global lookup table using the value of the fifth parameter in a manner that an adapter exists in the traffic flow to determine a second entry related to the value of the fifth parameter; and

In response to the second entry being found not empty, a field representing the adapter is set to true.

8. The method of claim 6, wherein the one or more third profiles comprise an incoming message routing profile, the fifth parameter is an incoming specific derived file name, the fifth entry further comprises a parameter indicating a match, the method further comprising:

creating a sixth item, wherein the sixth item comprises a matched keyword and a message position; and

And associating the parameter indicating the match with the sixth entry.

9. The method of claim 8, further comprising:

Receiving one or more fourth profiles for the traffic stream;

Extracting a fourth set of parameters related to the traffic flow from the one or more fourth profiles;

creating a seventh entry using values of a plurality of parameters in the fourth parameter set, the seventh entry including the third parameter;

Performing a lookup in the sixth global lookup table using the value of the third parameter to determine an associated fifth entry;

Looking up in the fifth global lookup table according to the associated fifth entry to determine an associated fourth entry; and

A specified parameter in the associated fourth entry is associated with the seventh entry.

10. The method of claim 9, wherein the one or more fourth profiles comprise a return message routing profile, the seventh entry is a return specific export file information entry, the method further comprising:

Creating an eighth item, wherein the eighth item comprises a matched keyword parameter and a message position in a fourth parameter set;

Associating a parameter in the determined associated fifth entry indicating a match with the eighth entry;

associating parameters in the seventh entry associated with the fifth entry with the determined associated fifth entry; and

The value of the third parameter and the value of the fourth parameter in the associated fifth entry are inserted into the third global lookup table and the fourth global lookup table, respectively, by mapping.

11. The method of any of claims 1 to 10, wherein outputting the mapping of the particular traffic stream on a user interface further comprises:

the generated mapping relationship is output in the form of a command line or a signal flow diagram.

12. The method of claim 10, wherein the first through eighth global lookup tables are global hash tables.

13. The method of any one of claims 1 to 10, wherein the extracting step is implemented by a bottom-up parsing method according to compiler principles.

14. A computer system, comprising:

One or more processors;

A memory having stored thereon computer-executable instructions that, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-13.

15. A non-transitory computer-readable medium having stored thereon computer-executable instructions that, when executed by one or more processors, cause the one or more processors to perform the method of any of claims 1-13.

16. An apparatus for generating a mapping relation of traffic flows, comprising means for performing the steps of the method according to any of claims 1-13.