### Table 3: Parameters for endpoint to receive bundles from custody DNT node.

### Table 13: Parameters for endpoint to query APS for information on local DTN nodes.

### Table 4: Parameters for endpoint to notify its former custody DTN node of its migration.

### Table 12: Parameters for endpoint to receive bundles from custody DTN node by proxy through a mobile contact.

### Table 3.2: Possible diagrams J for some arcs J. White nodes correspond to endpoints of arcs having multiplicity one

Cited by 1

### Table 5.1: Algorithm LPE returns a set of node pairs that constitute the endpoints of k-node paths in the input graph. The subgraphs GB and GW represent the black and white subgraphs induced by the current random coloring. Intuitively, we hope that we can detect a k-node path by nding its rst half in GB and its second half in GW recursively. Since the probability for its k nodes to be colored in this fashion is 2 k, it takes about 2k colorings to obtain a constant success probability.

### Table 2: Degrees of endpoints for the ten most con- gested links.

"... In PAGE 9: ... Below, we discuss some further observations. The most congested links have always one endpoint (and very often both) of high degree (see Table2 .) Nodes with high degrees correspond to big providers.... ..."

### Table 2: Degrees of endpoints for the ten most con- gested links.

"... In PAGE 9: ... Below, we discuss some further observations. The most congested links have always one endpoint (and very often both) of high degree (see Table2 .) Nodes with high degrees correspond to big providers.... ..."

### Table 2: Degrees of endpoints for the ten most congested links.

2005

"... In PAGE 42: ... Below, we discuss some further observations. The most congested links have always one endpoint (and very often both) of high degree (see Table2 .) Nodes with high degrees correspond to big providers.... ..."