40 likes | 194 Views
Hierarchical LR scheme. See my paper with Gopal Dommety on general mobile location management. Register (hierarchy limits level to which this is needed). Register (needed if first appearance at this Level S LD). Cancel. Register. Register. Register. Register. New visiting Switch.
E N D
Hierarchical LR scheme • See my paper with Gopal Dommety on general mobile location management
Register (hierarchy limits level to which this is needed) Register (needed if first appearance at this Level S LD) Cancel Register Register Register Register New visiting Switch Variants of overlay approach: move operation Level S location database S = 1 ... L Level S location database Level L-1 location database Level L-1 location database Level L location database (also home location database) Level L location database Level L location database Level L location database Visiting Switch Home Switch Home location database tracks Sth level location database of mobile
Find Find Find Find Find Variants of overlay approach:find operation Level S location database Level S location database Level L-1 location database Level L-1 location database Level L location database (also home location database) Level L location database Level L location database Level L location database Visiting Switch Home Switch Originating Switch Other Switch Other Switch
Attributes • If S = L, then it means there are only VLRs and HLRs – cellular scheme • If S = 1, then a full tree structure – don’t need concept of home location databases • Tree structure limits registration propagation as well as find propagation • Need to cancel at old sub-tree during move