Method for distributing non-unicast routing information in TRILL network and corresponding device

Technical Field

The invention relates to communication networks, more specifically, relates to a distributed non-unicast road TRILL by the information in the network method and corresponding RBridge.

Background Art

Multiple-link transparent interconnection TRILL (TransparentInterconnectionofLotsofLinks) is a two-layer network based on the link state routing protocol of the algorithm, using the protocol of the network consists of TRILL with routing transmit the characteristic of a bridge RBridge (RoutingBridge), each RBridge expanded through the intermediate system to intermediate system routing protocol IS-IS protocol (IntermediateSystemtoIntermediateSystemRoutingProtocol) obtained for the whole network topology, and by the shortest path algorithm to calculate SPF (ShortPathFirst) priority algorithm routing information.

Figure 2 is the structure, according to chart of one illustrative of network TRILL 2, the basic communication process is the same: each RBridge by SPF algorithms to calculate the routing information of the routing table a, the need for message forwarding. When a RBridgeRB-A Host1 from the host computer to a data packet received by the network forwarding to the host computer Host2 TRILL time, the message packaging a TRILL header, header TRILL included in network TRILL RBridge (IngressRBridge) to the inlet of the, Figure 2 the RB-A in, and leaving the outlet of the network TRILL RBridge (EgressRBridge), Figure 2 the RB-C in, also called purpose RBridge, TRILL used for the searching route in the network. RB-A TRILL in accordance with routing information in the message to be forwarded to the RB-B, RB-B according to the route information is further transmitted to the RB-C; the detection of local RB-C same RBridge RBridge and the outlet, to determine the message has already been TRILL on the forwarding route RBridge the last hop, to header TRILL at this moment, the implementation of traditional two-layer forwarding, will ultimately data packet forwarding to the host computer Host2.

In the above-mentioned communication process, as shown in Figure 2 in the establishment of the physical connection of the network after TRILL, each RBridge are to receive the link state information of the whole network, the topology of the network is obtained, and by SPF algorithm to calculate the route information; when the TRILL network structure changes, each RBridge have to re-obtain the network topology of the whole network, and the re-calculation route information SPF algorithm; even, even if there has been no change in the network, each RBridge through the SPF algorithm must be periodically re-computing the route information. These calculations will consume many of the CPU resources RBridge, may lead to the operation of various business RBrdige affected.

Content of the invention

According to one aspect of the invention, is provided in a multiple-link transparent interconnection TRILL non-unicast road in the network by the information processing method, wherein a bridge with route forwarding characteristics with other RBridge in the RBridge TRILL with neighbor relationship in the network, for the neighbor relationship and the RBridge computation in RBridge non-route information, in the method the RBridge executes the following steps:

states other RBridge to send an acknowledgement message, wherein the confirmation message confirming the RBridge to calculate RBridge non-route information;

In the network the states the non-unicast road TRILL by the information associated with the network topology;

states the non-unicast road according to the network topology is calculated by the information; and

The will be calculated by the information distribution states the non-unicast road RBridge to the other.

According to another aspect of the invention, is provided in a multiple-link transparent interconnection non-unicast road TRILL by the information processing in the network with a route RBridge transmit the characteristic of the bridge, wherein the RBridge TRILL with other RBridge with the neighbor relationship in the network, for the neighbor relationship and the RBridge computation in RBridge non-route information, the RBridge including:

The acknowledgement message transmission device, to the other is configured to send an acknowledgement message RBridge, wherein the confirmation message confirming the RBridge to calculate RBridge non-route information;

Obtaining device, is configured to obtain the TRILL states the non-unicast road in the network by the information associated with the network topology;

Calculating device, is configured to states the non-unicast road according to the network topology is calculated by the information; and

Distribution device, is configured to the will be calculated by the information distribution states the non-unicast road RBridge to the other.

The invention provides a method and equipment can reduce TRILL RBridgeCPU the consumption of resources in the network.

Description of drawings

By combining with photos to the disclosed exemplary embodiments are described in greater detail, the disclosed the above and other purposes, features and advantages will become more obvious, wherein in the disclosed exemplary embodiment, the same reference labels normally represent the same parts.

