Skip to content

Require self-loops for each graph node, and use them instead of shortest path #1679

@stevenengler

Description

@stevenengler

Discussed in #1626

Originally posted by stevenengler September 3, 2021
To avoid the confusing behaviour in the second case (when network.use_shortest_path is true), we plan on requiring self-loops for all nodes. This requires the user to explicitly specify a latency for communication between two hosts on the same graph node. We will also always use this self-loop latency for communication between hosts on the same node, and we will not compute the shortest path in this case.

Metadata

Metadata

Assignees

Labels

Type: EnhancementNew functionality or improved design

Type

No type

Projects

No projects

Relationships

None yet

Development

No branches or pull requests

Issue actions