Distributed Request Ring for Casual Server Data Retrieval

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional systems are unable to efficiently handle data requests without knowing the data's locality, as they do not allow servers to participate in a network to fulfill requests from other servers, limiting data access and retrieval.

Innovation Solution

A distributed casual search mechanism is implemented, where an originating server posts a request to a distributed request ring, allowing a remote server to query and provide data, with a foreign reference written to track updates, enabling servers to work together to fulfill data requests without knowing each other's identities.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If conventional systems probe all servers to find data, then data can be located, but the process is inefficient and time-consuming

Engineering Contradiction:
Improvedata retrieval efficiencyVSAvoidtime to locate data
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The system pre-establishes a distributed request ring structure where servers are interconnected in advance. When data is needed, the request is already routed through the pre-configured ring structure, eliminating the need for ad-hoc probing of all servers. The foreign reference mechanism is also pre-configured to automatically track and propagate requests.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent introduces a distributed request ring as an intermediary structure that facilitates data requests. Instead of direct server-to-server probing, requests are mediated through the ring structure, which efficiently routes requests to the appropriate servers that hold the desired data.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Adaptability or versatility

If servers work in isolation without network participation, then system simplicity is maintained, but data accessibility across servers is limited

Engineering Contradiction:
Improvedata accessibilityVSAvoidnetwork structure complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The system segments the distributed network into independent server nodes that each maintain their own data stores and foreign references. Each server operates semi-independently but can participate in the request ring, allowing the system to scale by simply adding more segmented nodes without fundamentally changing the architecture.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent creates a universal request ring structure that can handle various types of data requests across different servers. The same ring mechanism and foreign reference approach work regardless of which servers are involved or what type of data is being requested, providing a multi-functional solution for distributed data access.

Inventive Principle:
Principle #6Universality (Multi-functionality)

3Adaptability or versatility

If data requests are posted to a distributed request ring, then data can be retrieved from remote servers, but the system complexity increases

Engineering Contradiction:
Improvecross-server data accessVSAvoidrequest routing complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The system implements self-service through automatic foreign reference updates and request propagation. When a server receives a request and finds the data, it automatically writes foreign references and propagates the response back through the ring, without requiring complex manual routing or intervention. The structure serves itself by automatically managing the request-response cycle.

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS8280983B2Distributed search in a casual network of servers
Publication Date: 2012.10.02 MICROSOFT TECHNOLOGY LICENSING LLC
  • US8280983B2 patent drawing
  • US8280983B2 patent drawing
  • US8280983B2 patent drawing

AI summary

Distributed searches in a casual server network may be provided. First it may be determined, at an originating server, that a first request cannot be fulfilled by information associated with the originating server. Then, from the originating server, the first request may be posted to a distributed request ring. Next, at a remote server on the distributed request ring, the first request may be received. The remote server may then query for current data on a data store associated with the remote server that may satisfy the first request. The remote server may next write a foreign reference in the data store. The foreign reference may indicate that the originating server requested the current data. Next, at the originating server, a response may be received to the first request from the remote server. The response may include the current data.