The invention relates generally to computer networks and message routing over computer networks. More specifically, the invention relates to methods and systems for providing and updating routing information in an extensible manner.
Currently, much of the utility of computer systems lies in their ability to communicate and share information with other computer systems. Information is typically passed between computer systems via computer networks. Computer networks are groups of computers interconnected by wires or wireless mechanisms such as infrared, radio, and other technologies. The Internet is a global network of many smaller computer networks connected to one another. There is no controlling central network, but rather several high level networks that are connected through network access points. A network access point is a computer hardware or software device (commonly a network router) that serves as a kind of translator between two different networks.
Web services, generally, refers to application-to-application communication over the Internet via programmatic interfaces. For example, a local application (e.g., Microsoft® Money) on a client computer may communicate with a server application on a remote computer to obtain stock ticker information. The two applications may communicate the requested ticker symbol and the corresponding results via one or more messages transmitted over the Internet, without opening or using a traditional Internet browser such as Internet Explorer®.
The advent of XML (eXtensible Markup Language) and other protocol-neutral communications mechanisms has made it easier for web services to be offered between computers residing on different networks, written in different languages, and/or using different operating systems, yet still communicate effectively in an interoperable manner. However, these protocol neutral mechanisms do not provide an extensible mechanism to describe and update local configuration determining the appropriate message path for a message intended for a specific web service.
Routing protocols such as the Routing Information Protocol (RIP) and Interior Gateway Routing Protocol (IGRP) provide router table update mechanisms. However, these protocols are not compatible for use with web services, e.g., using Simple Object Access Protocol (SOAP). In addition, RIP and IGRP are distance-based routing protocols that always route data based on a calculated shortest distance. RIP and IGRP are concerned with how to route a message at the IP layer, not how to update routing information in a router for use by an application at the application layer. Protocols such as BGP and EGP also are primarily directed to how to route messages, not how to update information in routing tables.
Another known routing protocol, Open Shortest Path First (OSPF), is a link-state routing protocol, which bases changes on the status and speeds of the physical links of the networked routers, and propagates the changes to every router on the network. When first initialized (e.g., powered on), an OSPF router uses a protocol termed a “hello protocol” to discover neighbors to which the router is connected. The router then exchanges link-state information with these routers. Using the link-state information, each router creates a database that includes of every interface, its corresponding neighbor and a metric representing the speed of that interface. Each router then passes this information along to all neighboring routers. The process is repeated in turn until every router in the network receives link state information for every other router in the network. Each router builds a tree indicating a path to every node on the network, using itself as the root. The tree is then used to create a routing table, which the router then uses to route messages in the network. OSPF, however, does not provide for updating routing tables with routing information other than that corresponding to a directly linked interface or router, nor does it provide for updating with information other than link-state information. Other limitations as with RIP and IGRP, described above, also apply to OSPF.
Thus, it would be an advancement in the art to provide a mechanism for describing exchange and deployment of message path configuration information in an extensible manner. It would be a further advancement in the art to allow message path configuration information to refer to multiple resources simultaneously. It would be a further advancement in the art to provide a message path configuration information mechanism that allows routing metadata statements to be refined by subsequent message path configuration information statements. It would be a further advancement in the art to provide a routing table update protocol that is compatible with platform-independent web services.
The inventive method and system overcome the problems of the prior art by providing a message path configuration information container that defines a scope of resources to which the message path configuration information applies. The generic metadata container can be used to provide statements describing objects, as well as to refine previously made metadata statements, such as statement providing referral information for a message router. That is, the scope may refer to a range of message destinations, and the metadata statement may include a referral statement providing new routing information for the scoped range of original destinations. Using scoped referral metadata statements, a network node can delegate a portion of its own address space, or request that another node delegate a portion of its address space, to a different network node.
A more complete understanding of the present invention and the advantages thereof may be acquired by referring to the following description in consideration of the accompanying drawings, in which like reference numbers indicate like features, and wherein:
According to one or more aspects of the invention, metadata is described using any protocol neutral communications mechanism, e.g., extensible Markup Language (XML), as further described below.
The invention is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
With reference to
Computer 110 typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 110 and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by computer 110. Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. Combinations of the any of the above should also be included within the scope of computer readable media.
The system memory 130 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 131 and random access memory (RAM) 132. A basic input/output system 133 (BIOS), containing the basic routines that help to transfer information between elements within computer 110, such as during startup, is typically stored in ROM 131. RAM 132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 120. By way of example, and not limitation,
The computer 110 may also include other removable/non-removable, volatile/nonvolatile computer storage media. By way of example only,
The drives and their associated computer storage media discussed above and illustrated in
The computer 110 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 180. The remote computer 180 may be a personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 110, although only a memory storage device 181 has been illustrated in
When used in a LAN networking environment, the computer 110 is connected to the LAN 171 through a network interface or adapter 170. When used in a WAN networking environment, the computer 110 typically includes a modem 172 or other means for establishing communications over the WAN 173, such as the Internet. The modem 172, which may be internal or external, may be connected to the system bus 121 via the user input interface 160, or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation,
One or more aspects of the invention may be embodied in computer-executable instructions, such as in one or more program modules, executed by one or more computers or other devices. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types when executed by a processor in a computer or other device. The computer executable instructions may be stored on a computer readable medium such as a hard disk, optical disk, removable storage media, solid state memory, RAM, etc. As will be appreciated by one of skill in the art, the functionality of the program modules may be combined or distributed as desired in various embodiments. In addition, the functionality may be embodied in whole or in part in firmware or hardware equivalents such as integrated circuits, field programmable gate arrays (FPGA), and the like.
For example, a web service 301 may be described by various metadata elements 303, 305, 307, 309, 311. Each metadata element may be communicated by the web service object 301 (or by a web service description service) to a requestor (not shown) to indicate how the requestor can communicate with the web service to receive information provided by the web service. Alternatively, object metadata might not be used by a requester, but instead may be used by the web service itself upon receipt from an authorized provider (e.g., providing updated policy metadata, access control metadata, etc.).
Suppose web service object 301 is a mailbox web service. Metadata element 303 may describe communication policies of web service 301, such as by indicating that web service 301 requires a Microsoft Passport ID, messages must be encrypted using triple-DES encryption, messages cannot exceed 1 MB in size, etc. Metadata element 305 may describe message routing information specific to the web service, e.g., indicating that messages intended for web service object 301 should be sent to a specified address or through a specified router or routers, as further described below.
Metadata element 307 may describe access information. That is, metadata may be used to describe who is authorized to access web service 301, such as only those users whose account is paid up to date. Access metadata may also include an access control list (ACL) defining who can access the mailbox web service. Metadata element 309 may describe transaction coordination information for communicating with web service 301, such as by indicating a transaction coordinator for web service 301, and/or other transaction information as described in copending application Ser. No. 10/211,299, filed Aug. 5, 2002, entitled “Coordinating Transactional Web Services.”
Metadata element 311 may describe custom features specific to web service object 301, such as mailbox services provided (supported addresses, mail formats, mail protocols, confirmation of delivery, etc.), requirements for various services, and the like.
Scope 403 indicates an arbitrary universe of targets (i.e., the object or objects) to which metadata element 401 corresponds. For example, scope 403 may include a URI (http://www.Microsoft.com/), indicating that metadata element 401 describes any web page or web service located under that URI. Scope 403 may include a portion of a directory hierarchy (e.g., c:\root\users\jdoe\), indicating that metadata element 401 describes all files located at or below the specified subdirectory. Scope 403 can also refer to users or user identities, e.g., *@xyz.com, jdoe@xyz.com, “John Doe”, etc. Scope 403 may also refer to a user based on biometric information, e.g., by including a digital representation of biometric information specific to the user, such as a fingerprint, thus indicating that the metadata element 401 describes the user with the fingerprint to which the digital biometric information corresponds.
Scope 403 may describe multiple objects using lists, ranges, or any known object description technique, and may describe the universe of targets in an additive (John Doe, but no one else) or subtractive (everyone but John Doe) manner, using declarative (scope =“John Doe”), programmatic (scope=run this Java applet), extensional (scope=John, Bill, Mary) and/or intesional (e.g., scope=The Jones Family, scope=John's mother's dog) descriptors. Scope 403 may describe the scope using arbitrarily complex relationships. Using the generic scope container, metadata element 401 can refer to virtually any object. For example, scope can refer to messages of a specified form, and further based on whether the current location is an intermediary node in a network or a terminal node of a data message. Scope 403 can also depend on whether messages are being sent from a location or to a location, and messages that contain specific information (e.g., the word “banana” in the message body). Scope can refer to messages that have been authenticated, and even to messages that have been authenticated using a specified technology (e.g., X509) or service (e.g., VeriSign), security token of a specific format as well as authority, strength of authentication, biometric data, smart card, or the like. Scope can also refer to the message in which the scope is being communicated (e.g., by message ID). One of skill in the art will appreciate that scope 403 can refer to any universe of targets that can be positively identified based on the data stored in scope 403.
Properties 405 describe properties of metadata element 401. That is, properties 405 may be thought of as metadata describing metadata element 401, such as name, author, expiration date/time, etc., of metadata element 401.
Each statement 407 provides some substantive metadata included in metadata element 401. Statements may be affirmatively recited (e.g., Max_Msg_Len=1024) or included by reference (e.g., Include IDREF=“xx”), where the IDREF indicates a file or other object storing one or more metadata statements. Inclusion by reference may be used, for example, when multiple metadata elements need to ensure that identical statements are used. One of skill in the art will appreciate that any external reference may be used to include metadata statements, such as a URI, etc., and also that inclusion by reference may also be used for scope, properties, and security elements.
Security 409 describes security semantics and/or authentication measures to be applied to metadata element 401. For example, security 409 may include a digital signature to ensure that the metadata comes from a source authorized to promulgate the included or referenced metadata statements. One of skill in the art will appreciate that multiple scope, properties, statement, and/or security elements may be included in metadata element 401 as necessary, e.g., to include a scope with two mutually exclusive ranges making up the universe of targets. In addition, scopes, properties, statements, and security information may all be described using arbitrarily complex relationships using any combination of logical operands.
The generic metadata element 401 may be described in any protocol-neutral or platform-independent description language, such as XML, Java (or other Java-derived language), and the like. A metadata element described using XML may take a form similar to that illustrated in
According to another illustrative aspect of the invention, with reference to
When two metadata elements refer to the same scope, one metadata element can merge with, replace, or intersect with another metadata element. When the statements of two metadata elements do not conflict, the two metadata elements may be merged together. When the statements do conflict, one metadata element may replace the other, or they may be intersected. During intersection, non-conflicting metadata statements are merged, while conflicting metadata statements are selected according to the most recent or superceding metadata element.
For example, as illustrated in
According to another aspect of the invention, logical inferences or an inherent or natural hierarchy may be used to determine whether one metadata element supercedes another. For example, a metadata element with scope=http://www.foo.com/bar may automatically supercede another metadata element with scope=http://www.foo.com/.
Using metadata refinement and replacement, a web service can define default metadata for general services, and refine the default metadata for based on various service levels. For example, a default metadata element may indicate that Passport authentication must be used, but remain silent as to each user's maximum mailbox size. This default metadata can then be refined to indicate that the maximum mailbox size for users in the default “silver” service level is 1.5 MB. Another metadata element may refine the default metadata element and indicate, for messages authenticated as being from a “gold” service level member, the maximum mailbox size is 10 MB.
As indicated above, routing metadata may be used to convey information directed towards adding, updating, and querying routing information for an object (e.g., a web service), referred to herein as referral metadata. Referral metadata may be used to configure message path information in a network node. Prior to being able to effectively communicate with a web service, a requestor must learn where to send messages in order to contact the web service. That is, the requester must obtain the referral metadata associated with the web service in order to learn where to send messages to communicate with the web service. According to an illustrative aspect of the invention, a metadata type may optionally be included, e.g., <Metadata Type=“referral”> . . . </Metadata> to indicate a class or type of metadata. One of skill in the art will appreciate that alternative syntax, as is known in the art, may be used to indicate a metadata type. For example, metadata statements may include a “type” indicator instead of placing the “type” indicator in the metadata element's header.
Metadata statements 805 indicate the message handler to which messages can be sent in order to reach the object or objects encompassed by the scope. Each message handler may be a message intermediary (such as a router or a machine that substantively processes the message prior to delivery to the recipient) or a message recipient, collectively referred to as nodes. Metadata statement 805 may include one or more attributes 811 indicating a specific message handler to which the message can be directed. The ‘exact’ attribute (or similar) may be used to indicate nodes for which an exact match is needed, and may be expressed as a uniform resource identifier (URI). The ‘prefix’ attribute (or similar) may be used to indicate nodes for which a prefix match is needed. Optionally, referral metadata element may include properties 807 (e.g., name author, unique message ID, etc.) and security information 809, as described above.
According to an illustrative aspect of the invention, referral information may indicate a choice of acceptable referral options, e.g., by including multiple attributes 811 in the statements 805 of the metadata element 801. Optionally, an order of preference for each option may be provided. For example, a web service may provide two login servers. The web service may further indicate priorities for each server, e.g., that the first server should be used as a default, that second server should be used when the first server becomes unavailable or overloaded. The web service may optionally also specify requirements for each option. For example, if the first server is to be used, the message must contain an authentication token using the X.509 standard by the Internet Engineering Task Force (IETF). Logical operands or equivalents can be used (e.g., AND, NOT, OR, XOR, OPTIONAL, REQUIRED, etc.) to describe relationships, scopes, choices, and the like, or alternatively, individual attributes may be specified for each criterion.
According to another aspect of the invention, with reference to
In an illustrative embodiment of the invention, the referral metadata elements may be stored in a header of a SOAP message, along with other headers that perform other unique functions (e.g., security, authentication, message routing), thus creating a composable message protocol such as is described in co-pending application Ser. No. 09/983,555 (filed Oct. 24, 2001). As illustrated in
Thus, using the above described referral metadata, with reference to
In another example, with reference to
In another example, with reference to
With reference to
According to another aspect of the invention, a node can explicitly request that another node accept or reject a referral metadata element. This can be used, for example, to explicitly request that a node delegate a piece of its URI space to another node. The request may be sent in the form of a registration message, with the response returned in a registration response message.
According to one illustrative embodiment, a node accepts a registration request by simply returning an acknowledgement message 2001, as illustrated in
While some of the examples included herein, such as those illustrated in
While the invention has been described with respect to specific examples including presently preferred modes of carrying out the invention, such as using SOAP XML, those skilled in the art will appreciate that there are numerous variations and permutations of the above described systems and techniques, such as using other platform-independent mechanisms such as Java or a Java-based language. Thus, the spirit and scope of the invention should be construed in view of the appended claims.
This application claims priority to provisional U.S. application Ser. Nos. 60/329,796 filed Oct. 16, 2001, 60/346,370 filed Oct. 19, 2001, and 60/371,155 filed on Apr. 10, 2002.
Number | Name | Date | Kind |
---|---|---|---|
4953210 | McGlynn | Aug 1990 | A |
5067104 | Krishnakumar | Nov 1991 | A |
5224098 | Bird | Jun 1993 | A |
5438508 | Wyman | Aug 1995 | A |
5499343 | Pettus | Mar 1996 | A |
5509000 | Oberlander | Apr 1996 | A |
5608551 | Biles | Mar 1997 | A |
5680551 | Martino | Oct 1997 | A |
5761477 | Wahbe | Jun 1998 | A |
5862411 | Kay | Jan 1999 | A |
5903882 | Asay | May 1999 | A |
5917912 | Ginter | Jun 1999 | A |
5935219 | Holmes | Aug 1999 | A |
5968176 | Nessett | Oct 1999 | A |
5974416 | Anand | Oct 1999 | A |
5978836 | Ouchi | Nov 1999 | A |
6006259 | Adelman | Dec 1999 | A |
6026441 | Ronen | Feb 2000 | A |
6047324 | Ford | Apr 2000 | A |
6119171 | Alkhatib | Sep 2000 | A |
6122363 | Friedlander | Sep 2000 | A |
6144961 | De La Salle | Nov 2000 | A |
6151618 | Wahbe | Nov 2000 | A |
6158010 | Moriconi | Dec 2000 | A |
6167513 | Inoue | Dec 2000 | A |
6199112 | Wilson | Mar 2001 | B1 |
6209124 | Vermeire | Mar 2001 | B1 |
6216231 | Stubblebine | Apr 2001 | B1 |
6219790 | Lloyd | Apr 2001 | B1 |
6223619 | Shibata | May 2001 | B1 |
6233619 | Narisi | May 2001 | B1 |
6243749 | Sitaraman | Jun 2001 | B1 |
6304913 | Rune | Oct 2001 | B1 |
6351748 | Deen | Feb 2002 | B1 |
6356920 | Vandersluis | Mar 2002 | B1 |
6393456 | Ambler | May 2002 | B1 |
6405212 | Samu | Jun 2002 | B1 |
6405337 | Grohn | Jun 2002 | B1 |
6408342 | Moore | Jun 2002 | B1 |
6446113 | Ozzie | Sep 2002 | B1 |
6449638 | Wecke | Sep 2002 | B1 |
6453356 | Sheard | Sep 2002 | B1 |
6466971 | Humpleman | Oct 2002 | B1 |
6477580 | Bowman-Amuah | Nov 2002 | B1 |
6496849 | Hanson | Dec 2002 | B1 |
6505233 | Hanson | Jan 2003 | B1 |
6505254 | Johnson | Jan 2003 | B1 |
6507823 | Nel | Jan 2003 | B1 |
6507865 | Hanson | Jan 2003 | B1 |
6522631 | Rosborough | Feb 2003 | B2 |
6523063 | Miller | Feb 2003 | B1 |
6532213 | Chiussi | Mar 2003 | B1 |
6532455 | Martin | Mar 2003 | B1 |
6546419 | Humpleman | Apr 2003 | B1 |
6571236 | Ruppelt | May 2003 | B1 |
6578066 | Logan | Jun 2003 | B1 |
6601171 | Carter | Jul 2003 | B1 |
6601189 | Edwards | Jul 2003 | B1 |
6615258 | Barry | Sep 2003 | B1 |
6618825 | Shaw | Sep 2003 | B1 |
6654344 | Toporek | Nov 2003 | B1 |
6665657 | Dibachi | Dec 2003 | B1 |
6667974 | Shigeta | Dec 2003 | B1 |
6675261 | Shandony | Jan 2004 | B2 |
6678827 | Rothermel | Jan 2004 | B1 |
6724726 | Coudreuse | Apr 2004 | B1 |
6728767 | Day | Apr 2004 | B1 |
6742114 | Carter | May 2004 | B1 |
6745197 | McDonald | Jun 2004 | B2 |
6748453 | Law | Jun 2004 | B2 |
6751562 | Blackett | Jun 2004 | B1 |
6763040 | Hite | Jul 2004 | B1 |
6782414 | Xue | Aug 2004 | B1 |
6782542 | Mein et al. | Aug 2004 | B1 |
6789118 | Rao | Sep 2004 | B1 |
6850893 | Lipkin | Feb 2005 | B2 |
6850979 | Saulpaugh | Feb 2005 | B1 |
6851054 | Wheeler | Feb 2005 | B2 |
6873975 | Hatakeyama | Mar 2005 | B1 |
6891953 | DeMello | May 2005 | B1 |
6920558 | Sames | Jul 2005 | B2 |
6928442 | Farber | Aug 2005 | B2 |
6970935 | Maes | Nov 2005 | B1 |
6976074 | Cabrera | Dec 2005 | B2 |
6990585 | Maruyama | Jan 2006 | B2 |
7051339 | Deverill | May 2006 | B2 |
7055143 | Ringseth et al. | May 2006 | B2 |
7065706 | Sankar | Jun 2006 | B1 |
7127511 | Tonouchi | Oct 2006 | B2 |
7149802 | Cabrera | Dec 2006 | B2 |
7194553 | Lucco | Mar 2007 | B2 |
7257817 | Cabrera | Aug 2007 | B2 |
7293283 | Kaler | Nov 2007 | B2 |
7409367 | McGill | Aug 2008 | B2 |
7418457 | Kaler | Aug 2008 | B2 |
7451157 | Kaler | Nov 2008 | B2 |
7453875 | Vernal et al. | Nov 2008 | B2 |
20010009018 | Iizuka | Jul 2001 | A1 |
20020002581 | Siddiqui | Jan 2002 | A1 |
20020078233 | Biliris | Jun 2002 | A1 |
20020126701 | Requena | Sep 2002 | A1 |
20020138582 | Chandra | Sep 2002 | A1 |
20020143984 | Hudson | Oct 2002 | A1 |
20020152214 | Muntz | Oct 2002 | A1 |
20020157004 | Smith | Oct 2002 | A1 |
20020169781 | Poole | Nov 2002 | A1 |
20020174178 | Stawikowski | Nov 2002 | A1 |
20020178103 | Dan | Nov 2002 | A1 |
20020184319 | Willner et al. | Dec 2002 | A1 |
20020188638 | Hamscher | Dec 2002 | A1 |
20030041178 | Brouk | Feb 2003 | A1 |
20030050966 | Dutta et al. | Mar 2003 | A1 |
20030065942 | Lineman | Apr 2003 | A1 |
20030074367 | Kaler | Apr 2003 | A1 |
20030074413 | Nielsen et al. | Apr 2003 | A1 |
20030074482 | Christensen | Apr 2003 | A1 |
20030074579 | Della-Libera | Apr 2003 | A1 |
20030093678 | Bowe | May 2003 | A1 |
20030120593 | Bansal | Jun 2003 | A1 |
20030159059 | Rodriquez | Aug 2003 | A1 |
20040088585 | Kaler | May 2004 | A1 |
20050138353 | Spies | Jun 2005 | A1 |
20050278390 | Kaler | Dec 2005 | A1 |
20060041743 | Della-Libera | Feb 2006 | A1 |
20060041929 | Della-Libera | Feb 2006 | A1 |
20060212599 | Lucco | Sep 2006 | A1 |
20060253699 | Della-Libera | Nov 2006 | A1 |
20060253700 | Della-Libera | Nov 2006 | A1 |
20080141028 | Wei | Jun 2008 | A1 |
20080263166 | Beigi et al. | Oct 2008 | A1 |
20090046726 | Cabrera | Feb 2009 | 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 | |
---|---|---|---|
20030074357 A1 | Apr 2003 | US |
Number | Date | Country | |
---|---|---|---|
60371155 | Apr 2002 | US | |
60346370 | Oct 2001 | US | |
60329796 | Oct 2001 | US |