TY - JOUR

T1 - Optimal layouts on a chain ATM network

AU - Gerstel, Ornan

AU - Wool, Avishai

AU - Zaks, Shmuel

PY - 1998/3/25

Y1 - 1998/3/25

N2 - We study a routing problem which occurs in high-speed (ATM) networks, termed the "rooted virtual path layout problem" on chain networks. This problem is essentially a tree embedding problem on a chain host graph. We present four performance measures for the quality of such an embedding which have practical implications, and find optimal solutions for each of them. We first show that the search can be restricted to the class of layouts with no crossovers. Given bounds on the load l and number of hops h in a layout, we then present a family of ordered trees T (ℓ, h), within which an optimal solution can be found (if one exists at all); this holds for either the worst-case or average-case measures, and for a chain of length n, with n ≤ (ℓ+hℓ). For the worst-case measures these trees are used in characterizing, constructing, and proving the optimality of the solutions. For each average-case measure, a recursive formulation of the optimal solution is presented, from which an optimal polynomial dynamic programming algorithm is derived. Furthermore, for the unweighted average measures, these formulations are explicitly solved, and the optimal solutions are mapped to T (ℓ, h).

AB - We study a routing problem which occurs in high-speed (ATM) networks, termed the "rooted virtual path layout problem" on chain networks. This problem is essentially a tree embedding problem on a chain host graph. We present four performance measures for the quality of such an embedding which have practical implications, and find optimal solutions for each of them. We first show that the search can be restricted to the class of layouts with no crossovers. Given bounds on the load l and number of hops h in a layout, we then present a family of ordered trees T (ℓ, h), within which an optimal solution can be found (if one exists at all); this holds for either the worst-case or average-case measures, and for a chain of length n, with n ≤ (ℓ+hℓ). For the worst-case measures these trees are used in characterizing, constructing, and proving the optimality of the solutions. For each average-case measure, a recursive formulation of the optimal solution is presented, from which an optimal polynomial dynamic programming algorithm is derived. Furthermore, for the unweighted average measures, these formulations are explicitly solved, and the optimal solutions are mapped to T (ℓ, h).

UR - http://www.scopus.com/inward/record.url?scp=0000248576&partnerID=8YFLogxK

U2 - 10.1016/S0166-218X(98)80002-4

DO - 10.1016/S0166-218X(98)80002-4

M3 - מאמר

AN - SCOPUS:0000248576

VL - 83

SP - 157

EP - 178

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 1-3

ER -