Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

How do KubeEdge's edge nodes find nearby relay node? #563

Open
YTGhost opened this issue May 15, 2024 · 0 comments
Open

How do KubeEdge's edge nodes find nearby relay node? #563

YTGhost opened this issue May 15, 2024 · 0 comments

Comments

@YTGhost
Copy link

YTGhost commented May 15, 2024

Hi everyone, I am very interested in the distributed dynamic relay connectivity provided by the EdgeMesh subproject under KubeEdge.

I have been researching the EdgeMesh project and found in the documentation(here: https://github.com/kubeedge/edgemesh/blob/main/docs/proposal/edgemesh-ha-design-proposal.md) that it is possible to dynamically select nearby relay nodes based on the geographic distribution of cluster nodes to provide network connectivity services, and this implementation is achieved through DHT.

However, I believe that in EdgeMesh, the closest nodes found through DHT are defined by the XOR distance between node IDs, which might not reflect the actual physical distances between nodes. Perhaps there is something I'm misunderstanding. Could anyone clarify this for me?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant