Version 6 (modified by 13 years ago) ( diff ) | ,
---|
Reference http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=00869208 http://www.cs.berkeley.edu/~kfall/papers/rfn.pdf
What is LANDMARK Routing Landmark Routing has the following features:
- operates efficiently and automatically in networks of large size
- responds to changing network conditions such as topology changes
- provides full name-based addressing
- provides automatic address assignment
- accommodates administrative boundaries, providing control of routing paths, protection, and autonomy
Landmark Router
- A Landmark is a router whose neighbor routers within a certain number of hops contain routing entries for that router.
- LMi refers to a Landmark of hierarchy level i, i=O being the lowest level, and i=H being the highest level.
- LMi[id] refers to a specific LMi, with label id, called the Landmark ID
- ri[id] is a radius of a corresponding LMi[id].
- In the Landmark Hierarchy, every router in a network is a Landmark LM0[id] of some small radius r0[id].
ROUTING
[1]. Routing Table Each router keeps a table of the next hop on the shortest path to each Landmark for which it has routing entries.
[2]. Addressing The address of a router is a series of Landmark IDs of the Landmarks at each hierarchical level which the router is near.
Each Landmark in the address must be within the radius of the Landmark with next lower Landmark ID in the address. E.g. let’s consider a Landmark Address LM2[c].LM1[b].LM0[a]. LM2[c] is called a parent of LM1[b], and LM1[b] is called a child of LM2[c].
[3]. Routing Finding a path from the router Source to the router LM0[a].