| Patent application number | Description | Published |
|---|
| 20110058552 | Multicast Control Technique Using MPLS - In this invention, an idea of the reverse direction label switched path (RLP) in Multi-Protocol Label Switching (MPLS) is applied to the multicast transmission to improve the management transmission in the multicast transmission, and to easily carry out an additional connection and disconnection. Specifically, in the reverse direction symmetric routing Label switched Path (LP), a virtual label in addition to an input label and an output label is used for the reverse direction routing. However, in this invention, instead of the virtual label, a multicast address to which a client terminal, which is connected to a head of the path on the reverse direction routing, and corresponds to a leaf in the multicast tree, is connected, is registered, as a multicast index, in routers on the path. Then, when receiving a multicast packet including a label and a multicast address, an output label corresponding to the received label is identified, thereby a destination link is identified. | 03-10-2011 |
| Patent application number | Description | Published |
|---|
| 20090248899 | LINKAGE SUPPORT APPARATUS AND METHOD THEREOF - A linkage support system links related messages among a plurality of messages sent and received among a plurality of communication terminals. The linkage support system includes an information acquisition unit that acquires message types of the plurality of messages, character strings included in the plurality of messages, and amount of data flow when the character strings are transferred. An unnecessary character strings exclusion unit that excludes character strings that are not required as keywords for linkage processing, based on the information acquired by the information acquisition unit, and a processing order determination unit determines order for using a plurality of character strings from which unnecessary character strings are excluded by the unnecessary character strings exclusion unit. | 10-01-2009 |
| 20090292810 | MESSAGE BINDING PROCESSING TECHNIQUE - An apparatus has a unit that receives plural messages, which belong to plural transactions and respectively have a pertinent transaction identifier, in an indefinite order; plural processors each having a queue storing the messages belonging to a transaction in charge, and outputting, after the messages belonging to one of the transactions in charge have become complete, the complete messages in the queue to a message processing unit; an allocation unit that outputs the received message to one of the plural processors, wherein one of the processors is identified based on the transaction identifier of the received message and an allocation rule predetermined for the transaction identifier; and a change unit that changes the allocation rule when activating or stopping the processor. When the change unit changes the allocation rule, each of the processors outputs at least messages for which re-allocation is necessary to the allocation unit. | 11-26-2009 |
| 20100042686 | COMPUTER READABLE RECORDING MEDIUM STORING LINKING KEYWORD AUTOMATICALLY EXTRACTING PROGRAM, LINKING KEYWORD AUTOMATICALLY EXTRACTING METHOD AND APPARATUS - A character string which is unique in each transaction and a character string common to different transactions are extracted from a message log obtained when the same transaction is processed for a plurality of number of times. Then, messages stored by practically operating an information system are associated with each transaction by utilizing these character strings, and the character string common to the transactions of which execution times overlap with each other is deleted, so that the remained character strings are provided as linking keywords. | 02-18-2010 |
| 20100076974 | COMPUTER-READABLE RECORDING MEDIUM, METHOD, AND APPARATUS FOR CREATING MESSAGE PATTERNS - An apparatus receives messages having a linking keyword for identification of a transaction, classifies the received messages in terms of transaction using message patterns and the linking keyword. It compares a series of messages associated with the transaction with the message patterns. It makes a decision as to whether the series of messages associated with the transaction matches any one of the message patterns. It creates a record including an identifier for the transaction and the linking keyword. It searches for the unclassified messages based on the linking keywords contained in the unclassified messages, and identifies the record containing the identical linking keyword. It stores the identifiers for the unclassified messages into a linked candidate list in a corresponding manner to linked candidate transactions. It adds the unclassified messages to the message pattern which corresponds to the linked candidate transaction to create a new message pattern. | 03-25-2010 |
| 20100082762 | MESSAGE TYING PROCESSING METHOD AND APPARATUS - This message tying processing method include: extracting tying keys from a key definition database storing, for each protocol, tying keys included in messages relating to the protocol and used in a message tying processing, and generating data of a structure including nodes respectively corresponding to the extracted tying keys and links connecting between the nodes of the tying keys belonging to the same protocol: judging whether or not a loop is formed in the structure by the links; when it is judged that the loop is not formed in the structure, identifying, among allocation patterns that are combinations of allocation of the tying keys to each of plural tying processors, that respectively carry out the tying processing in cooperation with each other, an allocation pattern satisfying a first condition that a communication load between the tying processors is the minimum. | 04-01-2010 |
| 20100198912 | PROCESSING-TIME-DEFINITION CREATING PROGRAM, PROCESSING-TIME-DEFINITION CREATING METHOD, AND INFORMATION PROCESSING APPARATUS - A processing time can be defined in a system including a plurality of computers for which the processing time is calculated, by displaying candidates of paths corresponding to flow of a series of processings as to transmission and reception of each message based on transmission and reception of messages among a plurality of computers; receiving an input that selects one path among the displayed candidates; and creating a processing time in each of computers in the flow of a series of processings as to transmission and reception of messages based on the received input. | 08-05-2010 |
| 20110087630 | SYSTEM ANALYSIS PROGRAM, SYSTEM ANALYSIS METHOD, AND SYSTEM ANALYSIS APPARATUS - A computer-readable, non-transitory medium stores the system analysis program which can accurately analyze the operational status of a system without modifying functions of the system for providing services. A message analysis unit analyzes the contents of collected messages, and determines the times of occurrence of the messages, the process types requested by the messages, and whether or not each of the messages is a request message or a response message. In response to an instruction for model generation, a model generation unit generates a transaction model satisfying at least one limiting condition related to caller-called relationships between processes, based on a set of messages selected in accordance with a selection criterion based on the certainty of existence of caller-called relationships. Then, in response to an instruction for analysis, an analysis unit analyzes the processing status of a transaction based on a protocol log conforming to the transaction model. | 04-14-2011 |
