Executing dynamically assigned functions while providing services

Abstract
Methods, systems, and computer program products for applying actions during server system processing. Functional processing blocks where actions may be applied to a service request are identified. actions are dynamically associated with functional processing blocks. During execution of a functional processing block, a check is performed to determine whether an action is associated with the functional processing block. If an action is associated with a functional processing block, the action is applied during the functional processing block's execution. An evaluation may be performed to determine if an action should be applied before or after the functional processing block. The server system may comprise an XML data repository, providing access to XML data, based on identity information which is received with a client system request. A portion of the server system may be described in accordance with an XML schema.
Description
BACKGROUND OF THE INVENTION

1. The Field of the Invention


The present invention relates to the field of computer services. Specifically, the present invention relates to methods, systems, and computer program products for applying one or more functions during processing that may occur in a server providing one or more services.


2. Background and Related Art


Typically, before being deployed in a live system, services undergo significant testing to uncover programming errors and to evaluate performance. While useful, such testing often is able only to estimate full-scale use. As a result, certain program errors or performance problems may go undetected in development or testing environments. Finding these latent problems usually involves monitoring the operation of a service in one form or another. Furthermore, independent of programming errors or unexpected performance considerations, monitoring a service may be helpful in uncovering hardware failures and system attacks.


However, monitoring services for purposes of debugging, performance, hardware problems, system attacks, and the like, often involves various complex issues. For example, services by nature tend to be accessed by large numbers of clients. The shear volume of transactions can make monitoring services a significant exercise. Moreover, monitoring itself may introduce some amount of processing overhead. While the overhead for a single transaction is relatively small, the aggregate overhead for a large number of transactions may result in unacceptable levels of performance and skew any conclusions that are reached from the monitoring.


As a general rule, discovering problems through monitoring is an iterative process. For example, as noted above, it may be impractical to produce all possible monitoring information at all times, either due to the amount of monitoring information that will be produced or due to the negative effect that such monitoring may have on overall system performance. Therefore, monitoring often begins by detecting some type of high-level irregularity. Once discovered, the high-level irregularity may lead to more specific monitoring of increasingly specific processing or functionality until the problem's cause is discovered and corrected. After a particular problem is corrected, monitoring often returns back to the high-level system view.


In some systems, the iterative process of moving back and forth between high-level system monitoring and relatively lower level monitoring of specific service processing or functionality may require shutting services and/or servers down and restarting them. Furthermore, certain monitoring tools may require significant expertise to use, including programming skills. For many, the level of skill required may reduce the effectiveness of a particular monitoring tool or prevent its use all together. Also, monitoring tools are often specific to the environment in which they run, requiring administrators of heterogeneous systems to use different monitoring tools for each distinct system. Accordingly, methods, systems, and computer program products are desired for dynamically applying a function during any of various processing steps that may occur in providing a service to a client system.


BRIEF SUMMARY OF THE INVENTION

The present invention extends to methods, systems and computer products for dynamically executing one or more functions at any of one or more processing steps that may occur in providing a service to a client system. In one embodiment, executing the one or more functions during identified processing steps provides significant flexibility for dynamically monitoring the operation of the service being analyzed. By identifying particular processing steps that are executed during operation of the service, specific functions may be designated for execution when the processing steps occur. These specific functions are dynamically associated with the processing steps so that the type and extent of monitoring can be adjusted quickly to allow for rapid and efficient problem diagnosis.


As a processing step executes, a check is performed to determine if an operation or action is associated with the processing step. This may include evaluating whether an associated operation should be performed before the processing step or after the processing step. Then, for processing steps with an associated operation, the operation is applied in conjunction with the execution of the processing step. Typically, the processing steps are related to processing requests from clients systems that are directed to a service. In these circumstances, request for the service is received, a response to the request is generated, and the response is sent to the client.


The response and request may be organized hierarchically within a network message. One popular hierarchical organization uses eXtensible Markup Language (“XML”) formatted data, with network messages being based on Simple Object Access Protocol (“SOAP”). Although binary data is contrary to the XML standard, the invention may include binary data within the hierarchical organization. For example, it may be desirable to attach certain debugging or diagnostic information to a request or response, and a binary format may be a convenient representation for that information.


Functions associated with processing steps may be predefined or custom, depending on monitoring needs or wants. Predefined functions are advantageous because certain operations or actions are likely to be commonly used in many monitoring scenarios and therefore predefined functions may provide enhanced value. By allowing for custom functions, individual monitoring circumstances may be addressed in a meaningful way. Describing at least a portion of the server system in terms of a hierarchical organization may add to the flexibility of custom functions and provide a mechanism for writing monitoring functions that are useful across multiple operating platforms. Here again, an organization based on XML may be desirable given the popularity and flexibility of the language.


Typical operations for functions may include a logging function and a filtering function. In general, logging functions write certain information to a log of some sort for analysis. Filtering functions may be used to end processing of a request and send a response to the requesting client. Among other things, logging and filtering may be useful in monitoring error conditions that occur while processing a client's request.


Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the invention. The features and advantages of the invention may be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims. These and other features of the present invention will become more fully apparent from the following description and appended claims, or may be learned by the practice of the invention as set forth hereinafter.





BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and other advantages and features of the invention can be obtained, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered as limiting its scope, the invention will be described and explained with additional specificity and detail through the use of the accompanying drawings in which:



FIG. 1 is a block diagram of an example server system embodiment that operates in accordance with the present invention;



FIG. 2A shows an example XML document corresponding to the example XML schema of FIG. 2B;



FIG. 2B illustrates an example XML schema corresponding to the example XML document of FIG. 2A;



FIG. 3A shows an example XML document corresponding to the example xPath statement of FIG. 3B;



FIG. 3B illustrates an example xPath statement corresponding to the example XML document of FIG. 3A.



FIG. 4A depicts the hierarchy of an example SOAP message;



FIG. 4B shows the request portion of an overall example hierarchy illustrated in FIG. 5;



FIG. 4C shows the response portion of an overall example hierarchy illustrated in FIG. 5;



FIG. 5 shows a more complete portion of a hierarchal organization for message processing corresponding to the example server system embodiment of FIG. 1;



FIG. 6 illustrates an example organization for assigning functions to processing steps in accordance with the present invention;



FIGS. 7A-7B show a flowchart of a method for executing one or more functions at any of one or ore processing steps in accordance with the present invention; and



FIG. 8 illustrates an exemplary system that provides a suitable operating environment for the present invention.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The present invention extends to methods, systems, and computer program products for applying one or more operations or actions during the processing that may occur in a server providing one or more services. Through the identification of discrete processing steps that are executed while a service operates, specific operations may be executed along with each processing step. These operations are dynamically associated with the processing steps such that as a processing step executes, a check is performed to determine if any operations exists for the processing step. For processing steps that include an operation, the operation is applied during execution of the processing step.


Embodiments within the scope of the present invention may comprise one or more special purpose and/or one or more general purpose computers including various computer hardware, as discussed in greater detail below. Embodiments within the scope of the present invention also include computer-readable media for carrying or having computer-executable instructions or data structures stored thereon. Such computer-readable media can be any available media that can be accessed by a general purpose or special purpose computer. By way of example, and not limitation, such computer-readable media can comprise physical storage media such as RAM, ROM, EEPROM, CD-ROM or other optical disc storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to carry or store desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer. When information is transferred or provided over a network or another communications connection (either hardwired, wireless, or a combination of hardwired or wireless) to a computer, the computer properly views the connection as a computer-readable medium. Thus, any such connection is properly termed a computer-readable medium. Combinations of the above should also be included within the scope of computer-readable media. Computer-executable instructions comprise, for example, instructions and data which cause a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions.



FIG. 1 shows a block diagram of an example server system that operates in accordance with the present invention. The server system uses several distinct processing layers in processing a request 101a from a client, including a parse layer, a security layer, a cryptography layer and a service layer. Each of these layers is divided into a request processing component and a response processing component. There are corresponding response and request components for each layer. Note, however, that the present invention is not necessarily limited to any particular process layering or component division.


On the request 101a, an incoming request first passes through parse component 120a. For example, parse component 120a may be used to parse a request 101a that includes XML data, such as the XML document 200A shown in FIG. 2A. By way of background, XML is a markup language that provides for data typing and namespaces. For XML document 200A, the default namespace is “x-schema:classSchema.xml” 201A(1). This informs the parser to validate the document against the schema “x-schema” at the URL “classSchema.xml.”



FIG. 2B shows the entire schema for the document of FIG. 2A. The op level of the schema is <Schema></Schema> element pair 200B that contains the declaration of the schema namespace and, in this case, the declaration of the “datatypes” namespace as well. The first, “xmins=“urn:schemas-microsoft-com:xml-data”,” 200B(1) indicates that this XML document is an XML Schema. The second, “xmlns:dt=“urn:schemas-microsoft-com:datatypes”,” 200B(2) allows for typing element and attribute content by using a “dt” prefix on the type attribute within their ElementType and AttributeType declarations.


“ElementType” assigns a type and conditions to an element, and what, if any, child elements it can contain; “AttributeType” assigns a type and conditions to an attribute; “attribute” declares that a previously defined attribute type can appear within the scope of the named ElementType element; and “element” declares that a previously defined element type can appear within the scope of the named ElementType element. The content of the schema begins with the AttributeType and ElementType declarations of the innermost elements, namely:















<AttributeType name=‘studentID’ dt:type=‘string’
220B(1);


required=‘yes’/>


<ElementType name=‘name’ content=‘textOnly’/>
200B.1; and


<ElementType name=‘GPA’ content=‘textOnly’ dt:type=
200B.2.


‘float’/>









