Concepts inOn hierarchical routing in doubling metrics
Metric space
In mathematics, a metric space is a set where a notion of distance between elements of the set is defined. The metric space which most closely corresponds to our intuitive understanding of space is the 3-dimensional Euclidean space. In fact, the notion of "metric" is a generalization of the Euclidean metric arising from the four long-known properties of the Euclidean distance.
more from Wikipedia
Hausdorff dimension
In mathematics, the Hausdorff dimension (also known as the Hausdorff–Besicovitch dimension) is an extended non-negative real number associated with any metric space. The Hausdorff dimension generalizes the notion of the dimension of a real vector space. That is, the Hausdorff dimension of an n-dimensional inner product space equals n. This means, for example, the Hausdorff dimension of a point is zero, the Hausdorff dimension of a line is one, and the Hausdorff dimension of the plane is two.
more from Wikipedia
Routing table
In computer networking a routing table, or Routing Information Base (RIB), is a data table stored in a router or a networked computer that lists the routes to particular network destinations, and in some cases, metrics (distances) associated with those routes. The routing table contains information about the topology of the network immediately around it. The construction of routing tables is the primary goal of routing protocols.
more from Wikipedia
Metric (mathematics)
In mathematics, a metric or distance function is a function which defines a distance between elements of a set. A set with a metric is called a metric space. A metric induces a topology on a set but not all topologies can be generated by a metric. A topological space whose topology can be described by a metric is called metrizable.
more from Wikipedia
Diameter
In geometry, a diameter of a circle is any straight line segment that passes through the center of the circle and whose endpoints are on the circle. The diameters are the longest chords of the circle. The word "diameter" derives from Greek διάμετρος (diametros), "diagonal of a circle", from δια- (dia-), "across, through" + μέτρον (metron), "a measure"). In more modern usage, the length of a diameter is also called the diameter.
more from Wikipedia
Degree (graph theory)
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice. The degree of a vertex is denoted The maximum degree of a graph G, denoted by Δ(G), and the minimum degree of a graph, denoted by δ(G), are the maximum and minimum degree of its vertices. In the graph on the right, the maximum degree is 5 and the minimum degree is 0. In a regular graph, all degrees are the same, and so we can speak of the degree of the graph.
more from Wikipedia
Hierarchical routing
Hierarchical routing is method of routing in networks that is based on hierarchical addressing.
more from Wikipedia
Routing
Routing is the process of selecting paths in a network along which to send network traffic. Routing is performed for many kinds of networks, including the telephone network, electronic data networks (such as the Internet), and transportation networks. This article is concerned primarily with routing in electronic data networks using packet switching technology.
more from Wikipedia