| Package | Description |
|---|---|
| org.apache.hadoop.net |
Network-related classes.
|
| Modifier and Type | Interface | Description |
|---|---|---|
interface |
InnerNode |
| Modifier and Type | Class | Description |
|---|---|---|
class |
InnerNodeImpl |
InnerNode represents a switch/router of a data center or rack.
|
class |
NodeBase |
A base class that implements interface Node
|
| Modifier and Type | Field | Description |
|---|---|---|
protected Node |
NodeBase.parent |
| Modifier and Type | Field | Description |
|---|---|---|
protected java.util.List<Node> |
InnerNodeImpl.children |
|
protected java.util.Map<java.lang.String,Node> |
InnerNodeImpl.childrenMap |
| Modifier and Type | Method | Description |
|---|---|---|
<T extends Node> |
NetworkTopology.sortByDistance(Node reader,
T[] nodes,
int activeLen,
java.util.function.Consumer<java.util.List<T>> secondarySort) |
Sort nodes array by network distance to reader with secondary sort.
|
<T extends Node> |
NetworkTopology.sortByDistanceUsingNetworkLocation(Node reader,
T[] nodes,
int activeLen,
java.util.function.Consumer<java.util.List<T>> secondarySort) |
Sort nodes array by network distance to reader.
|
| Modifier and Type | Method | Description |
|---|---|---|
Node |
NetworkTopology.chooseRandom(java.lang.String scope) |
Randomly choose a node.
|
protected Node |
NetworkTopology.chooseRandom(java.lang.String scope,
java.lang.String excludedScope,
java.util.Collection<Node> excludedNodes) |
|
Node |
NetworkTopology.chooseRandom(java.lang.String scope,
java.util.Collection<Node> excludedNodes) |
Randomly choose one node from scope.
|
Node |
InnerNode.getLeaf(int leafIndex,
Node excludedNode) |
get leafIndex leaf of this subtree
if it is not in the excludedNode
|
Node |
InnerNodeImpl.getLeaf(int leafIndex,
Node excludedNode) |
|
Node |
InnerNode.getLoc(java.lang.String loc) |
Given a node's string representation, return a reference to the node
|
Node |
InnerNodeImpl.getLoc(java.lang.String loc) |
|
Node |
NetworkTopology.getNode(java.lang.String loc) |
Given a string representation of a node, return its reference
|
protected Node |
NetworkTopology.getNodeForNetworkLocation(Node node) |
Return a reference to the node given its string representation.
|
protected Node |
NetworkTopologyWithNodeGroup.getNodeForNetworkLocation(Node node) |
|
Node |
Node.getParent() |
|
Node |
NodeBase.getParent() |
| Modifier and Type | Method | Description |
|---|---|---|
java.util.List<Node> |
InnerNode.getChildren() |
|
java.util.List<Node> |
InnerNodeImpl.getChildren() |
|
java.util.List<Node> |
NetworkTopology.getDatanodesInRack(java.lang.String loc) |
Given a string representation of a rack, return its children
|
java.util.List<Node> |
NetworkTopology.getLeaves(java.lang.String scope) |
return leaves in scope
|
| Modifier and Type | Method | Description |
|---|---|---|
boolean |
InnerNode.add(Node n) |
Add node n to the subtree of this node
|
boolean |
InnerNodeImpl.add(Node n) |
|
void |
NetworkTopology.add(Node node) |
Add a leaf node
Update node counter & rack counter if necessary
|
void |
NetworkTopologyWithNodeGroup.add(Node node) |
Add a leaf node
Update node counter & rack counter if necessary
|
boolean |
NetworkTopology.contains(Node node) |
Check if the tree contains node node
|
void |
NetworkTopology.decommissionNode(Node node) |
Update empty rack number when remove a node like decommission.
|
int |
NetworkTopology.getDistance(Node node1,
Node node2) |
Return the distance between two nodes
It is assumed that the distance from one node to its parent is 1
The distance between two nodes is calculated by summing up their distances
to their closest common ancestor.
|
static int |
NetworkTopology.getDistanceByPath(Node node1,
Node node2) |
Return the distance between two nodes by comparing their network paths
without checking if they belong to the same ancestor node by reference.
|
Node |
InnerNode.getLeaf(int leafIndex,
Node excludedNode) |
get leafIndex leaf of this subtree
if it is not in the excludedNode
|
Node |
InnerNodeImpl.getLeaf(int leafIndex,
Node excludedNode) |
|
java.lang.String |
InnerNodeImpl.getNextAncestorName(Node n) |
|
protected Node |
NetworkTopology.getNodeForNetworkLocation(Node node) |
Return a reference to the node given its string representation.
|
protected Node |
NetworkTopologyWithNodeGroup.getNodeForNetworkLocation(Node node) |
|
static java.lang.String |
NodeBase.getPath(Node node) |
Get the path of a node
|
static java.lang.String[] |
NodeBase.getPathComponents(Node node) |
Get the path components of a node.
|
protected int |
NetworkTopology.getWeight(Node reader,
Node node) |
Returns an integer weight which specifies how far away {node} is away from
{reader}.
|
protected int |
NetworkTopologyWithNodeGroup.getWeight(Node reader,
Node node) |
|
protected static int |
NetworkTopology.getWeightUsingNetworkLocation(Node reader,
Node node) |
Returns an integer weight which specifies how far away node is
from reader.
|
boolean |
InnerNodeImpl.isAncestor(Node n) |
Judge if this node is an ancestor of node n.
|
protected static boolean |
NetworkTopology.isNodeInScope(Node node,
java.lang.String scope) |
Checks whether a node belongs to the scope.
|
boolean |
NetworkTopology.isOnSameNodeGroup(Node node1,
Node node2) |
|
boolean |
NetworkTopologyWithNodeGroup.isOnSameNodeGroup(Node node1,
Node node2) |
Check if two nodes are on the same node group (hypervisor) The
assumption here is: each nodes are leaf nodes.
|
boolean |
NetworkTopology.isOnSameRack(Node node1,
Node node2) |
Check if two nodes are on the same rack
|
boolean |
NetworkTopologyWithNodeGroup.isOnSameRack(Node node1,
Node node2) |
|
boolean |
InnerNodeImpl.isParent(Node n) |
Judge if this node is the parent of node n.
|
protected boolean |
NetworkTopology.isSameParents(Node node1,
Node node2) |
Compare the parents of each node for equality
|
void |
NetworkTopology.recommissionNode(Node node) |
Update empty rack number when add a node like recommission.
|
boolean |
InnerNode.remove(Node n) |
Remove node n from the subtree of this node
|
boolean |
InnerNodeImpl.remove(Node n) |
|
void |
NetworkTopology.remove(Node node) |
Remove a node
Update node counter and rack counter if necessary
|
void |
NetworkTopologyWithNodeGroup.remove(Node node) |
Remove a node
Update node counter and rack counter if necessary
|
void |
Node.setParent(Node parent) |
Set this node's parent
|
void |
NodeBase.setParent(Node parent) |
Set this node's parent
|
void |
NetworkTopology.sortByDistance(Node reader,
Node[] nodes,
int activeLen) |
Sort nodes array by network distance to reader.
|
<T extends Node> |
NetworkTopology.sortByDistance(Node reader,
T[] nodes,
int activeLen,
java.util.function.Consumer<java.util.List<T>> secondarySort) |
Sort nodes array by network distance to reader with secondary sort.
|
<T extends Node> |
NetworkTopology.sortByDistance(Node reader,
T[] nodes,
int activeLen,
java.util.function.Consumer<java.util.List<T>> secondarySort) |
Sort nodes array by network distance to reader with secondary sort.
|
void |
NetworkTopologyWithNodeGroup.sortByDistance(Node reader,
Node[] nodes,
int activeLen) |
Sort nodes array by their distances to reader.
|
void |
NetworkTopology.sortByDistanceUsingNetworkLocation(Node reader,
Node[] nodes,
int activeLen) |
Sort nodes array by network distance to reader with secondary sort.
|
<T extends Node> |
NetworkTopology.sortByDistanceUsingNetworkLocation(Node reader,
T[] nodes,
int activeLen,
java.util.function.Consumer<java.util.List<T>> secondarySort) |
Sort nodes array by network distance to reader.
|
<T extends Node> |
NetworkTopology.sortByDistanceUsingNetworkLocation(Node reader,
T[] nodes,
int activeLen,
java.util.function.Consumer<java.util.List<T>> secondarySort) |
Sort nodes array by network distance to reader.
|
| Modifier and Type | Method | Description |
|---|---|---|
protected Node |
NetworkTopology.chooseRandom(java.lang.String scope,
java.lang.String excludedScope,
java.util.Collection<Node> excludedNodes) |
|
Node |
NetworkTopology.chooseRandom(java.lang.String scope,
java.util.Collection<Node> excludedNodes) |
Randomly choose one node from scope.
|
int |
NetworkTopology.countNumOfAvailableNodes(java.lang.String scope,
java.util.Collection<Node> excludedNodes) |
return the number of leaves in scope but not in excludedNodes
if scope starts with ~, return the number of nodes that are not
in scope and excludedNodes;
|
| Constructor | Description |
|---|---|
NodeBase(java.lang.String name,
java.lang.String location,
Node parent,
int level) |
Construct a node from its name and its location
|
Copyright © 2008–2025 Apache Software Foundation. All rights reserved.