Microsoft Technology Licensing, LLC

Other

Microsoft Corporation

Richard L Hasha

Gopala Krishna R Kakivaya

Lu Xun

Christopher G Kaler

Dahlia Malkhi

Thomas Lee Rodeheffer

Stephen Springmeyer

Harry S Pyle

David Muoio

Jeffrey Bruce Parham

Hervey O Wilson

Michael Marucheck

Gopal Krishna R Kakivaya

Andrew D Milligan

Charles R Reeves

Angela Mills

James R Cook

Lawrence A Buerk

James P Cook

Gopal Krishna Kakivaya

Jeffrey B Parham

Christian F Huitema

David Wortendyke

Giovanni Moises Della-Libera

Bradford H Lovering

Melissa Wood Dunn

John E Elsbree

Lidong Zhou

Jeffrey C Schlimmer

Craig Andrew Critchley

Tomasz Janczuk

Max A Feingold

Guillaume Simonnet

Timothy R Osborne

Douglas A Walter

Bradford A Christian

Mansoor Mohsin

Michael Abbott

Don Box

Gopala Krishna Kakivaya

Gopala Kirhsna R Kakivaya

Michael J Marucheck

The present invention extends to methods, systems, and computer program products for a joining node to join a ring of nodes within a rendezvous federation. Embodiments of the invention include establishing a neighborhood of multiple nodes on the ring of nodes. The joining node indicates its intent to take id-space ownership for a portion of the id-space between the joining node and a selected immediately adjacent node. The joining node initiates a one-way monitoring relationship with the selected immediately adjacent node. The joining node receiving an indication from the selected immediately adjacent node that indicates acceptance of the joining node's intent to take id-space ownership for a portion of the id-space between the joining node and the selected node and indicates establishment of a one-way monitoring relationship between the selected node and the joining node. The joining node agrees to participate in a one-way monitoring relationship with the selected node.

Maintaining consistency within a federation infrastructure

An art distribution system for distributing art to multiple display devices within an environment. The art distribution system provides a technique for specifying images to be displayed in an environment. The art distribution system provides a hierarchical representation of spaces within the environment. Each space may be further subdivided into subspaces. The art distribution system allows a user to select a space within the hierarchy and then to select an image that is to be displayed at the display devices within the selected space. The art distribution system then displays the selected image within the space including within all subspaces of the selected space. The art distribution system may allow a subsequent assignment of the image to a subspace to override within that subspace the previous selection of an image for the space.

Method and system for distributing art

Resources are organized into collections to facilitate more efficient and reliable resource access. Namespace managers communicate with one another to form a federation namespace infrastructure. The infrastructure can efficiently route, migrate, and process namespace requests, such as, for example, namespace registration requests from providers requesting to manage portions of namespaces and lookup requests from consumers requesting access to managed resources. Resources can be registered in and made accessible from multiple different namespaces. Resources can be identified using nested queries that filter results at multiple levels of a hierarchical namespace.

Organizing resources into collections to facilitate more efficient and reliable resource access

Embodiments include establishing and maintaining a consistent replica set within the federation infrastructure. A replica set, including a primary node and secondary nodes, is established from among nodes in a ring of nodes. An occurrence of a replica set configuration event affecting at least one of the replica set members is indicated. Based on the indication and based on a type of the replica set configuration event, it is determined that the replica set is to be reconfigured. The replica set is reconfigured according to a reconfiguration appropriate for the type of the replica set configuration event.

Data consistency within a federation infrastructure

Resources are organized into collections to facilitate more efficient and reliable resource access. Namespace managers communicate with one another to form a federation namespace infrastructure. The infrastructure efficiently routes, migrates, and processes namespace requests, such as, for example, namespace registration requests from providers requesting to manage portions of namespaces and lookup requests from consumers requesting access to managed resources. Resources are registered in and made accessible from multiple different namespaces. Resources are identified using nested queries that filter results at multiple levels of a hierarchical namespace.

The present invention extends to methods, systems, and computer program products for optimizing access to federation infrastructure-based resources. Various different layers within a federation infrastructure can signal location change events indicating the hosting location and/or access location for a resource is to be optimized. In response to a location change event, redirection information for accessing the resource is updated within the federation infrastructure. The redirection information is used to redirect resource access requests to appropriately optimized locations within the federation infrastructure. Redirecting resource access requests reduces communication within the federation infrastructure.

