Skip to content

SkipNet Distributed Hash Table Simulation with Locality Aware Routing Framework #747

@Tushar15769

Description

@Tushar15769

Feature Description

Introduce a distributed hash table simulation framework based on SkipNet architecture that organizes nodes into multiple skip-list routing layers. The framework should provide scalable decentralized storage, locality-preserving routing, logarithmic lookup complexity, and configurable network topology simulation for distributed system experimentation.

Expected Behavior
Organize participating nodes into multiple routing layers.
Support dynamic node joins and departures.
Maintain routing structures across all SkipNet levels.
Route requests using numeric or lexicographic identifiers.
Preserve locality-aware routing characteristics.
Achieve expected logarithmic routing complexity.
Support distributed key-value storage and retrieval operations.
Track routing paths and hop-count statistics.
Simulate network churn and topology evolution.
Support configurable routing-level and node-distribution parameters.
Provide routing diagnostics and performance metrics.
Expose join(node_id), leave(), store(key, value), lookup(key), and route_hops(key) APIs.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions