proposal: Compact routing in locator identifier mapping system
---------
key idea:
---------
Builds a highly scalable locator identity mapping system using compact
routing principles. Provides means for dynamic topology adaption to
facilitate efficient aggregation. Map servers are assigned as cluster
heads or landmarks based on their capability to aggregate EID
announcements.
gains:
------
Minimizes the routing table sizes in at the system level (= map
servers). Provides clear upper bounds for routing stretch that defines
the packet delivery delay of the map request/first packet.
Organizes the mapping system based EID numbering space, minimizes the
administrative of overhead of managing EID space. No need for
administratively planned hierarchical address allocation as the system
will find convergence into a sets of EID allocations.
Availability and robustness of the overall routing system (including
xTRs and map servers) is improved because potential to use multiple map
servers and direct routes without involvement of map servers.
costs:
------
The scalability gains will materialize only in large deployments. If the
stretch is required to be bound to those of compact routing (worst case
stretch less or equal to 3, on average 1+epsilon) then xTRs need to have
memory/cache for the mappings of its cluster.
full documentation:
-------------------
Sent to the rrg-mailing list 15th of Dec
_______________________________________________
rrg mailing list
[email protected]
http://www.irtf.org/mailman/listinfo/rrg