Optimizing access to federation infrastructure-based resources

A system and methods for service discovery and publication are disclosed. Application programs write requests for service discovery, publication, and subscription to a service discovery application programming interface. The service discovery application programming interface invokes one or more lower-level protocols to satisfy the discovery, publication and/or subscription request. Service information retrieved from lower-layer protocols is formatted into a consistent data model and returned to the client application. In addition, service information may be stored in a persistent data store managed by a discovery persistence service communicatively connected to the service discovery API.

Service discovery and publication

Methods, systems and computer program products are provided for rendezvousing resource requests with corresponding resources. Doubly linked sorted lists are traversed using modulo arithmetic in both directions. Sorted lists can be partitioned based on a multiple proximity metrics. Node routing tables provide a logarithmic index to nodes within the ID space of the federation infrastructure to facilitate more efficient routing. Messages can be routed to nodes within a ring and proximally routed to nodes in other partitioned rings.

Rendezvousing resource requests with corresponding resources

Aspects of an audio/visual architecture are disclosed. In one aspect, a system is disclosed where the system has a media manager object, an audio/visual program, and a player/recorder object so that when the program is selected, the media manager dynamically loads the player/recorder object for either playing or recording the program. For example, with respect to the media manager object, it can manage a collection of related program entities and any corresponding player/recorder components. Also, the media manager can allocate share source ports and shared sink ports in order to dynamically create virtual circuit paths for selected program entries.

Audio visual architecture

A computational system determines that a joining node in the federation infrastructure desires to join an identified subfederation within the federation infrastructure. The system accesses the joining node's group table, where the group table includes membership information identifying subfederations within the federation infrastructure. Each node in the federation maintains neighborhood information for each subfederation of which the node is aware. The system determines that no entry for the identified subfederation exists in the joining node's group table and, based on the determination, routes a group join message to a rendezvous point within the federation infrastructure. The rendezvous point checks its group table for an entry corresponding to the identified subfederation. The system also receives an indication from the rendezvous point indicating that the rendezvous point's group table does not include a corresponding entry for the identified subfederation and that the joining node is the first member of the identified subfederation.

Subfederation creation and maintenance in a federation infrastructure

The present invention extends to methods, systems, and computer program products for organizing resources into collections to facilitate more efficient and reliable resource access. Namespace managers communicate with one another to form a federation namespace infrastructure. The infrastructure can efficiently route, migrate, and process namespace requests, such as, for example, namespace registration requests from providers requesting to manage portions of namespaces and lookup requests from consumers requesting access to managed resources. Resources can be registered in and made accessible from multiple different namespaces. Resources can be identified using nested queries that filter results at multiple levels of a hierarchical namespace.

Implementations of the present invention relate in part to optimizations to peer-to-peer communication systems. For example, one implementation relates to use of a smart transceiver that creates, caches, and manages communication channels dynamically between peers. Another implementation relates to use of a central tracking object that can be used to efficiently register and distribute peer messages among the various peers. In one implementation, the central tracking object is shared amongst peers in the group. Still another implementation relates to associating peer groups with namespaces, and for including peer groups of one namespace within still other peer groups of different namespaces. These and other aspects of the invention can also be used to ensure delivery intent of a given peer message is preserved, and to ensure that optimal numbers of messages are communicated to any given peer at any given time.

Optimizing communication using scalable peer groups

The present invention extends to methods, systems, and computer program products for facilitating inter-proximity communication within a rendezvous federation. Nodes maintain collateral ring set entry tables that include collateral rings and corresponding entry nodes into the collateral rings. Nodes can exchange collateral ring set entry state to update one another on the configuration of rings within a tree of rings. Nodes can refer to collateral ring set entry tables, as well as to other nodes, to identify entry nodes into rings that are collateral rings of the node. Messages can be sent to entry nodes in collateral rings. A message can include an indication that an entry node in a target proximity ring is to resolve the message to the node in the target proximity ring which has a node ID closest to an indicated destination node.

Inter-proximity communication within a rendezvous federation

Growing community of inventors

Seattle, WA, United States of America

Richard L Hasha