Alfred M Lee

US Patent:

7584499, Sep 1, 2009

Filed:

Apr 8, 2005

Appl. No.:

11/102848

Inventors:

Alfred M. Lee - Seattle WA, US
Ashok Malhotra - Croton-on-Hudson NY, US
Elliot Lee Waingold - Seattle WA, US
Jeffery C. Schlimmer - Redmond WA, US
Stephen J. Millet - Edmonds WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H04L 9/00
G06F 17/00

US Classification:

726 1, 713153, 713172, 726 5, 726 14

Abstract:

The present invention provide for an algebraic mapping of a policy expression from a compact to a normalized form, both in Boolean and set formulations. The policy algebra is defined in such a way that policy alternatives within the normalized expression will be the same across equivalent compact expressions—regardless of how the assertions are arbitrarily constrained or what operators are used to constrain such equivalent expressions. Moreover, the present invention also provides a model for identifying alternatives that are equivalent by comparing only the root element names or QName of each assertion within an alternative. In addition, embodiments as described herein can utilize the identification of equivalent alternatives in order to create an intersection policy expression to limit alternatives of admissible behavior to those in common across both endpoints.

US Patent:

8001189, Aug 16, 2011

Filed:

Oct 15, 2002

Appl. No.:

10/270445

Inventors:

Henrik F. Nielsen - Seattle WA, US
John P. Shewchuk - Redmond WA, US
Erik B. Christensen - Seattle WA, US
Alfred M. Lee - Seattle WA, US
Christian Huitema - Clyde Hill WA, US
James M. Lyon - Redmond WA, US
Mark H. Lukovsky - Sammamish WA, US
Andrew J. Layman - Bellevue WA, US
Satish R. Thatte - Redmond WA, US
Christopher Kaler - Sammamish WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 15/16

US Classification:

709206

Abstract:

A routing protocol is provided for exchanging messages between an initial sender and an ultimate receiver, potentially via a set of intermediaries. The routing protocol provides an optional reverse message path that enables two-way message exchange patterns. The routing protocol can be expressed as a header entry within a message envelope, is independent of the underlying protocol, and can be generated at the application layer of a protocol stack. The routing protocol may allow each intermediary to process the message and dynamically alter the message path en route to the intended recipient.

US Patent:

8463324, Jun 11, 2013

Filed:

Dec 18, 2009

Appl. No.:

12/641764

Inventors:

Brian K. Kormanyos - Edmonds WA, US
Jeremy Popp - Duvall WA, US
Timothy T. Lee - Rancho Palos Verdes CA, US
Alfred E. Lee - Torrance CA, US
Gregory A. Kromholtz - Seattle WA, US

Assignee:

The Boeing Company - Chicago IL

International Classification:

H04B 1/38

US Classification:

4555621, 4551143, 455102, 455121, 455269, 359276, 359278, 359333, 330286, 342175

Abstract:

An antenna and power amplifier element assembly may include an antenna assembly and a quasi-optic power amplifier. The quasi-optic power amplifier may include an output transistor coupled to the antenna assembly. A harmonic trap may be coupled to the quasi-optic power amplifier.

US Patent:

20030046383, Mar 6, 2003

Filed:

Sep 5, 2001

Appl. No.:

09/947181

Inventors:

Alfred Lee - Seattle WA, US
NK Srinivas - Sammamish WA, US
Christian Huitema - Clyde Hill WA, US
Bernard Aboba - Bellevue WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F015/173
G06F015/16

US Classification:

709/224000, 709/203000

Abstract:

A system and method for measuring the performance of a network, such as the Internet, uses a server on the network to collect network performance data in the process of servicing clients on the network. When the server receives a data transfer request from a client, it records operation information such as the time it takes to transfer the requested data, the size of the data, etc. and derives performance evaluation data such as round-trip time, bandwidth, packet loss, etc. that indicate network performance between the client and the server. The recorded performance data for the multiple clients are aggregated and analyzed together with client information to determine the network performance experienced by the clients.

US Patent:

20050188072, Aug 25, 2005

Filed:

Feb 20, 2004

Appl. No.:

10/783554

Inventors:

Alfred Lee - Seattle WA, US
David Levin - Redmond WA, US
Erik Christensen - Seattle WA, US
Sara Wong - Bellevue WA, US

International Classification:

G06F015/173

US Classification:

709223000

Abstract:

A method includes retrieving an intermediate node policy characterizing communication properties supported by an intermediate node, the intermediate node being between a source node and a destination node in a communication path. The method includes forming a first policy-compliant message in accordance with the intermediate node policy, the first policy-compliant message including a request for a destination node policy characterizing communication properties supported by the destination node. A system includes a policy retriever comparing a source policy to one to an intermediate policy to determine whether the source policy is compatible with the intermediate policy. A message generator generates a policy request message by applying the intermediate policy to a request for a policy related to a destination node.

US Patent:

20050198098, Sep 8, 2005

Filed:

Feb 20, 2004

Appl. No.:

10/783751

Inventors:

David Levin - Redmond WA, US
Erik Christensen - Seattle WA, US
Saurab Nog - Sammamish WA, US
Donald Box - Bellevue WA, US
Christopher Kaler - Sammamish WA, US
Giovanni Della-Libera - Seattle WA, US
Alfred Lee - Seattle WA, US
David Wortendyke - Seattle WA, US

International Classification:

G06F015/16

US Classification:

709200000

Abstract:

A method includes advertising a policy characterizing communication properties supported by a node. The policy may be distributed to another node in response to a request for the policy. Policy expressions in the policy include one or more assertions that may be grouped and related to each other in a plurality of ways. A system includes a policy generator for generating at least one policy characterizing properties of a node. A policy retriever retrieves a policy from another node and a message generator generates a message to the other node, wherein the message conforms to the policy from the other node.

US Patent:

20050198326, Sep 8, 2005

Filed:

Feb 20, 2004

Appl. No.:

10/783776

Inventors:

Jeffrey Schlimmer - Redmond WA, US
David Levin - Redmond WA, US
Alfred Lee - Seattle WA, US
Erik Christensen - Seattle WA, US
Bradford Lovering - Seattle WA, US

International Classification:

G06F015/16

US Classification:

709229000

Abstract:

Implementations are described and claimed herein to detect an invalid policy that may reside in a cache at a client. An expired policy is removed from cache and a current policy is requested. Otherwise the cached policy may be used. The client indicates which policy it is using by generating a policy digest, including, in compressed form, one or more assertions. If the host determines the policy digest is invalid, the host issues an invalid digest fault. If the policy digest is valid, but the assertions included in the policy digest are invalid, the host issues an invalid policy fault. In either case, the client is notified that the cached policy is no longer valid and that a current policy should be requested.

US Patent:

20050198351, Sep 8, 2005

Filed:

Feb 20, 2004

Appl. No.:

10/784146

Inventors:

Saurab Nog - Sammamish WA, US
Alfred Lee - Seattle WA, US
David Levin - Redmond WA, US

International Classification:

G06F015/16

US Classification:

709232000, 709238000

Abstract:

Implementations are described and claimed herein for content-based routing of messages in an overlay network. According to an exemplary implementation, routing nodes receive messages and return routing policies to the sending node based at least in part on content of the message. The routing policies include instructions for redirecting similar messages to other nodes in the overlay network. The sending node determines which policies to apply to the message. The sending node may then iterate through the routing policies, modifying the address in the message according to instructions included in the routing policies so that the message is sent, e.g., directly to the intended destination. Accordingly, the sending node is able to bypass one or more intermediary nodes to reduce latency in the overlay network.