Figure 1 is the block diagram of suitable for implementing the embodiment of the invention an exemplary computer system/server 12 a;

Figure 2 is the chart of one illustrative of network TRILL;

Figure 3 is the method flow chart of the processing in the network TRILL non-unicast road of the method by the information;

Figure 4 is the schematic view of a network TRILL RBirdge of a plurality of neighbor relationship;

Figure 5 shows a calculation of the will be designated to the neighbor relationship dissemination RBridge other RBridge TLV in the form of;

Figure 6 shows the Figure 4 in R6 TLV message content notice;

Figure 7 shows the calculation RBridge is designated for the calculation of the confirmation of the transmitted after RBridge TLV format;

Figure 8 show the R6 sends the acknowledgement message;

Figure 9 show the R5 a confirmation message is sent;

Figure 10 shown as distributed by the information non-unicast road of the message format of the message in the LSP TLV format;

Figure 11 shows a map 10 in the contents of the neighbor information includes;

Figure 12 show the R6 the routing information of the transmission; and

Figure 13 is the structure diagram of a kind of RBridge TRILL in the network.

Mode of execution

The below described in more detail with reference to the attached drawing a preferred embodiment of the present disclosure. Although the Figure shows the preferred embodiment of the present disclosure, however, it should be understood, can be in various forms to achieve the disclosed here and should not be restricted by the embodiment. On the contrary, provide these embodiment is in order to make the invention more thorough and complete, and the scope of the present disclosure can be completely conveyed to those of skill in the art.

Figure 1 is the block diagram of suitable for implementing the embodiment of the invention an exemplary computer system/server 12 a. Figure 1 the display computer system/server 12 is only one example, this should not be the function of the embodiment of the invention any limit the scope and use.

As shown in Figure 1, computer system/server 12 in the form of a universal computing device performance. Computer system/server 12 the assembly may include, but are not limited to: one or more processors or processing unit 16, system memory 28, connecting different system component (comprises a system memory 28, and a processing unit 16) bus 18.

Bus 18 in several types of bus structure that one or more, including a memory bus or memory controller, peripheral bus, accelerated graphics port, processor or using multiple bus structure of bus structure in any of the local bus. For example, the architecture including, but not limited to, industrial standard architecture bus (ISA), micro-channel architecture (MAC) bus, enhanced ISA bus, video electronic standard association (VESA) local bus and a peripheral component interconnect (PCI) bus.

Computer system/server 12 typically includes a plurality of computer system-readable medium. These medium can be any can be computer system/server 12 access the available medium, including volatile and nonvolatile media, removable and non-removable medium.

System memory 28 may include a volatile memory of the computer system-readable medium in the form of, for example, a random access memory (RAM) 30 and/or high-speed cache memory 32. Computer system/server 12 can further include other removable/non-removable, volatile/non-volatile computer system memory medium. Example only, storage system 34 can be used for read-write not removable, nonvolatile magnetic media (Figure 1 not shown, commonly referred to as "hard disk drive"). Although the Figure 1 not shown, can be provided to move in the non-volatile magnetic disk (such as a "floppy disk") read-write disk drive, the movable and non-volatile optical disk (such as CD-ROM, DVD-ROM or other optical medium) read-write optical disc drive. In these circumstances, each driver can be by means of one or more data medium interface and bus 18 is connected. Memory 28 may include at least one program product, the program product having a series of (for example, at least one) program module, the program module is configured to perform the embodiment of the present invention function.

Is provided with a group of (at least one) program module 42 the program/utility tool 40, may be stored in, for example, memory 28 in, such a program module 42 including, but not limited to, -operating system, one or a plurality of application programs, and other program module program data, in each of these example one or some combination may include in the realization of the network environment. Program module 42 and usually carries out the invention in the described embodiments the functions and/or method.

Computer system/server 12 can also be combined with the one or a plurality of external device 14 (such as a keyboard, pointing device, display 24 and other) communication, also can be with one or more so that the user can with the computer system/server 12 interactive device communication, and/or with the computer system/server 12 can be with one or more other computing device of any equipment communication (e.g., network card, modem, etc.) communication. This kind of communication can be through the input/output interface (I/O) 22 carry out. And, the computer system/server 12 can also be through the network adapter 20 with one or more network (, e.g., a local area network (LAN), wide area network (WAN) and/or the public network, such as the Internet) communication. As shown, network adapter 20 through the bus 18 with the computer system/server 12 of the other module communication. It should be understand that, although not shown in the Figure, can be combined with the computer system/server 12 using other hardware and/or software module, including, but not limited to, : micro-code, device driver, redundant processing unit, the external disk drive array, RAID system, and a magnetic tape drive such as data backup storage system.

