### Table 2. Guarantee rewrite matrix

2001

"... In PAGE 7: ... Clearly, the re- verse conversion cannot be performed: a fixed fraction of the CPU over an unspecified time interval is not, in general, equivalent to any particular CPU reservation. Table2 shows which guarantees can be converted into which others using rewrite rules. Characters in the matrix indicate whether the guarantees listed on the left can be con- verted to the guarantees listed on the bottom.... ..."

Cited by 42

### TABLE I SERVICE GUARANTEES.THE GUARANTEES ARE IDENTICAL AT EACH ROUTER.

2002

Cited by 42

### TABLE I SERVICE GUARANTEES.THE GUARANTEES ARE IDENTICAL AT EACH ROUTER.

2002

Cited by 42

### Table 1. Example Guarantees. Example

2001

"... In PAGE 4: ... We name guarantees with a letter G followed by either the initials of the requestor and the guarantor, for ex- ample GBM,orabrief name related to their use, for example GXauth (see tables 4 and 6). We illustrate guarantees with the following (simplified) examples (see Table1 ). Detailed treatment of guarantees outlined in 1 and 2 below appears in subsequent sections.... ..."

Cited by 1

### Table 1 Bounds on the performance guarantee

"... In PAGE 5: ... For instance, in a graph with no cycle longer than 5, the analysis bounds the performance guarantee (when k = 5) by 1:464. Table1 gives lower and upper bounds on the performance guarantee of the algo- rithm for small values of k and in the limit as k ! 1. The lower bounds are shown... In PAGE 10: ... For instance, for c = 3, by following the proof of Theorem 4.1, one can show that this would improve the performance guarantee of Contract-Cyclesk to ck ? 1=36 (for k 4), matching the lower bound in Table1 . (The lower bound given holds for the modi ed algorithm.... ..."

### Table 1: performance guarantees: BV

"... In PAGE 115: ...Table 1: performance guarantees: BV C4CB D1CPDC BPC7C8 CC same machine, then the swap neighborhood is empty; therefore, we define the swap neighborhood as one that consists of all possible jumps and all possible swaps. As can be seen in Table1 , the jump and swap neighborhoods have no constant performance guarantee for C9CZBV D1CPDC . Therefore, we introduce a push neighborhood, for which any local optimum is at most a factor BE A0 BE D1B7BD of optimal for C9CZBV D1CPDC .... In PAGE 115: ... When pushing all jobs on the critical machines is unsuccessful, we are in a push optimal solution. In Table1 the performance guarantees for the various local optima and scheduling problems are given. UB = AQ denotes that AQ is a performance guarantee and LB = AQ denotes that the performance guarantee cannot be less than AQ; AQ denotes that UB = LB = AQ.... In PAGE 121: ...Empty Out-tree To approximate solution 0,079 0,005 Tolower bound 0,115 0,318 Table1 : Average relative errors of approximate solution of algorithm based on y jt -formulation to approximate solution of algorithm based on x jt -formulation and lower bound ( = 1). The graph of precedence constraints Empty Out-tree To approximate solution 0,048 0,001 Tolower bound 0,073 0,309 Table 2: Average relative errors of approximate solution of algorithm based on y jt -formulation to approximate solution of algorithm based on x jt -formulation and lower bound ( =1= p 2).... ..."

### Table1. Delay Guarantees of WFQ Resource scheduled Delay Guarantees

### Table 1. Qualitative Comparison, ( P = Probabilistic guarantee, D = Deterministic guarantee)

"... In PAGE 12: ... We end this section on a general comparative note. Table1 summarizes qualitatively different aspects of the three schemes we studied here. On the space optimality issue, replication is clearly very inefficient compared to the other two.... ..."