The next ElementType declaration is followed by its attribute and child elements. When an element has attributes or child elements, they are in its ElementType declaration. They also are previously declared in their own ElementType or AttributeType declaration. In particular,


















<ElementType name=‘student’ content=‘mixed’>
220B;



  <attribute type=‘studentID’/>
220B(1)′;



  <element type=‘name’/>
220B.1′;



  <element type=‘GPA’/>
220B.2′; and



</ElementType>
220B.











The process is continued throughout the rest of the schema until every element and attribute has been declared:


















<ElementType name=‘class’ content=‘eltOnly’>
201B;



  <element type=‘student’/>
;



</ElementType>
201B.










Notice that the reference numbers for the XML document shown in FIG. 2A correspond to the schema declarations in FIG. 2B. Specifically,


















<class xmlns=“x-schema:classSchema.xml”>
201A;



  <student studentID=“13429”>
220A;



    <name>James Smith</name>
220A.1;



    <GPA>3.8</GPA>
220A.2;



  </student>
220A;



</class>
201A.










The example XML document 300A in FIG. 3A will be used in conjunction with the xPath statement 300B shown in FIG. 3B. In general, xPath uses abstract document relationships in identifying parts of a document. For example, the xPath statement 300B locates Smith's numbers within the XML document 300A. Similar to FIGS. 2A and 2B, notice that the reference numbers for the XML document 300A of FIG. 3A correspond to xPath statement 300B of FIG. 3B.


Specifically, the “/descendant::contact” portion 301B of the xPath statement 300B maps to descendants of the <contact></contact> tag pair 301A. The “[name=“Smith”]” portion 320B selects the “<name>Smith</name>” 320A contact entry, and the “/child:numbers” portion 340B selects the <numbers></numbers> children of contact 301A. “/child::*” identifies the specific children (i.e., “<home>801-555-1234</home>” 340A.1 and “<cell>801-555-4321</cell>” 340A.2) that are of interest. (The star or asterisk is a wildcard indicating that all children are of interest.)


Referring back to FIG. 1, parse component 120a includes before functions 122a that are executed prior to parse component 120a and after functions 124a that are executed after parse component 120a. Path 120c shows that processing may proceed to parse 120b on the response side following the operation of parse component 120a. Proceeding to parse 120b following parse 120a may be the result of a parse error or may be dictated by before functions 122a or after functions 124a, in which case it makes little sense to continue on to security 130a. For example, after at least some parsing, after functions 124a may be able to determine that some problem exists with the request 101a. After functions 124a may determine that request 101a is part of a denial of service attack or that request 101a includes content or originates from a source that is blocked for some reason, such as inappropriate material or spam.


Parse component 120a may indicate that processing should continue with security component 130a. Security component 130a determines the identity associated with the request 101a. In one embodiment, this involves determining an application identifier, a user identifier, and a platform identifier for request 101a, because the service layer provides storage and access to data that is identity specific. For example, a user may access the service layer for email, calendar items, contacts, etc., using both a PC and a handheld device. The security layer, and security component 130a, determines the appropriate identity so that data and operations are appropriate to the device being used for access. Similarly, different users may be allowed different access to the same data. For example, an owner might be able to add, delete, and modify data, whereas a delegate may only have read privileges. The type of access permitted is controlled by role list database that contains various rules for determining access rights. Nevertheless, as noted the present invention does not necessarily require a security layer, and if one is present, it need not operate as security component 130a. A failure in the security layer may result in proceeding along path 130c or assigning default access privileges.


It may seem somewhat redundant to allow for both after functions 124a in parse component 120a and before functions 132a in security component 130a. However, because processing may proceed along path 120c, functions 132a will not necessarily be invoked for a request 101a. Further, associating functions closely with a particular layer provides for greater clarity as to when the function will be executed. A similar analysis holds true for after functions 134b of security component 130b and before functions 122b of parse component 120b. It should be emphasized, nevertheless, that the present invention does not necessarily require the specific association of functions with processing steps that is shown in FIG. 1. Therefore, the assignment of functions to processing steps should be interpreted broadly to cover a wide range of function associations. From security component it 130a, processing proceeds to either security component 130b or to cryptography component 140a.


Similar to other components, cryptography component 140a includes before functions 142a and after functions 144a. Cryptography component 140a is responsible for any decryption that is needed for request 101a. In one embodiment, request 101a is a Simple Object Access Protocol (“SOAP”) request, conforming to the hierarchy 400A illustrated in FIG. 4A. Basically, a SOAP message includes an envelope 420A with a header 420A.1 and a body 420A.2, where the envelope 420A is at the root level 401A.



FIG. 4B shows the request portion and FIG. 4C shows the response portion of an overall example hierarchy illustrated in FIG. 5. Here too, references have been selected so that corresponding portions are FIGS. 4A, 4B, and 4C are similarly numbered. The example hierarchy illustrated in FIG. 5 will be described in greater detail below. It should be noted that in FIG. 4B, envelope 420B is at the request level 401B (rather than the root level) and that the request level 401B includes additional information 440B. Envelope 420B continues to include header 420B.1 and body 420B.2. Likewise, in FIG. 4C, envelope 420C is at the response level 401C (rather than the root level) and the response level 401C includes additional information 440C. Envelope 420C continues to include header 420C.1 and body 420C.2.


Adding the request level 401B and the response level 401C removes ambiguity from the single root level 401A that is illustrated in FIG. 4A. As a result, it is clear whether a locator statement such as an xPath statement references a request 101a or response 101b (both of FIG. 1), without the need to determine the processing context of the xPath statement. The additional information 440B and 440C may be used to store information that may be helpful in monitoring a service. The additional information may comprise binary data, including a data structure or data object. For example, additional information 440C may contain a detailed error chain. The present invention is not limited to any particular type or format of additional information.


Returning now to FIG. 1, the body of a SOAP request is encrypted, so cryptography component 140a performs the necessary decryption. Those of skill in the art will recognize that there is not much value to parsing an encrypted SOAP body. Therefore, parse 120a may be limited initially to those portions of request 101a that are not encrypted. Then, following cryptography 140a, parse component 120a may continue with the decrypted portions of request 101a. At this point, it is worth noting that the flow from layer to layer need not be strictly sequential to fall within the scope of the present invention. A cryptography failure will result in proceeding with processing along path 140c.


Following cryptography 140a, processing proceeds to service 150a and before functions 152a and after functions 154a. Service 150a represents the processing that carries out the methods that may be included with request 101a. For example, request 101a may attempt to query, insert, replace, update or delete data maintained by service 150a, such as email, calendar items, contacts, spreadsheet, word processing documents, or the like. Although described as a data store that is manipulated with XML, the present invention is not necessarily limited to any particular type or service, or any particular access mechanism for identity-specific data.


Turning next to the processing for response 101b, service component 150b prepares an appropriate response to the methods that may be included with request 101a. For example a response may include data that is queried or indicate whether an insert, update, replace, or delete operation was successful or failed. Failures may include error codes of some sort, with more substantial debugging or error information in the response's additional information 440C (FIG. 4C). Service component 150b includes before functions 152b and after functions 154b. Notice that the ordering of the before functions and after functions on the response side is opposite the ordering on the request side because the flow from layer to layer is reversed.


Cryptography component 140b follows service component 150b or path 140c from cryptography 140a. As indicated earlier, the body of a SOAP message is encrypted. For response 101b, the cryptography layer, and cryptography component 140b in particular, performs the encryption. Note that service component 150b and cryptography component 140b essentially perform analogous or complementary functionality for the corresponding service component 150a and cryptography component 140a of the respective layers.


The present invention, however, does not necessary require analogous or complementary functionality in each layer. For example, there is no analogous or complementary functionality provided by security 130b. Nevertheless, it may still be desirable to allow for before functions 132b and after functions 134b, whether processing flowed from cryptography component 140b or from security component 130a through processing path 130c.


Like security component 130b, there is no analogous or complementary function of parse component 120a to be performed by parse component 120b. Still, before functions 122b and after functions 124b may provide desirable functionality in some circumstances. Both parse component 120b and security component 130b may simply pass whatever is present in response 101b to the next level.


At this stage, it may be worth identifying some types of functions that may be applicable to each processing layer. Two examples of commonly applicable functions are logging and filtering. Logging is generally associated with monitoring, although not exclusively so. For performance, debugging, identifying hardware problems, detecting system attacks, and the like, logging may provide valuable information for each layer (both prior to and following execution of the layer). Filtering relates to terminating further processing, usually with respect to a request. Filtering might include detecting a denial of service attack or other type of attack, preventing access to certain content, such as pornographic material, stopping spam or other unsolicited interaction, or the like.



FIG. 5 shows a more complete portion of a hierarchal organization for message processing corresponding to the example server system embodiment of FIG. 1. Server 501 identifies at least one server that is responsible for providing one or more services. Note that server 501 provides services for messages directed to myInbox (540), messages directed to myCalendar (560), and messages directed to other services. In some circumstances it may be desirable for a single server to provide multiple services whereas in other circumstances it may be desirable for a server to provide only one service. In addition, a single server may be made up of multiple computers and multiple servers may be used to provide a single service. The present invention does not require any particular hardware configurations and each of the foregoing examples, including combinations thereof, is an example of a server system and should be included within the scope of the present invention.


Server 501 includes various status indicators 520, including alarms 520.1 and timers 520.2. These status indicators may be used by any of the processing layers shown in FIG. 1. Within myInbox 540, service configuration 520.3 and system document 520.4 contain configuration information, security information, identity information, and other data that may be necessary or useful a service. As noted earlier, for a particular message, such as message 540.3, request 540.3.1, with envelope 540.3.1.1, header 540.3.1.1.1, body 540.3.1.1.2, and additional information 540.3.1.2, and response 540.3.2, with envelope 540.3.2.1, header 540.3.2.1.1, body 540.3.2.1.2, and additional information 540.3.2.2, correspond to FIGS. 4B and 4C, respectively. FIG. 5 is one example of describing at least a portion of a server system in accordance with an XML schema. However, it should be emphasized that many other hierarchical arrangements are possible and that the present invention is not limited to any particular description.