SPF algorithm is a kind of general computing routing information of the algorithm, the algorithm needs to be calculated from the node to the destination node on the path can be a, what is the price, there may be a plurality of paths; and then in these multiple among the best route information, choose an optimal output interface and a next hop, as the routing information. Can be seen, the route is calculated SPF does not distinguish between the type of flow.

The SPF algorithm using network TRILL in the process of calculating route, for different flow-type, accounting to calculate different routing table, for unicast flow type can get the route table, the Multicast and broadcast flow type, non-unicast road will be obtained by the table. For example, calculating the route table, each RBridge is directed to the root node as the network topology of the SPF algorithm of the route information obtained by calculation, therefore, each RBridge used in the calculation is different from the topology of the network, so the RBridge the route table is also different. However, the calculation of the route table non-unicast road, each RBridge of the root node of the topology of the network are a number of elected RBridge, network topology is that these root node as the root of a number of tree, therefore, covered by the elections RBridge within the range of all, the network topology of use thereof is the same, the calculated route information are the same, therefore, there is no need, as in the prior art, let each of a plurality of calculated RBridge non-unicast road all the information for a Multicast and a broadcast service, can be calculated by only specific RBridge non-route information, then notifies the election RBridge all within the scope of, this is the basic idea of the invention. Through such calculation Multicast and broadcast routing information, can make a considerable number of RBridge save non-route information, will save a large amount of CPU resources.

According to one embodiment of the present invention, discloses a multiple-link transparent interconnection TRILL non-unicast road in the network by the information processing method, wherein a bridge with route forwarding characteristics with other RBridge in the RBridge TRILL with neighbor relationship in the network, for the neighbor relationship and the RBridge computation in RBridge non-route information, Figure 3 is the method flow, according to chart of the processing in the network TRILL the method by the information non-unicast road 3, in the method the RBridge executes the following steps:

In step S301, the other to send an acknowledgement message RBridge, wherein the confirmation message confirming the RBridge to calculate RBridge non-route information;

In step S302, the TRILL states the non-unicast road in the network by the information associated with the network topology;

In step S303, the calculations according to the network topology by the information states the non-unicast road ; and

In step S304, the will be calculated by the information distribution states the non-unicast road RBridge to the other.

In the above-mentioned method, the having a neighbor relationship with the RBridge RBridge of the other can be obtained from the RBridge non-unicast road in by the information, there is no need to calculate the non-route information, the CPU resources can be saved.

In one embodiment, according to the neighbor relationship TRILL defined relationship of the connection to the network, and with the same one network can define different neighbor relations. Figure 4 is the schematic view, in Figure of a network TRILL RBirdge of a plurality of neighbor relationship 4 in, R1, R2, R3, R4, R5 and R6 are located in the with a link (link), in one embodiment, having a neighbor relationship located in RBridge TRILL of a link of the network on (Link). That is to say, R1-R6 neighbor relations a. Similarly, R8-R13 have also set up a neighbor relationship. Of course, the neighbor relations can also be defined by the network administrator, for example, can be the R1-R13 into a neighbor relationship definition.

In the prior art, in the neighbor relationship RBridge through the interactive hello message is to discover TRILL RBridge of neighbors in the network, each RBridge know that the link with a neighbor of the all other RBridge. Mainly used for message Hello TRILL neighbor discovery and lifeguarding, it usually includes forming the neighbor some of the necessary conditions and can be selected, all of the information encoded in Hello TLV use in the form of the message. All-enabled the interface TRILL RBridge Hello message will be sent. Regularly between neighbors Hello message sent to each other. TLV is a kind of expression information in the message mode, representative types respectively TLV (Type), length (Length), value (Value). Sender and receiver of the message information is in agreement with the form of the encoding of TLV, after receiving message to the format of the TLV analyze the message.

