next up previous
Next: 4.3 Counterexample to a Up: 4 Counterexamples to on-line Previous: 4.1 Counterexample for routing

4.2 Counterexample for various deterministic strategies

The second example is quite general. It shows that for any deterministic strategy that chooses the order in which packets pass through a switch independent of the future paths of the packets, there is a network and a set of paths with congestion c and dilation d for which the schedule produced has length at least tex2html_wrap_inline2224 . This observation covers strategies such as giving priority to the packet that has spent the most (or least) time waiting in queues, and giving priority to the packet that arrives first at a switch. The network is a complete binary tree of height d-1 with an auxiliary edge from the root to an auxiliary node.

  observation405

Proof: We construct the example for congestion c and dilation d, tex2html_wrap_inline2238 , recursively. The base case is the example tex2html_wrap_inline2240 . Each of the c leaves sends a packet to the auxiliary node, causing congestion c in the auxiliary edge. The network for tex2html_wrap_inline2246 contains c copies of the network for tex2html_wrap_inline2250 , as shown in Figure 9. First, the auxiliary nodes for these copies are paired up and merged so that there are tex2html_wrap_inline2252 auxiliary nodes each with two auxiliary edges into it. Next, the auxiliary nodes become the leaves of a complete binary tree of height tex2html_wrap_inline2254 with its own auxiliary node and edge. For each copy of tex2html_wrap_inline2256 , the deterministic scheduling strategy chooses some packet to cross its auxiliary edge last. We extend the path of this packet so that it traverses the auxiliary edge in tex2html_wrap_inline2258 . The dilation of the new set of paths is d and the congestion c. The length of the schedule, tex2html_wrap_inline2264 , is given by the recurrence

eqnarray409

and has solution tex2html_wrap_inline2266 . Setting tex2html_wrap_inline2268 in this example gives a routing time of tex2html_wrap_inline2270 .


to .667emto .667em

   figure414
Figure 9: Example 2.

The previous example can be modified to show that the strategies of sending the packet with the farthest distance left to go or the packet with the farthest total initial distance to go first can also be made to require tex2html_wrap_inline2272 time. We simply extend the paths of the packets winning at each switch so that they have total (or remaining) distance equal to or greater than the packets that lose at a switch.



next up previous
Next: 4.3 Counterexample to a Up: 4 Counterexamples to on-line Previous: 4.1 Counterexample for routing



Bruce Maggs
Mon Jul 22 20:27:47 EDT 1996