US2012005374A1PendingUtilityA1

Method and system for data demultiplexing

Assignee: BALASSANIAN EDWARDPriority: Dec 29, 1999Filed: Sep 19, 2011Published: Jan 5, 2012
Est. expiryDec 29, 2019(expired)· nominal 20-yr term from priority
H04L 45/00H04L 69/321H04L 69/22H04L 2101/663H04L 61/5007H04L 69/16H04L 69/18H04L 67/02
55
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A method and system for demultiplexing packets of a message is provided. The demultiplexing system receives packets of a message, identifies a sequence of message handlers for processing the message, identifies state information associated with the message for each message handler, and invokes the message handlers passing the message and the associated state information. The system identifies the message handlers based on the initial data type of the message and a target data type. The identified message handlers effect the conversion of the data to the target data type through various intermediate data types.

Claims

exact text as granted — not AI-modified
1 . A non-transitory computer-readable medium containing instructions for processing packets of a message, the instructions comprising:
 at least one computer-executable module configured to:
 receive packets of a message; 
 identify one or more processing components for processing the incoming packets based on information provided by the processing components; 
 create a path based on the one or more processing components identified for processing the packets of the message; 
 store the path in computer memory; 
 associate the path with state information; and 
 process the packets using the path and the state information. 
   
     
     
         2 . The computer-readable medium of  claim 1  wherein the identifying is based on searching for the next set of processing components based on output formats and input formats specified by the processing components. 
     
     
         3 . The computer-readable medium of  claim 1  wherein the identifying is based on matching input formats with output formats. 
     
     
         4 . The computer-readable medium of  claim 3 , wherein matching includes a label get map routine employing aliasing when the input formats and output formats are compatible but have different names. 
     
     
         5 . The computer-readable medium of  claim 1  wherein the identifying is based on mapping definitions. 
     
     
         6 . The computer-readable medium of  claim 5  wherein mapping definitions are specified by components. 
     
     
         7 . The computer-readable medium of  claim 1  wherein the identifying is based on one or more link layer addresses such as ethernet MAC addresses. 
     
     
         8 . The computer-readable medium of  claim 1  wherein the identifying is based on one or more Internet layer addresses such as Internet Protocol addresses. 
     
     
         9 . The computer-readable medium of  claim 1 , wherein the identifying is based on one or more transport layer addresses such as TCP port addresses. 
     
     
         10 . The computer-readable medium of  claim 1  wherein the identifying is based on one or more content identifiers such as a MIME type. 
     
     
         11 . The computer-readable medium of  claim 1 , wherein the identifying is based on one or more application identifiers. 
     
     
         12 . The computer-readable medium of  claim 1 , wherein the identifying is based on one or more user identifiers. 
     
     
         13 . The computer-readable medium of  claim 1  wherein associating a path with state information is based on identifying a key defined by the processing component. 
     
     
         14 . The computer-readable medium of  claim 1  wherein associating a path with state information is based on identifying if an existing association of the same path with the same state information already exists. 
     
     
         15 . The computer-readable medium of  claim 1 , wherein identifying the path requires modifying packets of a message by one or more processing components such that each processing component modifies information associated with the packet such that the subsequent processing components can process the packet. 
     
     
         16 . The computer-readable medium of  claim 14 , wherein identifying includes using an existing path. 
     
     
         17 . The computer-readable medium of  claim 14 , wherein identifying includes creating a copy of the existing path. 
     
     
         18 . The computer-readable medium of  claim 14 , wherein identifying includes extending an existing path. 
     
     
         19 . The computer-readable medium of  claim 14 , wherein identifying includes creating a new path. 
     
     
         20 . The computer-readable medium of  claim 1 , wherein identifying includes blocking an existing path from being created. 
     
     
         21 . The computer-readable medium of  claim 1 , wherein the state information is used by the path to process subsequent packets of the same message. 
     
     
         22 . The computer-readable medium of  claim 1 , wherein the processing includes a path thread and a message queue. 
     
     
         23 . The computer-readable medium of  claim 21 , wherein the path thread removes packets from the message queue and calls a forwarding routine. 
     
     
         24 . The computer-readable medium of  claim 21 , wherein the forwarding routine calls the first component in the path with the associated state information and a message packet. 
     
     
         25 . The computer-readable medium of  claim 21 , wherein each component recursively calls the forwarding component when it is done processing the packet.

Join the waitlist — get patent alerts

Track US2012005374A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.