If you find a way to select paths in real networks using only virtual data,
we'd all be interested to hear it.
Try draft-guruprasad-addressless-internet-00.txt, and
the ECUMN'2000 paper on which it was based, at
http://affine.watson.ibm.com/tmp/vinet.pdf
The draft doesn't yet mention the log(N) bounds on the routing complexity,
but I did try to explain that real addresses are obviated at all levels.
A detailed comparison of addressing and addressless principles is yet to
be made, hopefully soon in the next revision and/or paper.
-p.