Distributed Message Store Using Dynamic Addressing Functions

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The increasing demand for messaging services in wireless networks poses challenges for scalability and fault-tolerance, as single servers struggle to handle capacity and performance requirements, and conventional distributed server techniques require human intervention to manage server failures.

Innovation Solution

A system using addressing functions to dynamically manage message storage and retrieval across a cluster of distributed nodes, where each node calculates the actual destination based on a subscriber identifier and current network topology, allowing for automatic reconfiguration and redundancy to ensure high availability and scalability.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Device complexity

If single servers are used for message storage, then device complexity is reduced, but scalability and fault-tolerance deteriorate

Engineering Contradiction:
Improvesystem complexityVSAvoidfault-tolerance
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The system segments the message storage functionality across multiple distributed nodes instead of using a single server. Each node maintains local message stores and can independently serve requests, dividing the system into autonomous functional units that collectively provide both scalability and fault-tolerance

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Each distributed node is designed to perform multiple functions: it can store messages locally, retrieve messages for users, forward messages to other nodes, and serve as a backup for failed nodes. This multi-functionality allows the system to maintain reliability while distributing complexity across nodes

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

2Reliability

If multiple distributed servers are used, then scalability and fault-tolerance are improved, but device complexity increases

Engineering Contradiction:
Improvefault-toleranceVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The system implements self-service mechanisms where nodes automatically detect failures, reconfigure routing paths, and redistribute message storage responsibilities without human intervention. The addressing function dynamically adapts to network changes, eliminating the need for manual reconfiguration and reducing operational complexity

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The system employs dynamic addressing functions that automatically adjust message routing and storage locations based on current network topology and node availability. This dynamic adaptation allows the system to handle failures and scaling events automatically, reducing the complexity of manual management

Inventive Principle:
Principle #15Dynamics

3Productivity

If conventional distributed server techniques are used, then scalability is improved, but ease of operation deteriorates due to required human intervention

Engineering Contradiction:
ImprovescalabilityVSAvoidoperational ease
Core Design Contradiction:
ProductivityVSEase of operation

Solution Approach 1:

The system incorporates continuous feedback mechanisms where nodes monitor each other's status, detect failures, and automatically trigger reconfiguration actions. This feedback loop enables the system to adapt to changing conditions and maintain operational ease while scaling, as the automated response to events eliminates the need for manual intervention

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS7904592B2Distributed, fault-tolerant message store
Publication Date: 2011.03.08 CLOUDIAN HOLDINGS INC
  • US7904592B2 patent drawing
  • US7904592B2 patent drawing
  • US7904592B2 patent drawing

AI summary

A system and method of managing a network provides for distributed storage and retrieval. In one embodiment, information such as a text message is stored by calculating an actual destination node based on a subscriber identifier and a current addressing function, which corresponds to a current topology of a network. The message is sent to the actual destination node for storage. Messages can be retrieved by calculating a plurality of destination nodes based on a subscriber identifier and a plurality of addressing functions, where each addressing corresponds to a topology of the network at a particular moment in time. In one embodiment, the addressing functions are hash functions.