FIG. 6 illustrates an action association list 600 for assigning functions to processing steps in accordance with the present invention. Action association list 600 identifies a layer 1620 processing step, a layer 2640 processing step, and other layer processing steps. Layer 1620 processing step specifies whether a particular action should be executed before 620.1 layer 1 or after 620.2 layer 1. Prior to execution of layer 1, if xPathA 620.1.1 is present in the XML hierarchy 500 shown in FIG. 5, actionA is applied. Similarly, after execution of layer 1, if xPathB 620.2.1 is present in the XML hierarchy 500, actionB is applied, and if xPathC 620.2.2 is present in the XML hierarchy 500, actionC is applied. Depending on how actionB is defined, it is possible for xPathC to either be ignored or processed. Although no details are shown, before 640.1 and after 640.2 of layer 2640 operate in an analogous fashion.


The present invention also may be described in terms of methods comprising functional steps and/or non-functional acts. The following is a description of acts and steps that may be performed in practicing the present invention. Usually, functional steps describe the invention in terms of results that are accomplished, whereas non-functional acts describe more specific actions for achieving a particular result. Although the functional steps and non-functional acts may be described or claimed in a particular order, the present invention is not necessarily limited to any particular ordering or combination of the acts and/or steps.



FIGS. 7A and 7B are a flow diagram that describe various acts and steps for methods according to the present invention. A step for identifying (710) one or more functional processing blocks where one or more operations or actions may be applied to one or more requests directed to one or more services may include acts of: defining (712) one or more processing steps within a server system that provides one or more services; defining (714) one or more functions that may be executed at any of the one or more processing steps; and describing (716) at least a portion of the server system in accordance with an XML schema. An act of defining (714) one or more functions should be interpreted broadly to include selecting a predefined function or creating a new function.


It should be noted that the terms such as “service,” “processing step,” “functional processing block,” “operation,” “function,” and “action” should be interpreted broadly to encompass a wide variety of computer processing. Often, the term “service” is used as a generic reference for some type of computer resource. For example, an embodiment of the present invention is described in the context of an overall service that provides access to identity-based data, with one or more individual services within the overall service being dedicated to particular types of data, such as email, contacts, calendar, tasks, documents, etc. As used in this application, therefore, “service” is not necessarily limited to any particular type of computing resource, and any service specifically identified should be interpreted merely as an example.


Similarly, the terms “processing step,” “functional processing block,” “operation,” “function,” and “action” are often used as generic references for some division or grouping of one or more computer instructions that accomplish a particular task. With reference to the service that provides access to identity-based data, “processing steps” and “functional blocks” generally are associated with the parsing, security, cryptography, and service operations, whereas “operations,” “functions,” and “actions” generally are associated with logging and filtering. Nevertheless, each of the foregoing terms is used throughout the application in a generic sense. The general associations identified above, therefore, should not necessarily be interpreted as limiting any of these terms to the specific examples used merely in describing an embodiment of the present invention. As such, “processing step,” “functional processing block,” “operation,” “function,” and “action” should not be limited to any particular division or grouping of computer instructions, and any more specific description should be understood simply to represent an example.


A step for dynamically associating (720) at least one operation or action for at least one of the one or more functional processing blocks may include acts of: assigning (722) at least one function to at least one of one or more processing steps; and an act of evaluating (724) whether the at least one dynamically assigned function should be executed either before or after the at least one of the one or more processing steps. A step for checking (730) whether or not any action has been associated with a particular functional processing block during execution of the particular functional processing block may include acts of: receiving (732) a request for one or more services from a client system; and evaluating (734) whether or not any function has been assigned to a processing step.


A step for applying (740) one or more associated operations or actions during execution of any function processing block with one or more associated actions may include acts of: executing (742) at least one assigned function at each processing step that has at least one assigned function; and terminating (744) any further processing on a request received from a client system. A step for responding (750) to a client system based on a request for one or more services from a client system may include acts of: generating (752) a response; and sending (754) the response to the client system.


Having now described the principles of the present invention in detail, it is noted that the precise hardware configuration that implements the above-described features is not important to the present invention. For example, it is not important to the principles of the present invention where the various components of FIG. 1 are implemented.


Nevertheless, for the sake of completeness, FIG. 8 and the following discussion are intended to provide a brief, general description of a suitable computing environment in which the invention may be implemented. Although not required, the invention will be described in the general context of computer-executable instructions, such as program modules, being executed by computers in network environments. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Computer-executable instructions, associated data structures, and program modules represent examples of the program code means for executing steps of the methods disclosed herein. The particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps.


Those skilled in the art will appreciate that the invention may be practiced in network computing environments with many types of computer system configurations, including personal computers, hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. The invention may also be practiced in distributed computing environments where tasks are performed by local and remote processing devices that are (either by hardwired links, wireless links, or by a combination of hardwired or wireless links) through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.


With reference to FIG. 8, an exemplary system for implementing the invention includes a general purpose computing device in the form of a conventional computer 820, including a processing unit 821, a system memory 822, and a system bus 823 that couples various system components including the system memory 822 to the processing unit 821. The system bus 823 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. The system memory includes read only memory (ROM) 824 and random access memory (RAM) 825. A basic input/output system (BIOS) 826, containing the basic routines that help transfer information between elements within the computer 820, such as during start-up, may be stored in ROM 824.


The computer 820 may also include a magnetic hard disk drive 827 for reading from and writing to a magnetic hard disk 839, a magnetic disk drive 828 for reading from or writing to a removable magnetic disk 829, and an optical disc drive 830 for reading from or writing to removable optical disc 831 such as a CD-ROM or other optical media. The magnetic hard disk drive 827, magnetic disk drive 828, and optical disc drive 830 are connected to the system bus 823 by a hard disk drive interface 832, a magnetic disk drive-interface 833, and an optical drive interface 834, respectively. The drives and their associated computer-readable media provide nonvolatile storage of computer-executable instructions, data structures, program modules and other data for the computer 820. Although the exemplary environment described herein employs a magnetic hard disk 839, a removable magnetic disk 829 and a removable optical disc 831, other types of computer readable media for storing data can be used, including magnetic cassettes, flash memory cards, digital versatile discs, Bernoulli cartridges, RAMs, ROMs, and the like.


Program code means comprising one or more program modules may be stored on the hard disk 839, magnetic disk 829, optical disc 831, ROM 824 or RAM 825, including an operating system 835, one or more application programs 836, other program modules 837, and program data 838. A user may enter commands and information into the computer 820 through keyboard 840, pointing device 842, or other input devices (not shown), such as a microphone, joy stick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 821 through a serial port interface 846 coupled to system bus 823. Alternatively, the input devices may be connected by other interfaces, such as a parallel port, a game port or a universal serial bus (USB). A monitor 847 or another display device is also connected to system bus 823 via an interface, such as video adapter 848. In addition to the monitor, personal computers typically include other peripheral output devices (not shown), such as speakers and printers.


The computer 820 may operate in a networked environment using logical connections to one or more remote computers, such as remote computers 849a and 849b. Remote computers 849a and 849b may each be another personal computer, a server, a router, a network PC, a peer device or other common network node, and typically include many or all of the elements described above relative to the computer 820, although only memory storage devices 850a and 850b and their associated application programs 836a and 836b have been illustrated in FIG. 1. The logical connections depicted in FIG. 1 include a local area network (LAN) 851 and a wide area network (WAN) 852 that are presented here by way of example and not limitation. Such networking environments are commonplace in office-wide or enterprise-wide computer networks, intranets and the Internet.


When used in a LAN networking environment, the computer 820 is connected to the local network 851 through a network interface or adapter 853. When used in a WAN networking environment, the computer 820 may include a modem 854, a wireless link, or other means for establishing communications over the wide area network 852, such as the Internet. The modem 854, which may be internal or external, is connected to the system bus 823 via the serial port interface 846. In a networked environment, program modules depicted relative to the computer 820, or portions thereof, may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing communications over wide area network 852 may be used.


The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.

Claims
  • 1. A method performed on a computing device that includes at least one processor and memory, the method comprising: processing an incoming request via each of at least one of a plurality of processing layers that are implemented at least in part by the computing device, where each of the plurality of processing layers comprises a first processing portion that is configured for performing a first processing step and a second processing portion that is configured for performing a second processing step, and where the incoming request is processed according to the first processing step of the first processing portion of the each of the at least one of the processing layers;assigning to each of at least one of the first processing portions or the second processing portions a pre-processing function that is configured for being executed prior to the corresponding first or second processing steps of the each of the at least one of the first processing portions or the second processing portions, where each of the pre-processing functions is configured for transitioning from the processing at one of the first processing portions to the generating at a corresponding second processing portion; andgenerating an outgoing reply via the each of the at least one of the plurality of processing layers, where each outgoing reply is generated according to a second processing step of the second processing portion of the each of the at least one of the processing layers.
  • 2. The method of claim 1 where the first processing portions are configured for the processing to proceed from a first of the first processing portions to a next of the first processing portions and so forth until the processing has proceeded through the plurality of the first processing portions.
  • 3. The method of claim 1 where the second processing portions are configured for the generating to proceed from a first of the second processing portions to a next of the second processing portions and so forth until the generating has proceeded through the plurality of the second processing portions.
  • 4. The method of claim 1 further comprising assigning to each of at least one of the first processing portions or the second processing portions a post-processing function that is configured for being executed after the corresponding first or second processing steps of the each of the at least one of the first processing portions or the second processing portions.
  • 5. The method of claim 4 where each of the post-processing functions is configured for transitioning from the processing at one of the first processing portions to the generating at a corresponding second processing portion.
  • 6. A system comprising: a computing device that comprises at least one processor and memory;the at least one processor configured to process an incoming request via each of at least one of a plurality of processing layers that are implemented at least in part by the computing device, where each of the plurality of processing layers comprises a first processing portion that is configured for performing a first processing step and a second processing portion that is configured for performing a second processing step, and where the incoming request is processed according to the first processing step of the first processing portion of the each of the at least one of the processing layers;the at least one processor further configured to assign to each of at least one of the first processing portions or the second processing portions a pre-processing function that is configured for being executed prior to the corresponding first or second processing steps of the each of the at least one of the first processing portions or the second processing portions, where each of the pre-processing functions is configured for transitioning from the processing at one of the first processing portions to the generating at a corresponding second processing portion; andthe at least one processor further configured to generate an outgoing reply via the each of the at least one of the plurality of processing layers, where each outgoing reply is generated according to the second processing step of the second processing portion of the each of the at least one of the processing layers.
  • 7. The system of claim 6 where the first processing portions are configured for the processing to proceed from a first of the first processing portions to a next of the first processing portions and so forth until the processing has proceeded through the plurality of the first processing portions.
  • 8. The system of claim 6 where the second processing portions are configured for the generating to proceed from a first of the second processing portions to a next of the second processing portions and so forth until the generating has proceeded through the plurality of the second processing portions.
  • 9. The system of claim 6, the at least one processor further configured to assign to each of at least one of the first processing portions or the second processing portions a post-processing function that is configured for being executed after the corresponding first or second processing steps of the each of the at least one of the first processing portions or the second processing portions.
  • 10. The system of claim 9 where each of the post-processing functions is configured for transitioning from the processing at one of the first processing portions to the generating at a corresponding second processing portion.
  • 11. At least one memory device storing computer-executable instructions that, based on execution by a computing device that includes at least one processor and memory, configure the computing device to perform actions comprising: processing an incoming request via each of at least one of a plurality of processing layers that are implemented at least in part by the computing device, where each of the plurality of processing layers comprises a first processing portion that is configured for performing a first processing step and a second processing portion that is configured for performing a second processing step, and where the incoming request is processed according to the first processing step of the first processing portion of the each of the at least one of the processing layers;assigning to each of at least one of the first processing portions or the second processing portions a pre-processing function that is configured for being executed prior to the corresponding first or second processing steps of the each of the at least one of the first processing portions or the second processing portions, where each of the pre-processing functions is configured for transitioning from the processing at one of the first processing portions to the generating at a corresponding second processing portion; andgenerating an outgoing reply via the each of the at least one of the plurality of processing layers, where each outgoing reply is generated according to a second processing step of the second processing portion of the each of the at least one of the processing layers.
  • 12. The at least one memory device of claim 11 where the first processing portions are configured for the processing to proceed from a first of the first processing portions to a next of the first processing portions and so forth until the processing has proceeded through the plurality of the first processing portions.
  • 13. The at least one memory device of claim 11 where the second processing portions are configured for the generating to proceed from a first of the second processing portions to a next of the second processing portions and so forth until the generating has proceeded through the plurality of the second processing portions.
  • 14. The at least one memory device of claim 11 further comprising assigning to each of at least one of the first processing portions and the second processing portions a post-processing function that is configured for being executed after the corresponding first or second processing steps of the each of the at least one of the first processing portions or the second processing portions.
  • 15. The at least one memory device of claim 14 where each of the post-processing functions is configured for transitioning from the processing at one of the first processing portions to the generating at a corresponding second processing portion.
RELATED APPLICATIONS

This Application is a Continuation of and claims benefit from U.S. patent application Ser. No. 11/347,448 (U.S. Pat. No. 8,572,576) that was filed Feb. 3, 2006 (issued Oct. 29, 2013), and that is a Continuation of and claims benefit from U.S. Pat. No. 7,024,662 that was issued on Apr. 4, 2006, and that claims priority from U.S. Provisional Application No. 60/275,809 that was filed on Mar. 14, 2001, each of which is incorporated herein by reference in its entirety.

