On Two-label Interval Routing
نویسنده
چکیده
We prove a lower bound of 32D for the longest path in arbitrary graphs that use two-label interval routing (2-IRS) as the routing method, where D is the diameter of the graph.
منابع مشابه
Two Lower Bounds for Multi-Label Interval Routing
Interval routing is a space-efficient method for point-to-point networks. The method has been incorporated in the design of a commercially available routing chip [7], and is a basic element in some compact routing methods (e.g., [4]). With up to one interval label per edge, the method has been shown to be nonoptimal for arbitrary graphs [9, 13], where optimality is measured in terms of the long...
متن کاملLinear Interval Routing
We study a variant of Interval Routing SK85, LT86] where the routing range associated with every link is represented by a linear (i.e., contiguous) interval with no wrap around. This kind of routing schemes arises naturally in the study of dynamic Preex Routing BLT90]. Linear Interval Routing schemes are precisely the Preex Routing schemes that use an alphabet of one symbol. We characterize the...
متن کاملOrdered Interval Routing
An Interval Routing Scheme (IRS) represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with disjoint subintervals of these addresses. An IRS that has at most k intervals per edge label is called a k-IRS. In this thesis, we propose a new type of interval routing scheme, called an Ordered In...
متن کاملMulti-dimensional Interval Routing Schemes
Routing messages between pairs of nodes is one of the most fundamental tasks in any distributed computing system. An Interval Routing Scheme (IRS) is a well-known, space-eÆcient routing strategy for routing messages in a network. In this scheme, each node of the network is assigned an integer label and each link at each node is labeled with an interval. The interval assigned to a link l at a no...
متن کاملThreshold dominating cliques in random graphs and interval routing
The existence of (shortest-path) interval routing schemes for random graphs that use at most one interval label per edge is an open problem posed in [8]. In this paper, we show that for any random graph G(n, p) with edge probability p > 0.765, there exists an interval routing scheme that uses at most one label per edge and has an additive stretch 1. In doing so, we provide an interesting constr...
متن کامل