> but until the ghost of Dijkstra comes out with a > solution, graph theory still tells us that (2) and (3) are > contradictory.
or until some other things change, e.g. - ISPs are willing to route suboptimally (artifically make the graph simpler) - we work out a way to compute routes on-the-fly (caching ones that have been recently used) rather than pre-computing the entire table (this probably implies that we push route computation to the edges and source-route through the core) - we require certain interconnection paths (e.g. requiring major population centers to have a central peering point) in order to make the graph simpler in other words, a substantial change to the routing architecture (heavy technical change) and/or enforced constraints on interconnection (heavy political change) even if we solve the route computation problem, it's hard for me to imagine with forwarding tables containing ~ 2**48 prefixes. Keith -------------------------------------------------------------------- IETF IPng Working Group Mailing List IPng Home Page: http://playground.sun.com/ipng FTP archive: ftp://playground.sun.com/pub/ipng Direct all administrative requests to [EMAIL PROTECTED] --------------------------------------------------------------------