In one embodiment, the neighbor relations RBridge is composed of a designated with routing transmit the characteristic of the bridge (DesignatedRBridge, hereinafter referred to as the DRB,) designated for the purpose of calculating the non-route information with routing transmit the characteristic of the bridge (hereinafter referred to as computing RBridge) of the. In the prior art, has a plurality of neighbor relationship in RBridge, DRB can be obtained through the election. Then in the present invention by the election of the designated neighbor relationship to DRB computation in RBridge non-route information. Specifics of how to the election has been specified in RFC, that is, by comparing the various RBridge interface priority, the interface of the high priority for election RBridge DRB, this belongs to the prior art, will not repeat them here. In the following description, assume that R1-R6 neighbor relations of the link a, R6 is election to the DRB. In another embodiment, has a plurality of neighbor relationship in RBridge, can also be by a system administrator-specified DRB. Then the DRB to specified calculation RBridge, designated in the same manner as with the above-mentioned manner. Furthermore, the designation DRB is the propagating in the code in the message to the other RBridge. How to disseminate the back will be described in detail.

In another embodiment, by receiving the RBridge is for the calculation of the order of designated RBridge. For example, the system manager in a certain RBridge can be used in the order designated RBridge RBridge calculated for the calculation. The designated by the RBridg propagating in the code in the message to the other RBridge. How to disseminate the back will be described in detail.

In the above-mentioned embodiment, whether by DRB specified calculation RBridge, or by receiving the order in RBridge designated RBridge for calculating, in response to the neighbor relationship comprising more than 3 a RBridge, in the neighbor relationship can be designated in two computing RBridge, wherein a computing RBridge, another one is from a computational RBridge. Usually, the main computational RBridge is responsible for calculating non-route information to the neighbor relations and other RBridge (not including from a computational RBridge) transmitted by the information non-unicast road ; RBridge also calculated from the assumed non-route information, but in the main computation RBridge working condition, not to the neighbor in the neighbor relationship non-unicast road RBridge transmitted by the information. If the main computation RBridge can not be used, for example, faulty, from a computational RBridge will replace the main computation RBridge non-unicast road and to calculate the work of the transmitted information.

The DRB specified calculation RBridge embodiment, the calculation of DRB designated can be transmitted to the neighbor relationship RBridge other RBridge, a hello message propagation mode can be used, in particular, information designated by the calculation of the code in the DRB RBridge Hello in TLV of the message. Figure 5 is the TLV format, diagram of a kind of the designated calculation RBridge to the neighbor relationship RBridge of the other of the 5 in, that the type of TLV Type, can be defined as Role-Appointment, in other words the role definition, the length of the the Length TLV, TLV slavecomputenodeappointment Mastercomputenodeappointment and the value of it is in, and from that the main computational RBridge RBridge alias (nickname) is calculated.

In the Figure 4 in, R4 is DRB, R4 designated R6 is calculated mainly RBridge, R5 RBridge for preparing calculated. Other RBridge, including R1, R2, R3 and R4 are non-computed RBridge, Figure 6 shows the Figure 4 in R6 TLV message content notice of.

By ordering the specified calculation RBridge in the embodiment, the system administrator can use the command " Compute-noderole <Master,Slave>"Designated the main computation RBridge and from a computational RBridge, and in the main computation RBridge through the command on" Slavenicknamexxxx "synchronous from computing RBridge information, from the calculated by the command on RBridge" Masternicknameyyyy " synchronous the main computation RBridge information. For example, in Figure 4 the R1-R6 in a neighbor relationship, the R6 is disposed on the order as follows: Compute-noderoleMaster and SlavenicknameR5 to tell R6 on the same is calculated from the calculated and RBridge RBridge to R5, the R5 is disposed on a similar order. Furthermore, the main computational RBridge be designated as non-route information calculated by the main computation RBridge RBridge Hello propagating in the code in the message to the neighbor relationship in other RBridge, the use of coding format and Figure 5 is the same as the form described, the propagation mode in the same manner as the spread of DRB, will not repeat them here.

