Mobile Agents for Presence Detection in P2P Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The traditional client-server computing model underutilizes Internet assets such as information, bandwidth, and computing resources, leading to challenges in real-time information retrieval, inefficient bandwidth usage, and increased pressure on data centers due to centralized computation.

Innovation Solution

Implementing mobile agents in peer-to-peer networks to gather presence information and detect active peers within peer groups, utilizing mobile agents to traverse itineraries and update presence information, enabling dynamic and decentralized resource utilization.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of information

If mobile agents are deployed in peer-to-peer networks to gather presence information, then information discovery capability is enhanced and bandwidth utilization is improved, but system complexity and overhead for managing mobile agents increase

Engineering Contradiction:
Improveinformation discovery capabilityVSAvoidsystem complexity
Core Design Contradiction:
Loss of informationVSDevice complexity

Solution Approach 1:

The patent introduces mobile agents as intermediary entities that traverse the peer-to-peer network to gather presence information. These agents act as mediators between the initiating peer and member peers, eliminating the need for direct peer-to-peer communication for presence detection. The agents carry itineraries and payloads, facilitating information discovery while managing system complexity through standardized agent protocols.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Power

If computation is centralized in data centers, then processing power and storage capacity are increased, but pressure on data centers and power consumption increase

Engineering Contradiction:
Improveprocessing powerVSAvoidpower consumption
Core Design Contradiction:
PowerVSUse of energy by stationary object

Solution Approach 1:

The patent segments the centralized computation model into distributed peer-to-peer computation. Instead of all presence detection and information gathering being performed by centralized data centers, the system divides these tasks among multiple peer nodes. Each peer can execute mobile agents locally, segmenting the computational workload and reducing the energy burden on any single data center while maintaining overall processing power through distributed computation.

Inventive Principle:
Principle #1Segmentation

3Ease of operation

If traditional client-server model is used, then system architecture is simplified and ease of operation is maintained, but bandwidth utilization is inefficient and resource underutilization occurs

Engineering Contradiction:
Improvesystem operation simplicityVSAvoidbandwidth utilization efficiency
Core Design Contradiction:
Ease of operationVSLoss of energy

Solution Approach 1:

The patent introduces dynamic mobile agents that can adapt their behavior based on network conditions and peer availability. Unlike static client-server interactions, the agents dynamically traverse the network, adjusting their itineraries and execution based on real-time presence information. This dynamic approach improves bandwidth utilization by only contacting active peers and routing agents through optimal paths, while maintaining operational simplicity through standardized agent protocols that abstract the complexity from users.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS8037202B2Presence detection using mobile agents in peer-to-peer networks
Publication Date: 2011.10.11 ORACLE AMERICAN INC
  • US8037202B2 patent drawing
  • US8037202B2 patent drawing
  • US8037202B2 patent drawing

AI summary

Embodiments of a system and method for using mobile agents in peer-to-peer networks to gather presence information for determining active peers in groups of peers. In one embodiment, a mobile agent may be launched by an initiating peer in a peer group to attempt to visit each member peer in a peer group. The itinerary of the mobile agent may include information for accessing each member peer of the peer group. The mobile agent may return to its initiating peer with a payload indicating which of the member peers it was successful in contacting and visiting. When the mobile agent returns to the originating peer, the originating peer may update presence information indicating presence of member peer nodes in the group in accordance with the indications provided by the mobile agent.