The invention relates generally to computer networks. More specifically, the invention relates to a virtual network that adaptively routes messages based on message contents.
Various levels of abstraction exist within computer architecture, from the physical representation of ones and zeros to high-level application programs. When computers were initially developed, a low-level programming language commonly referred to as machine language was generally used to control their operation. However, in order to create the same program for two different computer platforms with different machine languages, programmers had to write the program twice-once in each platform's machine language.
Computer programmers learned that machine language could be abstracted by creating higher-level programming languages, such as C and Pascal, and then providing a compiler for each platform on which the program was to be used. When a program was written in one of these higher-level programming languages, the program could be compiled to run on each specific machine, without having to rewrite the source program for each machine. Abstractions in this regard continued, resulting in the more recent development of virtual machines.
The notion of a virtual machine is well known in the art of computer science. A virtual machine is an intermediate representation that is not tied to the specific details of a particular computer hardware architecture. Typically a virtual machine will guarantee certain semantics that remain identical regardless of the hardware used to implement it. Therefore a program which has been written for such a machine can be executed on different hardware systems without modification. Thus, one advantage of a virtual machine is that its operational semantics remain constant from one computer program to the next regardless of the origin or operating requirements of any one computer program.
Computer networks are dependent on the underlying physical hardware and network protocols on which the network is constructed. These protocols in turn are dependent on the underlying network architecture on which they are implemented. As a result, network applications must be rewritten for each network on which they are to be used. In addition, in order for two machines to communicate over a network, each machine must understand how to communicate over the specific network, i.e., each machine must have the appropriate network drivers to communicate.
One level of abstraction that has been implemented in computer networks is the use of a TCP/IP protocol stack, as implemented according to the OSI seven-layer network model. TCP/IP abstracts some notions of network protocols, allowing two machines that each understand the TCP/IP protocols to effectively communicate with each other. However, even using TCP/IP, each machine must, at some level, be able to understand network routing and topology, bindings, and DNS resolution. That is, each computer on a network must still have substantial network support utilities installed in order to effectively communicate over the network, because the OSI model only virtualizes the physical wire between the machines, and not the network through which the machines communicate.
For example, TCP/IP requires applications to understand the concepts of ports and IP addresses. Ports and IP addresses, in turn, require applications to understand DNS name resolution, network topology, transport bandwidths and end-to-end routing. Thus, while simplifying the model for exchanging ordered sequences of bytes in a reliable manner, the application still must deal directly with many network level concepts and details. The OSI model does not address higher-level constructs, such as naming, routing, and quality of service, as needed by network applications.
Another shortcoming of conventional networks is the inability to adapt and rehabilitate after a message error or network failure. Present networks cannot easily adapt automatically when machines are added, moved, or removed. That is, a user typically must edit routing tables to inform the network of the change.
In addition, network failures are not easily fixed, other than by maintaining redundant machines that perform the same function. That is, if a first machine fails, then the second (backup) machine takes over the first machine's functions. However, if the second machine subsequently fails, and there is no third machine that performs the same functions, the network will suffer as a result. Known networks are not self-healing. Thus, an advanced network that overcomes these problems is needed.
Another shortcoming of conventional networks is their inability to dynamically route network messages based on message contents. Known routers by Cisco Systems, Inc. are capable of routing messages based on predefined criteria, but are not dynamically programmable to support user-extensible routing behavior based on message content. This inability makes them inappropriate for systems in which applications can control transformations and processing of messages, in addition to the traditional routing and QoS requirements.
It would be an advancement in the art to provide a method and system that solves some or all of the above-identified problems.
Aspects of the invention may be used to virtualize a network to allow programmers to write platform independent network computer applications. A virtual network may be created by adding an abstraction layer (software or hardware) between the applications providing network services and the underlying network of systems that executes that code, for example, between layers 6 and 7 in the OSI network model. One or more virtualized components may be inserted, including synchronization, eventing, messaging, naming, groups, addressing, and routing components.
By abstracting the networking system, the network may more efficiently and securely provide services inherently to the applications and services built on top of it. For example, services such as reliability, security, platform independence, scale-out, edge networking, and location independence may easily be provided. Also, the system may adapt to physical topology changes and automatically “heal” from failures. The virtual network is responsible for mapping code onto the physical topology of the network and transparently adapting that mapping. Additionally, developers may benefit from isolation of their services.
By combining the virtual network with a virtual machine, a distributed, partitionable virtual network can be created where an application can be written once and run on any machine. That is, a network application written for use in a virtual network, and on a computer running a virtual machine, does not need to be rewritten because it is able to run on any machine that operates the same virtual machine and is connected to the virtual network.
The virtual network also provides adaptive reconfiguration capabilities. Suppose that machine A sends a message to machine B over a network, and B replies back to machine A. However, before machine A can send a second message to machine B, machine B moves (e.g., to another IP address). According to one embodiment, a virtual network may resolve itself and adapt to the changed location such that the message is still delivered to B's new location. The address change may take place transparently so that the applications running on the network(s) never know (or need to know) that a change in B's location was made. No restrictions are placed on the set of locations to which each machine may be moved because abstraction is moved from the machine level to the network level. After a device has been moved, once it identifies itself to the network at the new location the virtual network has the ability to update itself so that the routing to the machine can continue to operate uninterrupted. This ability extends what is currently possible within single administrative domains to multiple administrative domains, enabling location mobility to extend across organizations.
A first embodiment of the invention provides an apparatus that includes a message dispatcher that routes and dispatches messages. Each message is routed based on an arbitrary portion of the message's contents. There is also an interface through which network application programs communicate with the message dispatcher to define the arbitrary portion of the message's contents on which the message is routed.
In another embodiment of the invention, there is a data processing apparatus that includes a message dispatcher module, a transport adapter for interfacing the message dispatcher to a transport protocol, an interface through which application programs communicate with the message dispatcher, and stored rules instructing the message dispatcher to route a first network message based on a first attribute of said first network message, and route a second network message based on a second attribute, different from the first attribute, of the second network message. The first and second attributes are selected from a set of headers and data contained in each network message.
Another embodiment provides a method for routing network messages. A message dispatcher routes a first network message based on a first attribute of the first network message. The message dispatcher routes a second network message based on a second attribute, different from the first attribute, of the second network message. The first and second attributes may be any field selected from a set of headers and data of each network message.
In another embodiment, there is a network router that stores computer executable instructions that, when executed by the router, perform a set of steps. The network router stores routing information received from a network application. The routing information comprises a message field, a field condition, and a message instruction. The network router receives and processes a network message by comparing the network message to the stored routing information. When the received message's message field meets the field condition, the network router performs the message instruction.
Another embodiment of the invention provides a virtual computer network. The computer network includes a plurality of computers, each configured with at least one transport adapter that converts messages between a transport layer protocol and a network protocol, and a message dispatcher that routes and dispatches messages based on an arbitrary portion of the message's contents. The message dispatcher in each computer routes messages in the virtual network protocol over the transport layer protocol using the transport adapter(s).
In another embodiment of the invention, there is a virtual network that includes at least one virtualized component inserted between layers 6 and 7 of an OSI protocol stack.
Message resolution in a virtual network can be accomplished through the use of virtual locations in combination with a universal enabling component, referred to as a virtual network dispatcher (VND), which is included in every resource that participates within the virtual network. A resource may be defined as any message endpoint. With reference to
Message handlers 109 may vary from machine to machine, or they may be consistent across machines. Each message handler may be explicitly configured for a specific type of machine, or may be configured to specifically operate or not operate on any given machine. Some message handlers may be broadly deployed, e.g., message header handlers and encryption handlers, while other message handlers may only be deployed on a single machine.
Each VND is responsible for performing routing and dispatching functions. Routing is the process of forwarding messages to the device for which they are intended. Dispatching is the process of, upon receiving a message, executing the proper handler (e.g., a software module, function, application program, routine, etc.) or other executable software, in response to receiving the message. The handler that the VND executes may be a routing handler that determines how the VND should process and route the message, or the handler may send the message to an application program running on the device.
In one embodiment, the VND may route and dispatch XML-based messages in an open, extensible messaging protocol that allows distributed, decentralized applications to exchange information regardless of the operating system, object model, or language that each particular application uses. Any protocol may be used that supports the transport(s) used by the virtual network. The VND may be used in conjunction with network transport protocols 107, e.g. TCP, IP, UDP, HTTP, SMTP, SOAP-RP, etc. As messages are received at a location via any transport protocol, the message contents are extracted by a transport adapter 105, and input into VND 103. Each transport adapter receives as input a message formatted according to a predefined transport protocol, and converts (or strips) the message headers to comply with the virtual network protocol. As shown in
By using multiple transport protocols and protocol adapters, placing a VND 103 on each device provides a platform through which any application program may transparently communicate with another application program independently of the transport layer protocol by using the virtual network protocol. Known in the art are specific application programs that have been configured to communicate over multiple protocols. However, each application program that does so must be specifically configured. Using the virtual network described herein, applications may communicate over multiple protocols without any special configuration, and without even being aware that communications are being transported over multiple protocols. The VND 103 in each specific device sending each message makes the decision regarding the protocol over which to send the message. For each message, a VND may determine which protocol to use based on one or more predefined protocol policies. Alternatively, the protocol used may be dependant on the application or web service driving the VND for the particular message, based on the needs and/or requests of the application or web service.
When a new transport protocol is developed or needed by the virtual network, a new transport adapter may be created and installed for use with each VND. In this manner, the virtual network may take advantage of new transport protocols, without requiring support for each transport protocol to be built into each application in the virtual network. Instead, support for a new transport protocol is provided to each VND, which contains logic instructing when and how to use the new transport protocol in conjunction with the new transport adapter.
The VND unifies local and remote dispatch on a single machine. Unlike conventional networks where only specified or dedicated machines act as routers, typically every device acts as a router in a virtual network. For instance, a device may receive a message, only to determine that the message should actually be delivered somewhere else in the network. When this occurs, the machine forwards the message to the correct recipient, or to that recipient which the machine believes is the correct based on its present routing tables and rules, instead of (optionally) returning an error message to the message sender.
Because each device acts as a router, a self-healing system may be implemented. When one machine goes down, other machines will automatically compensate and find other paths through which to send messages, making the virtual network fault tolerant. In one embodiment, machines may be placed in redundancy groups. Each machine in the redundancy group can detect that any other machine in the group has failed and left the group. The remaining machines may then update information in one or more message handlers that forward messages to avoid using the machine that is known to be down. Machines can thus compensate for network faults and errors according to instructions encoded in their routing and logic tables, and as further described below. In another embodiment, one or more machine subsystems may be monitoring the network to determine optimal paths and failed paths.
With reference to
VND handlers 109 may be created such that, in a virtual network, the application network presents to each application a set of logical endpoints, i.e. devices. Applications may communicate with endpoints via messages that use non-uniform semantic rules. For example, a first application may send a message over the network to a second application according to a first message format (e.g., headers and data). One or more handlers can modify the message syntax such that the message is modified before it is received by the second application, and appears in a different message syntax. The endpoints may be mapped onto a physical network that may have varying implementations at each endpoint (i.e., different vendors may provide software and hardware to operate the virtual network once the specifications are publicly available), and may communicate using non-uniform transport protocols between endpoints.
Using the above-described network platform, a virtual network may be configured to be self-organizing. That is, the virtual network may be configured to recover from, adapt to, or reorganize itself in response to a specified event on the network. An event could be any predefined condition that triggers the network self-adaptation, including the nonoccurrence of a condition. For instance, the network may be configured to reorganize when it detects that a node of the network has failed. When this event occurs, one or more handlers may instruct the VND to route packets to a new location. In another example, when load on a network path is high, VNDs may route messages over lesser-trafficked network paths. Alternatively, a user may reorganize the virtual network via a graphical user interface, or other configuration interface.
An application programming interface (API) 115 can be provided, through which application programs may interface with the VND 103. Application programs can be written for the computer's execution engine (e.g., an operating system or a virtual machine) that interfaces using API 115 to configure the VND to respond to each message based on the message contents and/or based on the transport protocol on which it was received. The VND mediates the interaction of the protocol and the underlying execution engine.
In one embodiment, the message protocol is a composable protocol in that application programs can add new functional aspects as needed without interrupting the processing of preexisting message functionality. In one embodiment, headers are used to provide the new functional aspects. New functional attributes may be stored in one or more message headers. That is, new headers may be added to the existing message without disturbing the processing of the previous message, unlike conventional message protocol suites whereby one message protocol encapsulates another message protocol in order to include a new header (or functional attribute). Thus, the message protocol is extensible in that additional header fields may be added or removed by an application as needed to provide new functionality. This allows network applications to define new header fields and incorporate them into the message format without requiring that every network application be reprogrammed to understand each new message header. Each application program uses only those headers that that specific application program is configured to understand. It may ignore those headers that it does not understand or cannot properly interpret.
The composable protocol may be a modified XML-based protocol, or it may be a modified TCP protocol whereby the additional headers are inserted into the data portion of each TCP message. When an application adds a new header to a message, the application may send a message to one or more VNDs that instructs each VND to create one or more handlers to route and/or dispatch based on the new header.
Each VND 103 may make routing decisions based on any header and/or data field within each message, or any combination of header and/or data fields within each message. Additional or fewer types of headers may be used. Each handler in each VND 103 provides instructions for routing based on message content.
For example, an application program may define and include an “action” header in each message to indicate the action that a user requests of a recipient. If a network user specifies the action subscribe and sets message data 305 to “baseball scores,” the message may indicate to a first server that the sending user wants to subscribe to a baseball scores email list. Further, the action field may be populated by a virtual function name, mapping to a specific function at each machine on which it is received. If a network user specifies the action subscribe and sets message data 305 to “MSDN,” the message may indicate to a second server that the sending user wants to subscribe to a physical magazine entitled MSDN Magazine. Thus, two applications may both use the action subscribe, each in a different manner, as defined by their respective subscribe functions.
In another example, with reference to
In another example, an application may include a header field named geographic_zone relating to a sending user's geographic location. Routing decisions may then be made based on the sender's physical location, so that messages are sent to a server located closest to the sending user. For instance, in a system that maintains two servers, the device may route a message to a first server in Seattle, Wash. when the geographic location header field indicates the sending user is located in Portland, Oreg., and may route the message to a second server in Chicago, Ill. when the geographic location header field indicates the sending user is located in Detroit, Mich. This avoids sending messages to distant servers when an equivalent server is nearby.
In another example, when a denial of service attack has been launched against one or more machines, a handler may be created that rejects all messages based on a ‘credentials’ field of each message. The ‘credentials’ field may or may not be the same as the message's ‘from’ field. For instance, the ‘credentials’ field may include a sending user's name, as well as authentication to prove that the sender is who he says he is, whereas the ‘from’ field may simply include a sender's IP address or logical name. The handler may be configured to accept a message when the message's ‘credentials’ field contains proper credentials for the sending machine. When a message is rejected, it may be completely ignored, freeing up resources to respond to legitimate messages.
In another example, with reference to
In order to make the virtual network self-healing, handlers may be created to regularly poll another machine or server to determine its network status. That is, where server ‘golf’ is a backup server for ‘echo,’ machine 4 may be configured to poll machine 3 at regular intervals in order to confirm that machine 3, and specifically server ‘echo,’ is functional. When machine 4 does not receive an acknowledgement from machine 3 (or ‘echo’) within a specified amount of time, e.g., ten seconds, machine 4 may initiate a failover sequence, whereby machine 4 begins sending routing messages to each machine's VND, indicating to each VND that when a message is received for ‘echo’ on machine 3, the message should instead be sent to ‘golf’ on machine 4.
Also using the architecture described in
With reference to
With reference to
An embodiment of the invention may be based on a modified version of the seven-level open systems interconnection (OSI) network model, as illustrated in
Using the above-described architecture, a network may route and dispatch messages based on different message content, on an individual message basis. The invention provides a network protocol that programmers may adapt and configure as needed using the API. Programmers, and programs using the API, may instruct VNDs how to route and dispatch incoming messages. That is, programmers send meta-messages to VNDs, where each meta-message is constructed according to the API and provides one or more routing and/or dispatching instructions.
The inventive methods may be embodied as computer readable instructions stored on a computer readable medium such as a floppy disk, CD-ROM, removable storage device, hard disk, system memory, or other data storage medium. Alternatively, the inventive methods may be embodied in a combination of hardware and software, or in only hardware.
While the invention has been described with respect to specific examples including presently preferred modes of carrying out the invention, those skilled in the art will appreciate that there are numerous variations and permutations of the above described systems and techniques that fall within the spirit and scope of the invention as set forth in the appended claims.
This application is a continuation of U.S. Pat. No. 7,257,817, issued Aug. 14, 2007, having the same title as above, and which in turn relates to and claims priority from U.S. Provisional Application Ser. No. 60/329,796, filed Oct. 16, 2001, and U.S. Provisional Application Ser. No. 60/346,370, filed Oct. 19, 2001, each of the above being herein incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
4953210 | McGlynn et al. | Aug 1990 | A |
5067104 | Krishnakumar et al. | Nov 1991 | A |
5224098 | Bird et al. | Jun 1993 | A |
5438508 | Wyman | Aug 1995 | A |
5499343 | Pettus | Mar 1996 | A |
5509000 | Oberlander | Apr 1996 | A |
5608551 | Biles et al. | Mar 1997 | A |
5680551 | Martino, II | Oct 1997 | A |
5761477 | Wahbe et al. | Jun 1998 | A |
5862411 | Kay et al. | Jan 1999 | A |
5903882 | Asay et al. | May 1999 | A |
5917912 | Ginter et al. | Jun 1999 | A |
5935219 | Holmes | Aug 1999 | A |
5968176 | Nessett et al. | Oct 1999 | A |
5974416 | Anand et al. | Oct 1999 | A |
5978836 | Ouchi | Nov 1999 | A |
6006259 | Adelman et al. | Dec 1999 | A |
6026441 | Ronen | Feb 2000 | A |
6047324 | Ford et al. | Apr 2000 | A |
6073242 | Hardy et al. | Jun 2000 | A |
6119171 | Alkhatib | Sep 2000 | A |
6122363 | Friedlander et al. | Sep 2000 | A |
6144961 | de la Salle | Nov 2000 | A |
6151618 | Wahbe et al. | Nov 2000 | A |
6158010 | Moriconi et al. | Dec 2000 | A |
6167513 | Inoue et al. | Dec 2000 | A |
6199112 | Wilson | Mar 2001 | B1 |
6209124 | Vermeire et al. | Mar 2001 | B1 |
6216231 | Stubblebine | Apr 2001 | B1 |
6219790 | Lloyd et al. | Apr 2001 | B1 |
6223619 | Shibata et al. | May 2001 | B1 |
6233619 | Narisi et al. | May 2001 | B1 |
6243749 | Sitaraman et al. | Jun 2001 | B1 |
6304913 | Rune | Oct 2001 | B1 |
6351748 | Deen et al. | Feb 2002 | B1 |
6356920 | Vandersluis | Mar 2002 | B1 |
6392997 | Chen | May 2002 | B1 |
6393456 | Ambler et al. | May 2002 | B1 |
6405212 | Samu et al. | Jun 2002 | B1 |
6405337 | Grohn et al. | Jun 2002 | B1 |
6408342 | Moore et al. | Jun 2002 | B1 |
6446113 | Ozzie et al. | Sep 2002 | B1 |
6449638 | Wecker et al. | Sep 2002 | B1 |
6453356 | Sheard et al. | Sep 2002 | B1 |
6466971 | Humpleman et al. | Oct 2002 | B1 |
6477580 | Bowman-Amuah | Nov 2002 | B1 |
6487552 | Lei et al. | Nov 2002 | B1 |
6496849 | Hanson et al. | Dec 2002 | B1 |
6505233 | Hanson et al. | Jan 2003 | B1 |
6505254 | Johnson et al. | Jan 2003 | B1 |
6507823 | Nel | Jan 2003 | B1 |
6507865 | Hanson et al. | Jan 2003 | B1 |
6522631 | Rosborough et al. | Feb 2003 | B2 |
6523063 | Miller et al. | Feb 2003 | B1 |
6532213 | Chiussi et al. | Mar 2003 | B1 |
6532455 | Martin et al. | Mar 2003 | B1 |
6546419 | Humpleman et al. | Apr 2003 | B1 |
6571236 | Ruppelt | May 2003 | B1 |
6578066 | Logan et al. | Jun 2003 | B1 |
6581060 | Choy | Jun 2003 | B1 |
6601171 | Carter et al. | Jul 2003 | B1 |
6601189 | Edwards et al. | Jul 2003 | B1 |
6615258 | Barry et al. | Sep 2003 | B1 |
6618825 | Shaw | Sep 2003 | B1 |
6654344 | Toporek et al. | Nov 2003 | B1 |
6665657 | Dibachi | Dec 2003 | B1 |
6667974 | Shigeta | Dec 2003 | B1 |
6675261 | Shandony | Jan 2004 | B2 |
6678827 | Rothermel et al. | Jan 2004 | B1 |
6724726 | Coudreuse | Apr 2004 | B1 |
6728767 | Day et al. | Apr 2004 | B1 |
6742114 | Carter et al. | May 2004 | B1 |
6745197 | McDonald | Jun 2004 | B2 |
6748453 | Law et al. | Jun 2004 | B2 |
6751562 | Blackett et al. | Jun 2004 | B1 |
6763040 | Hite et al. | Jul 2004 | B1 |
6779004 | Zintel | Aug 2004 | B1 |
6782414 | Xue et al. | Aug 2004 | B1 |
6782542 | Mein et al. | Aug 2004 | B1 |
6789118 | Rao | Sep 2004 | B1 |
6801528 | Nassar | Oct 2004 | B2 |
6850893 | Lipkin et al. | Feb 2005 | B2 |
6850979 | Saulpaugh et al. | Feb 2005 | B1 |
6851054 | Wheeler et al. | Feb 2005 | B2 |
6873975 | Hatakeyama et al. | Mar 2005 | B1 |
6891953 | DeMello et al. | May 2005 | B1 |
6920558 | Sames et al. | Jul 2005 | B2 |
6928442 | Farber et al. | Aug 2005 | B2 |
6970935 | Maes | Nov 2005 | B1 |
6976074 | Cabrera et al. | Dec 2005 | B2 |
6990585 | Maruyama et al. | Jan 2006 | B2 |
7035854 | Hsiao et al. | Apr 2006 | B2 |
7051339 | Deverill et al. | May 2006 | B2 |
7055143 | Ringseth et al. | May 2006 | B2 |
7065706 | Sankar | Jun 2006 | B1 |
7127511 | Tonouchi | Oct 2006 | B2 |
7149802 | Cabrera et al. | Dec 2006 | B2 |
7181731 | Pace et al. | Feb 2007 | B2 |
7194553 | Lucco et al. | Mar 2007 | B2 |
7293283 | Kaler et al. | Nov 2007 | B2 |
7409367 | McGill et al. | Aug 2008 | B2 |
7418457 | Kaler et al. | Aug 2008 | B2 |
7451157 | Kaler et al. | Nov 2008 | B2 |
20010009018 | Iizuka | Jul 2001 | A1 |
20020002581 | Siddiqui | Jan 2002 | A1 |
20020078233 | Biliris et al. | Jun 2002 | A1 |
20020126701 | Requena | Sep 2002 | A1 |
20020138582 | Chandra et al. | Sep 2002 | A1 |
20020143984 | Hudson Michel | Oct 2002 | A1 |
20020152214 | Muntz | Oct 2002 | A1 |
20020157004 | Smith et al. | Oct 2002 | A1 |
20020169781 | Poole et al. | Nov 2002 | A1 |
20020174178 | Stawikowski | Nov 2002 | A1 |
20020178103 | Dan et al. | Nov 2002 | A1 |
20020184319 | Willner et al. | Dec 2002 | A1 |
20020188638 | Hamscher | Dec 2002 | A1 |
20030041178 | Brouk et al. | Feb 2003 | A1 |
20030050966 | Dutta et al. | Mar 2003 | A1 |
20030065942 | Lineman et al. | Apr 2003 | A1 |
20030074357 | Nielsen et al. | Apr 2003 | A1 |
20030074367 | Kaler et al. | Apr 2003 | A1 |
20030074482 | Christensen et al. | Apr 2003 | A1 |
20030074579 | Della-Libera et al. | Apr 2003 | A1 |
20030093678 | Bowe et al. | May 2003 | A1 |
20030120593 | Bansal et al. | Jun 2003 | A1 |
20030159059 | Rodriquez et al. | Aug 2003 | A1 |
20040034715 | Dawson et al. | Feb 2004 | A1 |
20040088585 | Kaler et al. | May 2004 | A1 |
20050138353 | Spies et al. | Jun 2005 | A1 |
20050278390 | Kaler et al. | Dec 2005 | A1 |
20060041743 | Della-Libera et al. | Feb 2006 | A1 |
20060041929 | Della-Libera et al. | Feb 2006 | A1 |
20060212599 | Lucco et al. | Sep 2006 | A1 |
20060253699 | Della-Libera et al. | Nov 2006 | A1 |
20060253700 | Della-Libera et al. | Nov 2006 | A1 |
20080141028 | Wei et al. | Jun 2008 | A1 |
20080263166 | Beigi et al. | Oct 2008 | A1 |
Number | Date | Country |
---|---|---|
0715246 | Jun 1996 | EP |
1003308 | May 2000 | EP |
1024627 | Aug 2000 | EP |
1118925 | Jul 2007 | EP |
7141296 | Jun 1995 | JP |
11328033 | Nov 1999 | JP |
2000083049 | Mar 2000 | JP |
2000253066 | Sep 2000 | JP |
2000516406 | Dec 2000 | JP |
2000516407 | Dec 2000 | JP |
2002507295 | May 2002 | JP |
9534972 | Dec 1995 | WO |
9854644 | Dec 1998 | WO |
9937066 | Jul 1999 | WO |
0004458 | Jan 2000 | WO |
0008909 | Feb 2000 | WO |
0042748 | Jul 2000 | WO |
0146783 | Jun 2001 | WO |
0152496 | Jul 2001 | WO |
0158108 | Aug 2001 | WO |
2007073609 | Jul 2007 | WO |
Number | Date | Country | |
---|---|---|---|
20090046726 A1 | Feb 2009 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09993656 | Nov 2001 | US |
Child | 11838161 | US |