Of course, the technicians of this field can know, the above-mentioned use of the message propagation TLV Hello appointed information to the neighbor relationship in other RBridge is only a particular embodiment, the technicians of this field can be completely light of the above-mentioned embodiment, use other message type definition of the transmission modes, such as the use of the message of the message such as LSP or SNP, even the technicians of this field can define separate message, to disseminate the above-mentioned information, here does not repeat.

In one embodiment, is designated for the purpose of calculating the non-route information is not the border (edge) RBridge RBridge, but intermediate (transit) RBridge, for example, the above-mentioned R1-R6 in the neighbor relationship, R4 and R3 as the boundary RBridge, not for the purpose of calculating the RBridge non-route information, computing non-route information to only RBridge R1, R2, R5 and R6 at least one of the in.

In one embodiment, in response to this detection the main computation RBridge RBridge and/or from the usability of the calculation. Once detected, the main computational RBridge and/or from a computational RBridge is not available, can initiate a timer is used to wait for computing RBridge recovery. If unable to resume, or only in response to only the main computation RBridge can not be recovered RBridge from the calculation, a new can be specified from a computational RBridge; in response to the main computation RBridge and from a computational RBridge are not restorable, can be designated the new main computation RBridge RBridge and from the calculation. The above-mentioned steps can be carried out by the DRB, or by a system administrator, through the implementation of a certain RBridge designated order.

In one embodiment, in response to this detection the main computation from a computational RBridge RBridge availability. From a computational RBridge in response to detecting that the main computational RBridge is not available, is calculated from the calculated non-unicast road RBridge will by the information sent to the neighbors in RBridge.

In one embodiment, the main computational RBridge RBridge and/or from the calculated after RBridge is designated for the calculation, in step S301 will send the main or from the role the acknowledgement message to the neighbor in the neighbor relationship RBirdge. The acknowledgement message can also adopt the role of TLV confirmation hello message or other type of message, such as the use of the message of the message such as LSP or SNP, or even can be independently defined confirmation message is, Figure 7 shows the calculation RBridge is designated for the calculation of the confirmation of the transmitted after RBridge TLV format. Figure 7 in, with the type of a TLV Role-Ack, said role recognized; Computenoderoleflag can be a 1 or 0, may be defined, for example, 1 is the main computation RBridge, 0 is from a computational RBridge, or on the contrary. Hello because of the above-mentioned message is encoded in the message, message Hello is alias identification of itself, on the received neighbor RBridge Hello message is sent which RBridge, analyzing the message, of course, also know who is in the acknowledgement message role.

In the Figure 4 in, R6 is calculated mainly RBridge, R5 to from a computational RBridge. Other RBridge, including R1, R2, R3 and R4, are non-computed RBridge, the R6 a confirmation message is transmitted as shown in Figure 8. R5 a confirmation message is transmitted as shown in Figure 9.

In step S302, and step D303, the calculated TRILL RBridge non-unicast road of the network by the information associated with the network topology according to the network topology and non-route information, can be adopted in the prior art method, wherein the TRILL non-unicast road in the network by the information related to the network topology of the whole network is the election of a number of the node as the root node of the tree, according to the obtained non-network topology of the route information in the prior art can be adopted to the SPF algorithm. For example, in Figure 4 the R5 and R6, assumptions to calculate 3 tree, R5 and R6 will calculate this 3 tree, but only R6 to the neighbor RBridge transmitting the route information. R5 computing routing information but does not transmit.

In the step S304 will be calculated by the information distributed to the non-unicast road RBridge in the other, a kind of embodiment, the main computational RBridge non-unicast road by the information may be distributed using LSP message distribution, LSP TRILL protocol is a link state message, mainly used for notification to the network link state information of the node, thereby facilitating the other RBridge RBridge calculating the route. The specific format of the LSP LSP of TLV text head and numerous. Specifically, the Figure 10 is shown in the LSP TLV format of the message, the distribution by the information non-unicast road to as the message format.

Figure 10 in, defined as (type) ROUTES-INFO TLV type; Figure 11 shows the chart 10 (NeighborInformation) the neighbor in the content contained in the message, the neighbor RBridge includes the alias (Nickname), the number of neighbor RBridge (NeighborCount) neighbor, the neighbor of the neighbor RBridge alias (NeighborNickname). In the Figure 4 in, R6 transmitting the route information as shown in Figure 12.

