[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[RRG] Re: [rr-fs] names vs. addresses

I think that there are two different ideas being mixed here, both relating to the notion that entities have names independent of their topological location. You describe below research on approaches to routing based on topologically insensitive names. While that is interesting, most folks looking at that problem tend instead to look at as a matter of layering. That is, on one level the communication is in terms of topologically insensitive names (identities), and at another layer communication is in terms of toplogically sensitive names (addresses). Admittedly, this is based on the historically grounded assumption that routing on the basis of topologically sensitive names is more effective. But that does still seem to be a reasonable assumption. 
some of this is explored in the output of the Name Space Resrach Group.

Yours,
Joel

At 08:43 PM 10/7/2005, Dmitri Krioukov wrote:

several people, including vint cerf at the last sigcomm,
talk about differentiating between node names (or IDs)
and node addresses having some topological sense. i'd
like to emphasize that, at least formally, this distinction
is very well understood, formalized, and researched. it
is directly related to what's called name-independent
routing (working with node "names") vs. name-dependent
routing (working with node "addresses").

indeed, by definition (http://arxiv.org/abs/cs.NI/0508021),
name-dependent routing embeds some topological information
in node labels which thus cannot be arbitrary, while routing
that can work on the graphs with arbitrary node labels is
called name-independent. thus, networking terms like "node
name" or "node ID" essentially refers to the name-independent
case, while the term "node address" usually implies a
topologically informative node label, i.e., the name-dependent
case.

even finer classification is considered in http://arxiv.org/abs/cs.DC/9903009
which differentiates the name-dependent case into the two
subcases: node label set is 1...n (case \beta) or completely
arbitrary (case \gamma).
--
dima.
http://www.caida.org/~dima/


_______________________________________________
rr-fs mailing list
rr-fs@caida.org
http://rommie.caida.org/mailman/listinfo/rr-fs



--
to unsubscribe send a message to rrg-request@psg.com with the
word 'unsubscribe' in a single line as the message text body.
archive: <http://psg.com/lists/rrg/> & ftp://psg.com/pub/lists/rrg