This group is locked. No changes can be made to the group while it is locked.
Re: alto pids
|
Y. Richard Yang
Good discussions. I have reported it as a bug in https://github.com/snlab/alto. In addition to reporting as a bug, which helps us to get priority, let's start some specific discussions. What we need is a mechanism so that an admin can define the partition of hosts into PIDs. Let me give a try to start a strawman. We can consider the hosts in the network as leaves in a graph. Each host also has a set of attributes (e.g., geolocation) beyond the graph properties. Hence, I assume that we need a mechanism to use these properties to group the hosts. A first idea coming to mind is cluster analysis (https://en.wikipedia.org/wiki/Cluster_analysis). Let me start with an anchor based approach. Assume that we allow the admin to define a set of anchors, where each anchor is a switch. { "netmap-grouping-alg": "nearest-anchor", "alg-metric": "hopcount", // it could be "nearest geo-location", if we know "anchors": [ "sw1", sw3", "sw4"], "cost-map-cal-alg": "avg" // cost from pid1 (sw1 cluster) to pid2 (sw2 cluster) is the average of host pairs } Then we can see that it defines three PIDs, where each PID is defined by an anchor in anchors. When an host is added, we can automatically compute which anchor is the nearest and hence assign it to it. We can prove that each PID is a connected component, if we assume the full graph is connected, when we consider graph hopcount. How to define a more general mechanism? Richard
On Tue, Oct 20, 2015 at 12:51 PM, Gao Kai <gaok12@...> wrote:
-- ===================================== | Y. Richard Yang <yry@...> | | Professor of Computer Science | =====================================
|
|
|