Other RBridge neighbor relations, e.g. FIG 4 the in R1-R4 receiving the R6 distribution of Figure 12 indicated by the information non-unicast road, against their own non-unicast road analyzed by the information, for example, R1 only need to analyze the Figure 12 of the section 3 line information, R2 only need to analyze the picture 12 section 4 line information, so forth, can be obtained without calculating non-unicast road by the information, saving the CPU resources.

The technicians of this field can know, the main computational RBridge non-unicast road by the information can also be distributed using other types of message distribution, for example, can adopt Hello message, such as message or SNP, or even can be independently defined distribution message, similar to the mode of execution, will not repeat them here.

In one and the same inventive concept is lower, the invention also relates to a multiple-link transparent interconnection non-unicast road TRILL network by the information with routing transmit the characteristic of the bridge RBridge, wherein the RBridge TRILL with other RBridge with the neighbor relationship in the network, for the neighbor relationship and the RBridge computation in RBridge non-route information, Figure 13 is the structure diagram, according to chart of a network TRILL RBridge1300 in the 13, the RBridge including: confirmation message sending apparatus 1301, to the other is configured to send an acknowledgement message RBridge, wherein the confirmation message for confirming the RBridge non-route information calculated RBridge; obtaining device 1302, the is configured to obtain TRILL states the non-unicast road in the network by the information associated with the network topology of the; calculating device 1303, is configured to calculate according to the network topology by the information states the non-unicast road ; and distribution device 1304, is configured to the will be calculated by the information distribution states the non-unicast road RBridge to the other.

In one embodiment, the other RBridge not counting non-route information.

In one embodiment, the with said other RBridge RBridge TRILL located in the link of a network on Link.

In one embodiment, the RBridge by the neighbor relationship is specified in the routing of bridge forwarding characteristic designated as DRB non-route information calculated RBridge, and the designation DRB is the propagating in the code in the message to the other RBridge.

In one embodiment, by receiving the RBridge order is designated as non-route information calculated RBridge, and by the the designation RBridge propagating in the code in the message to the other RBridge.

In one embodiment, the border is not RBridge RBridge.

In one embodiment, in the network in the TRILL, in response to the neighbor relationship comprises at least 3 one RBridge, the neighbor relationship mainly included in the calculation of the RBridge RBridge, is also included in the neighbor relationship from RBridge RBridge and the other is calculated, the calculated from the calculated by the information states the non-unicast road RBridge, and in the case of the work of the main computation RBridge, not sending RBridge non-unicast road to the other by the information.

In one embodiment, in the network in the TRILL, from a computational RBridge in response to the detection to the main computation RBridge is not available, the from a computational RBridge non-unicast road RBridge to the other is transmitted by the information.

In one embodiment, in the network in the TRILL, the main computation RBridge and the from the assumed the availability of RBridge are measured, in response to only the main computation RBridge RBridge not or only from the calculation can be used, from the calculated new RBridge designated, in response to the the main computation RBridge and the from a computational RBridge are not available, designating the new main computation RBridge RBridge from the calculated and new.

The invention can be a system, method and/or computer program product. Computer program product may include a computer readable storage medium, which is used for making the processor contains the various aspects of the present invention a computer-readable program instruction.

Computer-readable storage medium can be stored and can be maintained by the instruction execution apparatus used instruction of the physical device. Computer readable storage medium may be, for example, but not limited to, ―― ―― electric storage device, magnetic storage device, optical storage device, the electromagnetic storage device, semiconductor memory device or the arbitrary appropriate combination of the above. Computer-readable storage medium a more specific examples (a non-exhaustive list) comprising: portable computer disk, hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), static random access memory (SRAM), portable compressed disk read-only memory (CD-ROM), digital versatile disc (DVD), memory stick, floppy disk, mechanical coding device, such as the instructions are stored on the protruding structure or groove punch card, and any appropriate combination of the above. Here the use of computer-readable storage medium not to be construed as the instantaneous signal itself, such as radio wave or other free propagation of the electromagnetic waves, by means of a waveguide or other transmission media electromagnetic wave (for example, through a fiber optic cable optical pulse), or the transmission of the electrical signal through the electric wire.

Described herein can be computer-readable program instructions from computer-readable storage medium is downloaded to the various computing/processing equipment, or through the network, such as the Internet, local area network, a wide area network and/or wireless network downloaded to the external computer or an external storage device. The network can include the copper transmission cable, optical fiber transmission, wireless transmission, router, firewall, switch, gateway computer and/or edge server. Each computing/processing apparatus to the network adapter card or network interface receives from the network computer-readable program instructions, and forwarding the computer-readable program instructions, for storage in various computing/processing apparatus in the computer-readable storage medium.

The operation used for carrying out this invention the computer program instructions may be compiled instruction, instruction set architecture instruction (ISA), machine instructions, machine associated instruction, micro-code, the firmware instructions, state data, or to one or more programming language prepared by any combination of the source code or object code, said programming language comprises an object-oriented programming language, such as Java, Smalltalk, such as C++, and the program of the conventional programming language, such as "C" language or similar programming language. Computer-readable program instruction can be executed on the user's computer, partly on the user computer, as an independent software implementation, part of the upper part of the user computer is performed on a remote computer, or entirely on the remote computer or server executing. In the situation of the remote computer, the remote computer can be through any kind of network, including a local area network (LAN) or a wide-area network (WAN)-is connected to the user computer, or, can be connected to an external computer (for example, the use of the Internet service provider is connected to through the Internet). In some embodiments, through the use of computer-readable program instructions to the state information of the individualized customization of electronic circuit, such as a programmable logic circuit, a field programmable gate array (FPGA) or programmable logic array (PLA), the electronic circuit of the computer-readable program instructions can be executed, thereby realizing various aspects of the present invention.

Here reference according to the embodiment of the invention method, apparatus (systems) and computer program products of the flowchart and/or block diagram described various aspects of this invention. It should be understood, flowchart and/or block diagram of each box and in the flowchart and/or block diagram the combination of the frame, can be realized by computer-readable program instructions.

These computer-readable program instructions can be provided to the general purpose computer, special purpose computer or other programmable data processing processor of the device, so as to produce a machine, such that in these instructions by the computer or other programmable data processing device is carried out by the processor of the, effect the flowchart and/or block diagram in one or more of the square the function/action specified in the device. These can also be computer-readable program instructions stored in the computer-readable storage medium, these instructions cause the computer, programmable data processing device and/or other equipment in order to work in a specific way, thus, instructions stored in the computer readable medium includes a plurality of articles of manufacture, its including the realization of the flowchart and/or block diagram in one or more of the square the function/action specified in the various aspects of the instruction.

Also computer-readable program instructions may be loaded into the computer, other programmable data processing apparatus, or other equipment, in the computer, other programmable data processing apparatus or other device performing a series of operation steps, to produce a computer implemented process, so that the computer, other programmable data processing device, or other device implementation of the instruction to realize the flowchart and/or block diagram in one or more of the frame the specified function/action.

In the Figure the flow chart and block diagram shows that the according to the present invention a plurality of embodiment of the system, method and computer program product that may be realized by the system structure, function and operation. In this point, in the flow chart or block diagram of each block may represent a module, segment, or a part of the instruction, the module, program segment or instructions comprising a portion of one or more is used for realizing the specified logic function of the executable instructions. In some as in replacement of, the function of the box labeled in the Figure can also be to place the order of the mark. For example, two consecutive box can in practice be substantially concurrently performing, they sometimes the implementation can be in the opposite order, depending on the which of the function. Is should also be noted that, in the flowchart and/or block diagram of each box, and in the flowchart and/or block diagram of the combination of the pane, the implementation can be used for the specified function or action of the special hardware-based system, or may be a special-purpose hardware and computer instructions to achieve the combination of.

The above has described the various embodiments of the present invention, the above-mentioned explanation is illustrative, and the non- exhausts the nature, and also is not limited to the disclosed embodiments. In all of the note does not deviate from the scope and the spirit of the embodiment of the circumstances, in the technical field as the ordinary technical personnel many modifications and alteration will be obvious. In this text the choice of the terminology used, is intended to best explain the principle of the embodiment of, the market in actual application, or technical improvement of technology, of the technical field or other common technical staff to understand the various embodiments disclosed herein.