US Referenced Citations (473)
Number Name Date Kind
5031089 Liu Jul 1991 A
5218680 Farrell Jun 1993 A
5440744 Jacobson Aug 1995 A
5446880 Balgeman Aug 1995 A
5485409 Gupta Jan 1996 A
5487141 Cain Jan 1996 A
5493692 Theimer Feb 1996 A
5544285 Glaser Aug 1996 A
5544302 Nguyen Aug 1996 A
5634053 Noble May 1997 A
5634129 Dickinson May 1997 A
5640504 Johnson, Jr. Jun 1997 A
5640569 Miller Jun 1997 A
5666534 Gilbert Sep 1997 A
5684950 Dare Nov 1997 A
5687376 Celi Nov 1997 A
5691917 Harrison Nov 1997 A
5729682 Marquis Mar 1998 A
5742905 Pepe Apr 1998 A
5748890 Goldberg May 1998 A
5754111 Garcia May 1998 A
5754175 Koppolu May 1998 A
5778227 Jordan Jul 1998 A
5787283 Chin Jul 1998 A
5787412 Bosch Jul 1998 A
5787427 Benantar et al. Jul 1998 A
5790785 Klug Aug 1998 A
5809509 Blackman Sep 1998 A
5819092 Ferguson Oct 1998 A
5826252 Wolters Oct 1998 A
5835722 Bradshaw Nov 1998 A
5862325 Reed Jan 1999 A
5864848 Horvitz Jan 1999 A
5867712 Shaw Feb 1999 A
5867799 Lang Feb 1999 A
5870739 Davis Feb 1999 A
5870759 Bauer Feb 1999 A
5872926 Levac et al. Feb 1999 A
5898870 Okuda Apr 1999 A
5911139 Jain Jun 1999 A
5911143 Deinhart et al. Jun 1999 A
5926810 Noble Jul 1999 A
5930801 Falkenhainer Jul 1999 A
5933820 Beier et al. Aug 1999 A
5937189 Branson Aug 1999 A
5944823 Jade Aug 1999 A
5956715 Glasser et al. Sep 1999 A
5956730 Burroughs Sep 1999 A
5963976 Ogawa et al. Oct 1999 A
5974416 Anand Oct 1999 A
5974417 Bracho Oct 1999 A
5983234 Tietjen Nov 1999 A
5983273 White Nov 1999 A
5987454 Hobbs Nov 1999 A
5990883 Byrne Nov 1999 A
5999932 Paul Dec 1999 A
6003079 Friedrich Dec 1999 A
6011537 Slotznick Jan 2000 A
6016394 Walker Jan 2000 A
6018343 Wang Jan 2000 A
6021403 Horvitz Feb 2000 A
6023223 Baxter Feb 2000 A
6023765 Kuhn Feb 2000 A
6044224 Radia et al. Mar 2000 A
6044372 Rothfus Mar 2000 A
6047307 Radko Apr 2000 A
6047327 Tso Apr 2000 A
6049821 Theriault Apr 2000 A
6052720 Traversat Apr 2000 A
6065012 Balsara May 2000 A
6078955 Konno Jun 2000 A
6081840 Zhao Jun 2000 A
6088451 He Jul 2000 A
6088675 MacKenty et al. Jul 2000 A
6088717 Reed Jul 2000 A
6092101 Birrell et al. Jul 2000 A
6101480 Conmy Aug 2000 A
6106573 Mahalingaiah Aug 2000 A
6119122 Bunnell Sep 2000 A
6122348 French Sep 2000 A
6122629 Walker Sep 2000 A
6134592 Montulli Oct 2000 A
6141778 Kane Oct 2000 A
6144996 Starnes Nov 2000 A
6148290 Dan Nov 2000 A
6148301 Rosenthal Nov 2000 A
6148302 Beylin et al. Nov 2000 A
6148336 Thomas et al. Nov 2000 A
6151624 Teare Nov 2000 A
6154876 Haley et al. Nov 2000 A
6161125 Traversat Dec 2000 A
6161139 Win Dec 2000 A
6163794 Lange Dec 2000 A
6167402 Yeager Dec 2000 A
6167408 Cannon Dec 2000 A
6185551 Birrell Feb 2001 B1
6189032 Susaki et al. Feb 2001 B1
6192380 Light Feb 2001 B1
6192408 Vahalia et al. Feb 2001 B1
6195662 Ellis et al. Feb 2001 B1
6199081 Meyerzon et al. Mar 2001 B1
6202066 Barkley et al. Mar 2001 B1
6223207 Lucovsky et al. Apr 2001 B1
6226642 Beranek May 2001 B1
6226792 Goiffon May 2001 B1
6243830 Nakatsugawa Jun 2001 B1
6247026 Waldo Jun 2001 B1
6253204 Glass Jun 2001 B1
6263498 Alcorn Jul 2001 B1
6266690 Shankarappa Jul 2001 B1
6269369 Robertson Jul 2001 B1
6272506 Bell Aug 2001 B1
6275824 O'Flaherty Aug 2001 B1
6279111 Jensenworth Aug 2001 B1
6282548 Burner et al. Aug 2001 B1
6282698 Baker Aug 2001 B1
6282709 Reha Aug 2001 B1
6308216 Goldszmidt Oct 2001 B1
6308273 Goertzel Oct 2001 B1
6314093 Mann Nov 2001 B1
6314447 Lea Nov 2001 B1
6314555 Ndumu Nov 2001 B1
6317783 Freishtat Nov 2001 B1
6317868 Grimm Nov 2001 B1
6324544 Alam Nov 2001 B1
6327574 Kramer Dec 2001 B1
6330610 Docter Dec 2001 B1
6334151 Bolam Dec 2001 B1
6336118 Hammond Jan 2002 B1
6336119 Banavar Jan 2002 B1
6336147 Brownell et al. Jan 2002 B1
6343287 Kumar Jan 2002 B1
6343324 Hubis et al. Jan 2002 B1
6349302 Aoyama et al. Feb 2002 B1
6349307 Chen Feb 2002 B1
6351744 Landresse Feb 2002 B1
6351843 Berkley et al. Feb 2002 B1
6356940 Short Mar 2002 B1
6370537 Gilbert et al. Apr 2002 B1
6377952 Inohara et al. Apr 2002 B1
6381465 Chern Apr 2002 B1
6389472 Hughes et al. May 2002 B1
6397246 Wolfe May 2002 B1
6401085 Gershman Jun 2002 B1
6405191 Bhatt Jun 2002 B1
6405364 Bowman-Amuah Jun 2002 B1
6414635 Stewart Jul 2002 B1
6415322 Jaye Jul 2002 B1
6442549 Schneider Aug 2002 B1
6453317 LaCost Sep 2002 B1
6457066 Mein Sep 2002 B1
6459913 Cloutier Oct 2002 B2
6466232 Newell Oct 2002 B1
6470450 Langford Oct 2002 B1
6480830 Ford Nov 2002 B1
6480850 Veldhuisen Nov 2002 B1
6480860 Monday Nov 2002 B1
6480885 Olivier Nov 2002 B1
6487584 Bunney Nov 2002 B1
6490721 Gorshkov et al. Dec 2002 B1
6505167 Horvitz Jan 2003 B1
6510439 Rangarajan Jan 2003 B1
6516315 Gupta Feb 2003 B1
6516341 Shaw Feb 2003 B2
6519571 Guheen et al. Feb 2003 B1
6526438 Bienvenu Feb 2003 B1
6539481 Takahashi Mar 2003 B1
6542515 Kumar Apr 2003 B1
6542845 Grucci et al. Apr 2003 B1
6542912 Meltzer Apr 2003 B2
6542923 Nguyen Apr 2003 B2
6543317 Rinner Apr 2003 B1
6553427 Chang et al. Apr 2003 B1
6556995 Child Apr 2003 B1
6566995 Furuuchi May 2003 B2
6571279 Herz May 2003 B1
6574631 Subramania Jun 2003 B1
6574655 Libert Jun 2003 B1
6581095 Kim Jun 2003 B1
6584564 Olkin Jun 2003 B2
6591260 Schwarzhoff Jul 2003 B1
6594666 Biswas Jul 2003 B1
6594672 Lampson Jul 2003 B1
6601016 Brown Jul 2003 B1
6601075 Huang Jul 2003 B1
6601233 Underwood Jul 2003 B1
6604099 Chung Aug 2003 B1
6604143 Nagar Aug 2003 B1
6604209 Grucci et al. Aug 2003 B1
6609148 Salo Aug 2003 B1
6618716 Horvitz Sep 2003 B1
6622160 Horvitz Sep 2003 B1
6633898 Seguchi Oct 2003 B1
6643650 Slaughter Nov 2003 B1
6643652 Helgeson Nov 2003 B2
6651217 Kennedy Nov 2003 B1
6654747 Van Huben et al. Nov 2003 B1
6662340 Rawat Dec 2003 B2
6662357 Bowman-Amuah Dec 2003 B1
6665756 Abramson Dec 2003 B2
6678682 Jenkins et al. Jan 2004 B1
6678715 Ando Jan 2004 B1
6684204 Lal Jan 2004 B1
6686838 Rezvani Feb 2004 B1
6694429 Kalmanek Feb 2004 B1
6697809 Chen Feb 2004 B2
6697865 Howard Feb 2004 B1
6704024 Robotham Mar 2004 B2
6708137 Carley Mar 2004 B2
6711585 Copperman Mar 2004 B1
6711612 Blumenau et al. Mar 2004 B1
6714967 Horvitz Mar 2004 B1
6718535 Underwood Apr 2004 B1
6721941 Morshed Apr 2004 B1
6731940 Nagendran May 2004 B1
6732080 Blants May 2004 B1
6738767 Chung May 2004 B1
6741980 Langseth May 2004 B1
6745011 Hendrickson Jun 2004 B1
6748417 Helland Jun 2004 B1
6754470 Hendrickson Jun 2004 B2
6757720 Weschler Jun 2004 B1
6757898 Ilsen Jun 2004 B1
6766362 Miyasaka Jul 2004 B1
6772216 Ankireddipally Aug 2004 B1
6789077 Slaughter Sep 2004 B1
6789126 Saulpaugh Sep 2004 B1
6792446 Merchant Sep 2004 B2
6792466 Saulpaugh Sep 2004 B1
6792605 Roberts Sep 2004 B1
6807558 Hassett Oct 2004 B1
6816878 Zimmers Nov 2004 B1
6816886 Elvanoglu Nov 2004 B2
6820082 Cook Nov 2004 B1
6820204 Desai Nov 2004 B1
6823369 Leach Nov 2004 B2
6823458 Lee et al. Nov 2004 B1
6823495 Vedula Nov 2004 B1
6829593 Ritter Dec 2004 B1
6832237 Christensen et al. Dec 2004 B1
6839733 Lange Jan 2005 B1
6850975 Danneels Feb 2005 B1
6850979 Saulpaugh Feb 2005 B1
6857013 Ramberg Feb 2005 B2
6862594 Saulpaugh Mar 2005 B1
6868447 Slaughter Mar 2005 B1
6882706 Andrew Apr 2005 B2
6892201 Brown May 2005 B2
6898618 Siaughter May 2005 B1
6907457 Merrell et al. Jun 2005 B2
6907465 Tsai Jun 2005 B1
6911143 Janik Jun 2005 B2
6912600 Van Brero Jun 2005 B2
6917373 Vong et al. Jul 2005 B2
6917937 Rubendall Jul 2005 B1
6917976 Slaughter Jul 2005 B1
6918084 Slaughter Jul 2005 B1
6925307 Mamdani Aug 2005 B1
6925481 Singhal Aug 2005 B2
6931434 Donoho Aug 2005 B1
6934740 Lawande Aug 2005 B1
6957199 Fisher Oct 2005 B1
6958984 Kotzin Oct 2005 B2
6976078 Icken Dec 2005 B1
6980993 Horvitz Dec 2005 B2
6981247 Weinberg Dec 2005 B2
6985958 Lucovsky Jan 2006 B2
6986145 Gangopadhyay Jan 2006 B2
6990513 Belfiore Jan 2006 B2
6993502 Gryglewicz Jan 2006 B1
7002942 Kotzin Feb 2006 B2
7017016 Chujo et al. Mar 2006 B2
7024662 Elvanoglu Apr 2006 B2
7024692 Schanze Apr 2006 B1
7027051 Alford Apr 2006 B2
7028312 Merrick Apr 2006 B1
7031945 Donner Apr 2006 B1
7062539 Leach Jun 2006 B2
7062642 Langrind Jun 2006 B1
7069446 Wiederin Jun 2006 B2
7072843 Menninger Jul 2006 B2
7072967 Saulpaugh Jul 2006 B1
7113771 Kotzin Sep 2006 B2
7127328 Ransom Oct 2006 B2
7127514 Hunt Oct 2006 B2
7133869 Bryan Nov 2006 B2
7136859 Lucovsky Nov 2006 B2
7136908 Cline Nov 2006 B2
7143118 Eichstaedt Nov 2006 B2
7149806 Perkins Dec 2006 B2
7170857 Stephens Jan 2007 B2
7191236 Simpson-Young Mar 2007 B2
7203906 Abbott Apr 2007 B2
7206788 Horvitz Apr 2007 B2
7210147 Hipp Apr 2007 B1
7216287 Colson May 2007 B2
7222306 Kaasila May 2007 B2
7246122 Lucovsky Jul 2007 B2
7249159 Horvitz Jul 2007 B1
7250846 Ebling Jul 2007 B2
7260601 Day Aug 2007 B1
7284197 Lucovsky Oct 2007 B2
7284271 Lucovsky Oct 2007 B2
7302402 Callaghan Nov 2007 B2
7302634 Lucovsky Nov 2007 B2
7472349 Srivastava Dec 2008 B1
7487233 Iwamoto Feb 2009 B2
7539747 Lucovsky May 2009 B2
7548932 Horvitz Jun 2009 B2
7613702 Horvitz Nov 2009 B2
7613721 Horvitz Nov 2009 B2
7613722 Horvitz Nov 2009 B2
7664724 Lucovsky Feb 2010 B2
7721110 Kouznetsov May 2010 B2
7921155 Harrow Apr 2011 B2
8572576 Elvanoglu Oct 2013 B2
8862736 Tagg Oct 2014 B2
20010000958 Ulrich May 2001 A1
20010023421 Numao Sep 2001 A1
20010029470 Schultz Oct 2001 A1
20010044275 Yamaguchi Nov 2001 A1
20010044827 Zhuk Nov 2001 A1
20010047385 Tuatini Nov 2001 A1
20020010781 Tuatini Jan 2002 A1
20020012327 Okada Jan 2002 A1
20020013711 Ahuja Jan 2002 A1
20020013788 Pennell Jan 2002 A1
20020015042 Robotham Feb 2002 A1
20020016173 Hunzinger Feb 2002 A1
20020019828 Mortl Feb 2002 A1
20020026426 Bennett Feb 2002 A1
20020029256 Zintel et al. Mar 2002 A1
20020035533 Mache et al. Mar 2002 A1
20020038455 Srinivasan Mar 2002 A1
20020040369 Multer Apr 2002 A1
20020042846 Bottan Apr 2002 A1
20020049749 Helgeson Apr 2002 A1
20020049902 Rhodes Apr 2002 A1
20020055951 Shigetomi et al. May 2002 A1
20020059342 Gupta May 2002 A1
20020063732 Mansikkaniemi May 2002 A1
20020065881 Mansikkaniemi May 2002 A1
20020065884 Donoho May 2002 A1
20020069298 Birkler Jun 2002 A1
20020078204 Newell Jun 2002 A1
20020078378 Burnett Jun 2002 A1
20020080156 Abbott Jun 2002 A1
20020083048 Tenorio Jun 2002 A1
20020083073 Vaidya Jun 2002 A1
20020083121 Chang Jun 2002 A1
20020083158 Abbott Jun 2002 A1
20020085579 Sullivan Jul 2002 A1
20020087397 Mazza Jul 2002 A1
20020090934 Mitchelmore Jul 2002 A1
20020095399 Devine Jul 2002 A1
20020099573 Koguchi Jul 2002 A1
20020099593 Kraft Jul 2002 A1
20020099817 Abbott Jul 2002 A1
20020103661 Albazz Aug 2002 A1
20020104017 Stefan Aug 2002 A1
20020107985 Hwang Aug 2002 A1
20020116232 Rapp Aug 2002 A1
20020116642 Joshi Aug 2002 A1
20020120685 Srivastava Aug 2002 A1
20020124182 Bacso Sep 2002 A1
20020129000 Pillai Sep 2002 A1
20020129016 Christfort Sep 2002 A1
20020129024 Lee Sep 2002 A1
20020129140 Peled et al. Sep 2002 A1
20020129213 Goudie Sep 2002 A1
20020131428 Pecus Sep 2002 A1
20020133477 Abel Sep 2002 A1
20020133506 Yamato Sep 2002 A1
20020133535 Lucovsky Sep 2002 A1
20020133627 Maes Sep 2002 A1
20020133752 Hand Sep 2002 A1
20020138566 Leach Sep 2002 A1
20020152053 Roy Oct 2002 A1
20020154161 Friedman Oct 2002 A1
20020157007 Sashihara Oct 2002 A1
20020161838 Pickover Oct 2002 A1
20020169876 Curie Nov 2002 A1
20020184092 Cherry Dec 2002 A1
20020184214 Lucovsky Dec 2002 A1
20020184344 Elvanoglu Dec 2002 A1
20020184521 Lucovsky Dec 2002 A1
20030004874 Ludwig Jan 2003 A1
20030014659 Zhu Jan 2003 A1
20030018771 Vinberg Jan 2003 A1
20030023263 Krolik Jan 2003 A1
20030023623 Horvitz Jan 2003 A1
20030041000 Zajac Feb 2003 A1
20030041065 Lucovsky Feb 2003 A1
20030041076 Lucovsky Feb 2003 A1
20030046238 Nonaka Mar 2003 A1
20030050911 Lucovsky Mar 2003 A1
20030061081 Kellond Mar 2003 A1
20030061211 Shultz Mar 2003 A1
20030061365 White Mar 2003 A1
20030069887 Lucovsky Apr 2003 A1
20030074247 Dick Apr 2003 A1
20030074423 Mayberry et al. Apr 2003 A1
20030097485 Horvitz May 2003 A1
20030101190 Horvitz May 2003 A1
20030115228 Horvitz Jun 2003 A1
20030120785 Young Jun 2003 A1
20030123465 Donahue Jul 2003 A1
20030131069 Lucovsky Jul 2003 A1
20030131073 Lucovsky Jul 2003 A1
20030131142 Horvitz Jul 2003 A1
20030133553 Khakoo Jul 2003 A1
20030135411 Ushiki Jul 2003 A1
20030135556 Holdsworth Jul 2003 A1
20030140112 Ramachandran Jul 2003 A1
20030149646 Chen Aug 2003 A1
20030149696 Nelson Aug 2003 A1
20030149781 Yared Aug 2003 A1
20030154476 Abbott Aug 2003 A1
20030165139 Chen Sep 2003 A1
20030169749 Huang et al. Sep 2003 A1
20030177135 Lechowicz Sep 2003 A1
20030177264 Elvanoglu Sep 2003 A1
20030220891 Fish Nov 2003 A1
20030229529 Mui Dec 2003 A1
20040002976 Lucovsky Jan 2004 A1
20040003112 Alles Jan 2004 A1
20040006564 Lucovsky Jan 2004 A1
20040006590 Lucovsky Jan 2004 A1
20040010451 Romano Jan 2004 A1
20040015725 Boneh Jan 2004 A1
20040024866 Sundar Feb 2004 A1
20040060002 Lucovsky Mar 2004 A1
20040064571 Nuutlila Apr 2004 A1
20040078273 Loeb Apr 2004 A1
20040098622 O'Neill May 2004 A1
20040133622 Clubb Jul 2004 A1
20040139145 Bar-or et al. Jul 2004 A1
20040156346 O'Neill Aug 2004 A1
20040166834 Omar Aug 2004 A1
20040193444 Hufford Sep 2004 A1
20040199663 Horvitz Oct 2004 A1
20040199664 Feldman Oct 2004 A1
20040199861 Lucovsky Oct 2004 A1
20040199869 Lucovsky Oct 2004 A1
20040205526 Borodovski Oct 2004 A1
20040205656 Reulein Oct 2004 A1
20040210839 Lucovsky Oct 2004 A1
20040226001 Teegan Nov 2004 A1
20040243520 Bishop Dec 2004 A1
20040267687 Aschen Dec 2004 A1
20040267763 Aschen Dec 2004 A1
20050013417 Zimmers Jan 2005 A1
20050027741 Eichstaedt Feb 2005 A1
20050065950 Chaganti Mar 2005 A1
20050080865 Leach Apr 2005 A1
20050097000 Freishtat May 2005 A1
20050100150 Dhara May 2005 A1
20050165773 Elvanoglu Jul 2005 A1
20050262434 Soderberg Nov 2005 A1
20050273692 Horvitz Dec 2005 A1
20050278344 Horvitz Dec 2005 A1
20050278366 Horvitz Dec 2005 A1
20050289447 Hadley Dec 2005 A1
20060003780 Mamdani Jan 2006 A1
20060010078 Rezvani Jan 2006 A1
20060036642 Horvitz Feb 2006 A1
20060107251 Boshier May 2006 A1
20060150140 Elvanoglu Jul 2006 A1
20060161554 Lucovsky Jul 2006 A1
20070026857 Kotzin Feb 2007 A1
20070083561 Lai Apr 2007 A1
20070150903 Hansen Jun 2007 A1
20070216687 Kaasila Sep 2007 A1
Foreign Referenced Citations (27)
Number Date Country
2 428 481 Dec 2003 CA
0 147 574 Jul 1985 EP
0 893 920 Jan 1999 EP
0 917119 May 1999 EP
0 952 513 Oct 1999 EP
0991005 Apr 2000 EP
1 021 021 Jul 2000 EP
1 376 977 Aug 2007 EP
1 379971 Feb 2012 EP
11-143827 May 1999 JP
2000-163345 Jun 2000 JP
2002-055896 Feb 2002 JP
WO 9741654 Nov 1997 WO
WO 9838585 Sep 1998 WO
WO 9917216 Apr 1999 WO
WO 9923591 May 1999 WO
WO 0051031 Aug 2000 WO
0184301 Nov 2001 WO
0186486 Nov 2001 WO
WO 02073339 Sep 2002 WO
WO 02073392 Sep 2002 WO
WO 02073442 Sep 2002 WO
WO 02073454 Sep 2002 WO
WO 02073466 Sep 2002 WO
WO 02073472 Sep 2002 WO
WO 02079921 Oct 2002 WO
WO 03096209 Nov 2003 WO
Non-Patent Literature Citations (165)
Entry
Geoff Haviland , “Designing High-Performance Campus Intranets with Multilayer Switching”, Cisco Systems, 1998 , <http://ai3.itb.ac.id/˜basuki/private/ITFORUM/BACKBONE/NETWOR˜1/HIGH-P˜1.PDF>, pp. 1-33.
Sathis Menon et al. , “Object Replacement using Dynamic Proxy Updates”, IEEE , 1994 , <http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=289933>, pp. 1-10.
Anindya Datta et al. , “Proxy-Based Acceleration of Dynamically Generated Content on the World Wide Web: An Approach and Implementation”, ACM , 2002 , <http://delivery.acm.org/10.1145/570000/564703/p97-datta.pdf>, pp. 1-12.
“Technology Primer: Secure Sockets Layer (SSL)”, Blue Coat, 2001, <http://bluecoat.com/documents/download/0485e335-7437-4c4e-bfc0-ca5ffc5bfd4d/16f27cf7-5d59-44b4-b17f-fb04acea369f>, pp. 1-22.
Giacomo Cabri et al. , “Supporting Cooperative WWW Browsing: a Proxy-based Approach”, IEEE, 1999, <http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=746657>, pp. 1-8.
Richard Han et al., “WebSplitter: A Unified XML Framework for Multi-Device Collaborative Web Browsing”, ACM, 2000, <http://delivery.acm.org/10.1145/360000/358993/p221-han.pdf>, pp. 1-10.
Ochi, “Network Applications for Mobile Computing”, Fujitsu Scientific & Technical Journal, vol. 34, No. 1, pp. 41-49, Sep. 1998.
Shyhtsun Felix Wu, “Sleepy Security Management with Proxy-Based Filtering (A Position Paper)”, North Carolina State University, 1996.
Karim R. Mazouni et al. , “Filtering Duplicated Invocations Using Symmetric Proxies”, IEEE, 1995, <http://ieeexplore. ieee.org/stamp/stamp.jsp?tp=&arnumber=4 70570> pp. 1-9.
Marcos Forte et al. “A content classification and filterina server for the Internet”, ACM, 2006, <http://delivery.acm.org/10.1145/1150000/1141553/p1166-forte.pdf> p. 1-6.
EP Communication for Application No. 02 709 743.5-1225, Reference EP 25450-034/zp, Jun. 13, 2007.
EP Communication for Application No. 02 709 743.5-1225, Reference EP 25450-034/zp, Apr. 21, 2009.
“Secure Soccket Layer (SSL)”, IBM, Jan. 31, 2001, <http://pic.dhe.ibm.com/infocenter/wasinfo/v7rO/index.jsp?topic=%2Fcom.ibm.websphere.edge.doc%2Fcp%2Fadmingd35.htm> pp. 1-6.
Chen Ding et al. , “Selective Java Applet Filtering on Internet”, IEEE, 1999, <http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=825217>, pp. 1-5.
Edith Cohen et al., “Improving End-to-End Performance of the Web Using Server Volumes and Proxy Filters”,ACM,1998,<http://delivery.acm.org/10.1145/290000/285286/p241-cohen.pdf.
Office Action mailed Nov. 16, 2007 cited in related case 101003,750.
Advisory Action mailed Jan. 31, 2008 cited in related case 101003,750.
Wang, “The SIMBA User Alert Service Architecture for Dependable Alert Delivery”, Proceedings of the International Conference on Dependable Systems and Networks, Mar. 26, 2001.
Miller, “News On-Demand for Multimedia Networks”, Proceedings of the Firt ACM International Conference on Multimedia, Aug. 1-6, 1993.
Faensen, “Hemnes—A Notification Service for Digital Libraries”, Proceedings of the ACM/IEEE Joint Conference on Digital Libraries, Jun. 24-28, 2001.
Huang, “Publication/Subscribe in a Mobile Evironment”, Proceedings of the Second ACM International Workshop on Data Engineerig for Wireless and Mobile Access, May 20, 2001.
EP Summons to attend oral proceedings for Application No. 03009717.4-1244, Reference EP27314-034/df, Oct. 18, 2006.
JP Notice of Rejection for Application No. 2003-164094, May 23, 2008.
JP Notice of Rejection for Application No. 2003-164094, Mar. 17, 2009.
JP Notice of Rejection for Application No. 2003-164094, Sep. 18, 2009.
CA Examiner's Report for Application No. 2,428,481, Apr. 2, 2009.
AU Examiner's first report on patent application No. 2003204123, Reference 12215600/DBW, Oct. 27, 2008.
CN Notice on Office Action for Application No. 03145733.9, Dec. 30, 2005.
CN The Second Office Action for Application No. 03145733.9, Nov. 2, 2007.
CN The Third Office Action for Application No. 03145733.9, Aug. 22, 2008.
KR Notice of Preliminary Rejection for Application No. 10-2003-42575, May 29, 2009.
RU Official Action for Application No. 2003119524/09(020846), Reference 2412-127800RU/3172, Aug. 15, 2007.
NO Official Action for Applicaiton No. 20032997, Dec. 23, 2008.
NO Official Action for Application No. 20032997, Sep. 28, 2009.
MY Examiner's Report for Application No. PI 20031685, Jul. 20, 2007.
ID Official Action for Application No. P-002003 00319, Mar. 3, 2006.
TR Examination Report for Application No. 2003/00769, Jun. 13, 2007.
TR Examination Report for Application No. 2003/00769, Oct. 15, 2008.
HU Novelty Search Report for Application No. P0301952, Mar. 30, 2005.
PL Notice for Application No. 360329/DP, Reference Z-2375s/03, Aug. 31, 2009.
PL Notice for Application No. 360329/DP, Reference Z-2375S/03, Feb. 23, 2010.
EP Communication for Application No. 02 707 934.2-1244, Reference EP26451-034/gr, Jan. 23, 2007.
EP Communication for Application No. 02 709 753.4-1244, Reference EP26449-034/gr, May 9, 2008.
EP Communication for Application No. 02 719 261.6-1244, Reference EP28364-034/df, May 2, 2008.
EP Communication for Application No. 02 721 433.7-1244, Reference EP28368-034/df, Aug. 23, 2011.
EP Communication for Application No. 02 721 433.7-1244, Reference EP28368-034/df, Oct. 16, 2009.
EP Communication for Application No. 02 725 195.8-1244, Reference EP28367-034/df, Oct. 30, 2009.
Hu Advisory Action for Application No. P0301952 Reference 98855-15819 AF/CJ, Apr. 7, 2011.
ID Notice of the Result of Substantive Examination for Application No. P-00 2003 00319, Refernce 167497 17, May 5, 2011.
PL Notice for Application No. P. 360329/DP, Reference Z-2376s/03, May 25, 2010.
TR Examination Report for Application No. 03/769, Jan. 18, 2010.
PCT International Search Report for Application No. PCT/US02/06243, May 7, 2002.
PCT International Search Report for Application No. PCT/US02/06244, Oct. 2, 2002.
PCT International Search Report for Application No. PCT/US02/06245, May 30, 2002.
PCT International Search Report for Application No. PCT/US02/06329, Sep. 11, 2002.
PCT International Search Report for Application No. PCT/US02/07953, Jun. 10, 2002.
PCT International Search Report for Application No. PCT/US02/08061, Apr. 22, 2002.
PCT International Search Report for Application No. PCT/US02/08063, May 30, 2002.
EP Communication for Application No. 02 707 934.2-2212, Reference EP26451-034/gr, Jun. 7, 2006.
EP Communication for Application No. 02 709 743.5-2201, Reference EP25450-034/zp, Sep. 5, 2006.
EP Communication for Application No. 02 709 753.4-1244, Reference EP25449-034/gr, Feb. 13, 2007.
EP Communication for Application No. 02 719 261.6-1244, Reference EP28364-034/df, Feb. 5, 2007.
EP Communication for Application No. 02 721 433.7-1244, Reference EP28368-034/df, Aug. 13, 2009.
EP Communication for Application No. 02 725 195.8-1244, Reference EP28367-034/df, Aug. 4, 2009.
EP Communication for Application No. 02 728 381.1-1244, Reference EP25448-034/zp, Feb. 5, 2007.
EP Communication for Application No. 03 009 717.4-1244, Reference EP27314-034/df, Dec. 2, 2003.
RU Search Report for Application No. 2003/00769, Request No. TR 04/508, Mar. 14, 2005.
DK Search Report for Application No. SG 200302729-9, Reference MH/BS/60021148GC, Mar. 15, 2004.
NZ Examination Report for Application No. 525634, Reference P483666 MD/Vakh, May 12, 2003.
“Getting Results with Microsoft Office 97”, Microsoft Corporation, 1997.
“XML Path Language (XPath)”, Nov. 16, 1999.
Ayers, “XML for Recourse Scheduling / Calendar Management”, Nov. 8, 1998.
Bergman, “XML Technology Enables Redesigned Deep Space Network Operations”, IEEE Mar. 2000.
Box, “Simple Object Access Protocol (SOAP) 1.1”, W3C Note, May 8, 2000.
Carroll, “XML for Resource Scheduling / Calendar Management”, Nov. 6, 1998.
Chu, “Web-Based Single Sign-On Solutions: An SSO Product Matrix”, Computer Security Journal, Nov. 1, 2000.
Cook, “The Win2000 Active Directory”, Jun. 2000.
“Corba Components—vol. 1”, Object Management Group, Jul. 1, 1999.
Eustice, “A Universal Information Appliance”, IBM Systems Journal, Mar. 26, 1999.
Farjami, “Adance Service Provisioning Based on Mobile Agents”, Computer Communications, Apr. 2000.
Ferreira, “Using LDAP in a filtering Service for Digital Library”, Nov. 10-12, 1997.
Gates, “Hallstrom Announcement”, Bill Gates Speech, Mar. 19, 2001.
Imamura, “Metadata Representative in XML for Internet-Based Electronic XML Application from Business to Gorvernment”, IEEE, Jul. 4-7, 2000.
Jungyu, “Object-Oriented Representation for XML Data”, IEEE, Apr. 24, 2001.
Koppen, “Active Hypertext for Distributed Web Applications”, IEEE, Jun. 16-18, 1999.
Kormann, “Risks of the Passport Single Signon Protocol”, Computer Networks , Jun. 2000.
Lowry, “XML Data Mediation and Collaboration: A Proposed Comprehensive Architecture and Query Requirements for Using XML to Mediate Heterogeneous Data Sources and Targets”, System Sciences, Jan. 3-6, 2001.
Magedanz, “Tina—Architectural Basis for Future Telecommunications Services”, Computer Communications, Jun. 28, 1996.
Morrison, “XML Unleashed”, Sam's Publishing, Dec. 21, 1999.
Padwick, “Using Microsoft Outlook 2000, Special Edition”, Que Corporation, May 12, 1999.
Phelps, “Multivalent Documents: A New Model for Digital Documents”, Division of Computer Sciences, LLC Berkeley, Mar. 13, 1996.
Reinwald, “Heterogeneous Query Processing Through SQL Table Functions”, ICDE, Mar. 23-26, 1999.
Roussev, “Intefrating XML and Object-Based Programming for Distributed Collaboration”, IEEE, Jun. 14-16, 2000.
Spencer, “Installing and Configuring Active Directory”, Prentice Hall PTR, May 25, 2000.
Stamoulis, “Efficient Agent-Based Negotiation for Telecommunications Services”, Institute of Computer Science (ICS) Foundation for Research and Technology, Dec. 5-9, 1999.
“Microsoft Outlook 2000, Step by Step”, Catapult Inc., May 7, 1999.
Office Action mailed Dec. 18, 2007 cited in related case U.S. Appl. No. 11/086,590.
Notice of Allowance mailed Jul. 9 2007 in related case U.S. Appl. No. 10/187,210.
Office Action mailed Jul. 8, 2004 cited in related case U.S. Appl. No. 10/003,753.
Office Action mailed Sep. 23, 2005 cited in related case U.S. Appl. No. 10/003,753.
Office Action mailed Jan. 12, 2006 cited in related case U.S. Appl. No. 10/003,753.
Notice of Allowance mailed lune 30, 2006 cited in related case U.S. Appl. No. 10/003,753.
Office Action mailed Jan. 31, 2005 in related case U.S. Appl. No. 10/003,754.
Notice of Allowance mailed Jul. 12, 2005 cited in related case U.S. Appl. No. 10/003,754.
Office Action mailed Sep. 26, 2005 cited in related case U.S. Appl. No. 10/003,767.
Office Action mailed Jan. 25, 2006 cited in related case U.S. Appl. No. 10/003,767.
Office Action mailed May 24, 2006 cited in related case U.S. Appl. No. 10/003,767.
Office Action mailed Sep. 26, 2006 cited in related case U.S. Appl. No. 10/003,767.
Notice of Allowance mailed Jun. 14, 2007 cited in related case U.S. Appl. No. 10/003,767.
Office Action mailed Mar. 25, 2005 cited in related case U.S. Appl. No. 10/062,045.
Office Action mailed Sep. 2, 2005 cited in related case U.S. Appl. No. 10/062,045.
Notice of Allowance mailed Dec. 16, 2005 cited in related case U.S. Appl. No. 10/062,045.
Office Action mailed May 21, 2004 cited in related case U.S. Appl. No. 10/099,577.
Notice of Allowance mailed Aug. 6, 2004 cited in related case U.S. Appl. No. 10/099,577.
Office Action mailed Nov. 3, 2004 cited in related case U.S. Appl. No. 10/187,190.
Office Action mailed Apr. 8, 2005 cited in related case U.S. Appl. No. 10/187,190.
Office Action mailed Feb. 2, 2006 cited in related case U.S. Appl. No. 10/187,190.
Office Action mailed Jul. 21 2006 cited in related case U.S. Appl. No. 10/187,190.
Office Action mailed Nov. 13, 2006 cited in related case U.S. Appl. No. 10/187,190.
Notice of Allowance mailed Apr. 5, 2007 cited in related case U.S. Appl. No. 10/187,190.
Notice of Allowance mailed Mar. 10, 2006 cited in related case U.S. Appl. No. 10/968,731.
Office Action mailed May 21, 2004 cited in related case U.S. Appl. No. 10/177,470.
Notice of Allowance mailed Aug. 6, 2004 cited in related case U.S. Appl. No. 10/177,470.
Office Action mailed Feb. 8, 2005 cited in related case U.S. Appl. No. 10/187,210.
Office Action mailed Jul. 12, 2005 cited in related case U.S. Appl. No. 10/187,210.
Office Action mailed Feb. 28, 2006 cited in related case U.S. Appl. No. 10/187,210.
Office Action mailed Aug. 29, 2006 cited in related case U.S. Appl. No. 10/187,210.
Office Action mailed Nov. 15, 2006 cited in related case U.S. Appl. No. 10/187,210.
Office Action mailed Mar. 6, 2007 cited in related case U.S. Appl. No. 10/187,210.
Office Action mailed Jul. 17, 2007 cited in related case U.S. Appl. No. 11/086,590.
Office Action mailed Sep. 8, 2005 cited in related case U.S. Appl. No. 10/186,881.
Office Action mailed Mar. 24, 2006 cited in related case U.S. Appl. No. 10/186,881.
Office Action mailed Oct. 6, 2006 cited in related case U.S. Appl. No. 10/186,881.
Office Action mailed Mar. 7, 2007 cited in related case U.S. Appl. No. 10/186,881.
Office Action mailed Sep. 5, 2007 cited in related case U.S. Appl. No. 10/186,881.
Office Action mailed Sep. 15, 2005 cited in related case U.S. Appl. No. 10/003,750.
Office Action mailed Feb. 8, 2006 cited in related case U.S. Appl. No. 10/003,750.
Office Action mailed Jun. 27, 2006 cited in related case U.S. Appl. No. 10/003,750.
Office Action mailed Dec. 12, 2006 cited in related case U.S. Appl. No. 10/003,750.
Office Action mailed Jun. 6, 2007 cited in related case U.S. Appl. No. 10/003,750.
U.S. Appl. No. 10/000,837, filed Oct. 23, 2001.
U.S. Appl. No. 10/136,555, filed May 1, 2002, Elvanoglu.
U.S. Appl. No. 10/696,916, filed Oct. 30, 2003, Lai.
PR. Newswire, Saflink's JotterSAF E-Wallet & Privacy Software Now Available for Consumer Download, Feb. 7, 2001, p. 1.
M2 Presswire, ScanSoft; ScanSoft's new OmniForm Premium 5.0 to Offer Businesses Powerful Forms Management, Software Convertes Paper Forms to Digital for Easy Distribution and Accurate Data Management, Oct. 16, 2001, p. 1.
PR Newswire, ScanSoft's New OmniForm Premium 5.0 to Offer Business Powerful Forms Management, Oct. 1, 2001, pp. 1-5.
Freire et al., WebViews: Accessing Personalized Web Content and Services, ACM 2001, pp. 576-586.
U.S. Appl. No. 60/275,809, filed Mar. 14, 2001, Lucovsky et al.
Simple Object Access Protocol (SOAP) 1.1 W3C Note May 8, 2000 Don Box, DevelopMentor; David Ehnebuske, IBM; Gopal Kakivaya, Microsoft Andrew Layman, Microsoft; Noah Mendelsohn, Lotus Development Corp,; Henrik Frystyk Nielsen, Microsoft Satish Thatte, Microsoft; Dave Winer, UserLande Software, Inc. pp. 1-35.
Security requirements for web-services; Author Jerbic, M.; Report Title: Position papers for World Wide Web consortium (W3C) workshop on web services; pp. 28-33 Issued by: Hwelett-Packard Lab., Bristol, UK; Publication Date: 2001 Country of Publication: UK; 50 pp.
Title: A role-based access control model for XML repositories; Author Hao He; Wong, R.K. Conference Title: Proceddings of the First International Conference on Web Information Systems Engineering; Part vol. 1 p. 138-45 vol. 1 Publication Date: 2000; Country of Publication: USA; 2 vol. (xv+498+xvi+219); pp. ISBN: 0769505775; Material Indentity No. XX-2000-02089 Conference Title: Proceedings of WISE 2000: 1st International Converfence on Web Information Systems Engineering; Conference Dat: Jun. 19-21, 2000 Conference Location: Hong Kong, China.
Caswell, Deborah L., “An Evolution of DCE Authorization Services,” Hewlett-Packard Journal, vol. 46, No. 6, pp. 49-54, Dec. 1995.
Chandramouli, Ramaswamy; “Application of XML Tools for Enterprise-Wide RBAC Implementation Tasks”; ACM Press; 2000; pp. 11-18.
Vuong et al.; “Managing Security Policies in a Distributed Environment using eXtensible Markup Language (XML)” Proceddings of the 2001 ACM Symposium on Applied Computing (SAC), Mar. 11-44, 2001, Las Vegas, NV; pp. 405-411.
Stallings, William; Crypotgraphy and Network Security; 1998; Prentice Hall, Inc.; Chapter 11.
Barish, Greg; Untangling the Web; Intelligent Enterprise; Mar. 27, 2001; pp. 38-43.
Dix, Chris; Working With SOAP, The Simple Object Access Protocol; C/C++ Users Journal; Jan. 2002; pp. 22-33.
Jepsen, Tom; SOAP Cleans Up Interoperability Problems on the Web; IT Pro; Jan.-Feb. 2001; pp. 52-55.
X Marks the Path; JNJ Online; http://www.dnjonline.com/articles/essentials/iss25—essentials—xpath.asp;Jan. 3, 2002; 6 pgs.
SOAP Version 1.2 Part 1: Messaging Framework; http://www.w3.org/TR/2002/WD-soap12-part1-20011002; Nov. 30, 2001, 33 pgs.
Soap Version 1.2 Part 2: Adjuncts; http://www.w3.org/TR/2001/WD-soap12-part2-20011002; Oct. 30, 2001, 43 pgs.
WML Path Language (XPath) Version 1.0; http://www.w3.org/TR/1999/REC-xpath-19991116;Oct. 30, 2001; 35 pgs.
Li, “What You See Is What I Saw: Application of Stateless Client Systems in Asynchronous CSCW”, In Proceedings of the 4th International Conference on Computer Science and Informatics, 1998.
BR Office Action for Application No. Pl0302014-2, May 18, 2015. (MS# 167497.07).
Tanenbaum, “Modern Operating Systems”, Second Edition, Prentice Hall, portion of section 8.3, Mar. 3, 2001.
Related Publications (1)
Number Date Country
20140032631 A1 Jan 2014 US
Provisional Applications (1)
Number Date Country
60275809 Mar 2001 US
Continuations (2)
Number Date Country
Parent 11347448 Feb 2008 US
Child 14045704 US
Parent 10062045 Jan 2002 US
Child 11347448 US