Kenneth E Wolf

Address:

2807 Clover Dew Ct, Valrico, FL 33596

VIN:

3TMLU4EN6AM048887

Make:

TOYOTA

Model:

TACOMA

Year:

2010

US Patent:

7185060, Feb 27, 2007

Filed:

Mar 26, 2003

Appl. No.:

10/401220

Inventors:

Erik B. Christensen - Seattle WA, US
Douglas A. Walter - Issaquah WA, US
Michael J. Coulson - Clyde Hill WA, US
Kenneth D. Wolf - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/16

US Classification:

709206, 709219, 709229, 719310, 719332

Abstract:

Methods, systems, and computer program products that reduce buffer requirements in a messaging system so that the messaging system can send or receive relatively larger messages using a given buffer size. Message handlers are provided, each identifying a corresponding processing operation to perform on a message object having a streamed portion with a stream oriented interface. Pipelines comprising ordered collections of the message handlers are provided as well. The message object is processed by the message handlers in the message pipelines, such that at least one message handler encapsulates the streamed portion of the message object with its corresponding processing operation. The corresponding processing operation is to be performed at a future time, and encapsulates the streamed portion of the message object without materializing the stream portion in a buffer. The messaging system may be an intermediary for routing a message object or an endpoint.

US Patent:

7453875, Nov 18, 2008

Filed:

Mar 23, 2005

Appl. No.:

11/087139

Inventors:

Michael S. Vernal - Seattle WA, US
Erik B. Christensen - Seattle WA, US
Martin Gudgin - Sale, GB
John R. Justice - Bellevue WA, US
Gopal Kakivaya - Sammamish WA, US
David Langworthy - Kirkland WA, US
Yaniv Pessach - Redmond WA, US
Jeffrey Schlimmer - Redmond WA, US
Elliot Waingold - Seattle WA, US
Kenneth D. Wolf - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H04L 12/28
H04L 12/56
H04J 3/26
G06F 15/16

US Classification:

370389, 370390, 3703953, 3703955, 37039552, 370431, 370432, 709227, 709228, 709229, 709230, 709231, 709232

Abstract:

A sending computer system can identify one or more available network resources at one or more network computers by sending a request for services using Simple Object Access Protocol (SOAP) over User Datagram Protocol (UDP). In particular, the sending computer system prepares a SOAP message that includes a request for available resources. The sending computer system then encapsulates the SOAP message into a user datagram, and sends the user datagram to one or more identifiable computer systems on the network. In one implementation, the sending computer system sends the user datagram to a multi-cast Uniform Resource Identifier (URI). The receiving computer system receives the message through UDP, unpacks the message, and responds to the SOAP message request. Accordingly, the sending computer system can query multiple computer systems in an efficient manner without necessarily incurring the overhead otherwise associated with connection-oriented communication.

US Patent:

7814211, Oct 12, 2010

Filed:

Aug 31, 2006

Appl. No.:

11/469442

Inventors:

Michael S. Vernal - Seattle WA, US
Aaron Stern - Bellevue WA, US
Donald F. Box - Bellevue WA, US
Erik B. Christensen - Seattle WA, US
Kenneth D. Wolf - Seattle WA, US
Michael J. Coulson - Clyde Hill WA, US
Elliot L. Waingold - Seattle WA, US
Luis Felipe Cabrera - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/16

US Classification:

709227, 709206, 709228, 709229, 709230, 709246, 709247, 719319, 713176, 370352

Abstract:

Embodiments described herein provide a user with the ability to vary the encoding of a message object rather than being bound to a specific one, e. g. , the text encoding for SOAP messaging. Accordingly, a message encoding factory is provided that is responsible for mapping a message object (e. g. , SOAP Infoset) into raw octets suitable for wire transmission. By encapsulating the notion of a message encoder factory abstractly, embodiments allow users to vary the encoding of an Infoset without varying the programming model (or any other aspect of the system that uses message). In other words, embodiments herein separate the transport (e. g. , TCP, HTTP, etc. ) from the encoding, which allows users to use any number of encoding mechanisms—even their own proprietary ones.

US Patent:

7827127, Nov 2, 2010

Filed:

Oct 26, 2007

Appl. No.:

11/977846

Inventors:

Kenneth David Wolf - Seattle WA, US
Edmund S. V. Pinto - Duvall WA, US
Robert B. Schmidt - Woodinville WA, US
Nathan C. Talbert - Seattle WA, US
Stephen J. Millet - Edmonds WA, US
Donald F. Box - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/18

US Classification:

706 14

Abstract:

Described is a data model used in a continuation based runtime that executes activities. The data model provides for declaring parameters to define data flow direction (in, out or both in and out) with respect to activities. The model further allows for the declaring of variables to provide for data storing and sharing between activities that are in scope, based on a tree relationship between activities. In one aspect, an activity tree includes a topmost parent composite activity and at least one child activity of that topmost parent composite activity. Variables are associated with one or more composite activities of the tree, and the ancestral relationships between composite activities and (non-composite) child activities determine the in-scope access to variables. Arguments such as binding expressions may bind variables to an activity's parameters.

US Patent:

7882236, Feb 1, 2011

Filed:

Feb 4, 2005

Appl. No.:

11/051238

Inventors:

Bradford H. Lovering - Seattle WA, US
David A. Wortendyke - Seattle WA, US
Erik B. Christensen - Seattle WA, US
Kenneth D. Wolf - Seattle WA, US
Michael S. Vernal - Seattle WA, US
Shy Cohen - Bellevue WA, US
Stefan H. Pharies - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/16

US Classification:

709227, 709228, 709229

Abstract:

The present invention provides for a channel model capable of generating a runtime communication channel with pluggable modular channel components. These channel components implement one of a set of standard interfaces that allow processing details of communication semantics between components to be represented in a polymorphic way. A message and corresponding communication semantics are recursively passed through the channel components using the standard interface, thereby abstracting other modules and components from specific implementation details of how the communication semantics are performed. The message may then be sent to the next appropriate module for further processing, or the processing may be completed at that particular component or module. Note also that the message can also be de-multiplexed on the service side in a similar fashion as that described above.

US Patent:

7925710, Apr 12, 2011

Filed:

Aug 31, 2006

Appl. No.:

11/469433

Inventors:

Michael S. Vernal - Seattle WA, US
Donald F. Box - Bellevue WA, US
Douglas M. Purdy - Carnation WA, US
Eugene Osovetsky - Bellevue WA, US
Kenneth D. Wolf - Seattle WA, US
Stephen T. Swartz - Seattle WA, US
Erik B. Christensen - Seattle WA, US
Stefan H. Pharies - Zurich, CH

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/16
G06F 9/44

US Classification:

709207, 709202, 709203, 709206, 709209, 709230, 709245, 719313, 370325, 370389, 370428

Abstract:

Embodiments described herein provide for a message object that simultaneously exposes an XML view and Type view for a message infoset. In this embodiment, interaction with a message can occur using either an XML or Type application program interface (API), which are synced. More specifically, embodiments herein provide or expose a common set of headers (e. g. , SOAP headers) as “typed” properties (e. g. , CLR properties), which allow for getting and/or setting a value thereof. In other words, the Type API reads/writes values for typed properties without regard to how the message is encoded with XML. Moreover, the two APIs are synced such that a value can be set using one API and retrieved using the other. For example, an XML API may be used as a writing mechanism for interacting with a value, while the Type API can read that same value, and vise-versa.

US Patent:

7949720, May 24, 2011

Filed:

Aug 31, 2006

Appl. No.:

11/469430

Inventors:

Michael S. Vernal - Seattle WA, US
Aaron Stern - Bellevue WA, US
Donald F. Box - Bellevue WA, US
Erik B. Christensen - Seattle WA, US
Kenneth D. Wolf - Seattle WA, US
Michael J. Coulson - Clyde Hill WA, US
Stefan H. Pharies - Zuerich, CH
Luis Filipe Cabrera - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/16

US Classification:

709207, 709206, 709217, 709218, 709219, 709220, 709227, 709228, 709229, 70799901, 707999107

Abstract:

Embodiments described herein provide for an overall object mode that allows for a single message object to represent multiple messaging formats. A general message object is populated with fields for multiple available messaging formats, which can be appropriately filled with information with fields for both versions 1. 1 and 1. 2. Depending on which version is being used or desired, the appropriate fields can be populated when creating an instance of the message object. The other fields that do not correspond to that version, however, are left blank.

US Patent:

8074117, Dec 6, 2011

Filed:

Sep 25, 2009

Appl. No.:

12/567610

Inventors:

Kenneth D. Wolf - Seattle WA, US
Nicholas Alexander Allen - Redmond WA, US
Kirill Gavrylyuk - Seattle WA, US
Edmund Samuel Victor Pinto - Duvall WA, US
Tao Xie - Bellevue WA, US
Asad Jawahar - Woodinville WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 11/00

US Classification:

714 381, 714 471, 714 48, 717117

Abstract:

A declarative program definition. The definition is analyzed to produce an application contract that describes semantics for sending and receiving application messages during the successful execution of operations by the program. In addition, this analysis may also generate local behaviors associated with the local execution of the program. Alternatively or in addition, the analysis may infer secondary contracts regarding the sending and receiving of application messages, even though the full details of the secondary contracts are not present in the declarative program definition. For instance, the secondary contracts might include error contracts or consistency contracts.