Lower Bounds for Shortest Path Interval Routing
نویسندگان
چکیده
Interval Routing was introduced to reduce the size of the routing tables: a router nds the direction to forward a message by determining the interval that contains the destination address of the message, each interval being associated to one particular direction. In this paper, we give lower bounds for the minimum number of intervals per edge needed to achieve shortest path routings for the class of 3-regular networks. We prove a tight lower bound of (n) intervals for a 3-regular network of order at most n. Moreover, for the particular case of 3-regular planar networks, we establish a lower bound of (pn) intervals.
منابع مشابه
Worst Case Bounds for Shortest Path Interval Routing
Consider shortest path interval routing a popular memory balanced method for solving the routing problem on arbitrary networks Given a network G let Irs G denote the maximum number of intervals necessary to encode groups of destinations on an edge minimized over all shortest path interval routing schemes on G In this paper we establish tight worst case bounds on Irs G More precisely for any n w...
متن کاملLower Bounds for Interval Routing on BoundedDegree
Interval Routing was introduced to reduce the size of the routing tables: a router nds the direction to forward a message by determining the interval that contains the destination address of the message, each interval being associated to one particular direction. In this paper, we give lower bounds for the minimum number of intervals per edge needed to achieve shortest path routing for the clas...
متن کاملLower Bounds for Interval Routing on 3-Regular Networks
Interval Routing was introduced to reduce the size of the routing tables: a router nds the direction to forward a message by determining the interval that contains the destination address of the message , each interval being associated to one particular direction. In this paper, we give lower bounds for the minimum number of intervals per edge needed to achieve shortest path routing for the cla...
متن کاملThe Complexity of Shortest Path and Dilation Bounded Interval Routing
Interval routing is a popular compact routing method for point-to-point networks which found industrial applications in novel transputer routing technology 13]. Recently much eeort is devoted to relate the eeciency (measured by the dilation or the stretch factor) to space requirements (measured by the compactness or the total number of memory bits) in a variety of compact We add new results in ...
متن کامل