ADAMA SCIENCE AND TECHNOLOGY UNIVERSITY
SCHOOL OF ELECTRICAL AND ENGINEERING AND
COMPUTING
Department of Computer Science and Engineering
Chapter 5
Mobility QOS and
Location Management
Quality of Service (QoS)
Quality of service (QoS) is the use of mechanisms or
technologies that work on a network to control traffic and
ensure the performance of critical applications with limited
network capacity
A QoS parameter is associated with each service request
primitive received at an Network Service Access Point
(NSAP).
This is a set of parameters that collectively specify the
performance of the network service that the network service
user expects the network provider in relation this request.
In addition, QoS is also used to specify the optional services
to be used with this request.
The QoS may vary from one network to another.
Introduction and Classification
of routing algorithms
Routing – main function of network layer
Routing algorithm
decides which output line incoming packet should be
transmitted on fills up and updates routing tables
Forwarding
look up the routing tables and put the packet in the
appropriate output line
In connection-oriented service, the routing algorithm is
performed only during connection setup
In connectionless service, the routing algorithm is performed as
each packet arrives
Desired Properties
Correctness
Simplicity
Robustness: ability to handle failures
Stability: converge to equilibrium
Fairness
Optimality
Types of routing algorithms
Non-adaptive/static routing
routing decisions not based on traffic, topology, current
state of the network.
routes are computed in advance
Adaptive routing
Change their decisions to reflect changes in the topology
and traffic
Differ in: information source, update frequency and
optimization metrics
Hierarchical Routing is used to make these algorithms scale
to large networks
Types of routing algorithms
Non-adaptive/static routing
Examples:
Shortest Path Routing
Flooding
Shortest Path Routing
Build a graph of network
Each node represent a router
Each arc represent a link
Find shortest path between the two nodes
Types of routing algorithms
Non-adaptive/static routing
Shortest Path Routing
Build a graph of network
Each node represent a router
Each arc represent a link
Find shortest path between the two nodes
For a pair of communicating hosts, there is a shortest
path between them
Shortness may be defined by:
number of hops
geographic distance
mean queuing/transmission delay
bandwidth
cost
Types of routing algorithms
Adaptive Routing Algorithms
Problems with non-adaptive algorithms
If traffic levels in different parts of the subnet change
dramatically and often, nonadaptive routing algorithms are
unable to cope with these changes
Lots of computer traffic is bursty, but nonadaptive routing
algorithms are usually based on average traffic conditions
Adaptive routing algorithms can deal with these situations
Examples:
Distance Vector Routing
original ARPA net routing scheme, often called RIP (route
information protocol)
Link State Routing
base for the current Internet routing algorithm
Location Management
Location Management is the process to determine the
current location of a mobile terminal
In a PCS (Personal Communications Service) system, the
location of a called portable must be determined before the
connection can be established.
In a mobile networks, the location of the terminal can not
be deduced from its endpoint address, like in a wired
networks.
Additional addressing schemes and protocols are needed to
locate and track mobile terminals.
Handoff of connections happens in mobile networks: losses
& QoS guaranteed
Location Management
Location management can be divided into two different services:
Mobile tracking: to keep track of the current location of the
mobile terminal.
Mobile locating: to find the current location of the mobile
node for the delivery of an incoming call.
In a wireless communications system, mobile users are located in
system-defined zones that correspond to bounded geographical
areas.
Location Management: managing the information required to locate
wireless users who move from zone to zone.
End-device identifier:
endpoint identifier
location identifier
Location Management
Components in the Location Management
1. Location server:
maintain the location of all the nodes in the group.
2. Mobile Access Point:
provide a point of attachment to the network for
the mobile nodes and routing capability.
3. Mobile Node:
can be connected into network via MAP, no
routing capability.
4. System Manager:
manage the network
Location Management:Mobile tracking
Two possible scenarios in mobile tracking:
When start-up, the remote node has to register itself.
When handoff, the remote node has to update its
current attachment point.
Location Management:Mobile tracking
T its current attachment point.
Location Management:Mobile locating
To find out the current attachment point of a mobile node to
begin a session to it.
Important issues in Location
Management
Trade-off in Location Management:
lookup (locating) vs. update (tracking)
Efficient Location Management
profile replication or caching
Data Management
Different approaches
Trade-off in location management
Node information update effort
when a node moves … …
keep track of the mobile node
Node finding effort
locate the node when setup connection
route to the destination
Efficient Location Management
Message traffic due to the find and registration operations
is significant.
User profile lookup occurs in any call
To access the caller’s profile for authentication
To access the callee’s profile for location information
and connection status.
User profile update occurs:
to signal user equipment activation or deactivation
to signal user call connection or register user
movement.
Efficient Location Management
Granularity based location management
Profile Replication or caching:
caching: the accuracy of the data.
replication: keeps all copies up-to-date, no
invalidation problem.
Load balancing in Location-Information Databases (LIDs)
Granularity based location management
Hierarchical location management
Fine grained approach:
the network is divided into clusters
each cluster consists of a number of base stations and
a location server
Coarse grained approach:
a global view of the location of the mobile node is
maintained.
The location server maintains the information about
the cluster in which the mobile node is residing.
Hierarchical profile Replication
To reduce the latency of profile lookup at the expense of
increased update and storage cost.
Selectively replicating user profile, based the locality
exploited from user calling and mobility patterns.
Propagate the updates to each profile replica
Adaptive location management strategy
for mobile IP
Call-to-Mobility ratio: the relative frequency of searches as
compared to updates
How the overall costs of location management can be
reduced?
Basic triangle routing: high call-to-mobility ratio
Static update scheme: low call-tomobility
Working Set of Hosts for Mobile Host (MH)
the set of hosts that a given MH communicates most
frequently with is very small (locality)
Limitation:
For mobile IP
how about in PCS system?...
Dynamic approach to location management
Reduce the location updates: reduce the communication
overhead.
Distribute location information among location servers •
Share the responsibility of location tracking among
location servers equally.
The distribution of Mobile Host (MH) varies with
time.
Location of some MHs are queries more often than
others •
Replicate location information
Dynamic approach to location management
The location servers storing the location information of an
MH is a function of the identities of the MH and the cell in
which that MH is present.
Location server changes while MH moving
MHs in the same cell need not have the same set of
location servers.
A greater number of location servers should maintain
location information about hot MHs, fewer for cold MHs.
Performance of Location Management
Performance Metrics:
Signaling load:
exchange of a number of messages.
Time to locate the current attachment point of a
mobile node.
Scalability:
when the number of nodes and traffic generated in
the system increase.
Performance is a function of:
The underlying database architecture
location management algorithm
Reference
1. Handoff and Location Management in Mobile ATM Networks, A. Acharya,
S. Biswas, L. French, J. Li, and D. Raychaudhuri,
[Link]
2. An Adaptive Location Management Strategy for Mobile IP ;
[Link], B. Badrinath, Bellcore, Rutgers [Link]
[Link]/bibl/ps/[Link]
3. A Dynamic Approach to Location Management in Mobile Computing
Systems; R. Prakash, M./ Singal, Ohio State [Link]
[Link]/bibl/ps/[Link]
4. Combining Location and Data Management in an Environment for Total
Mobility; Wachowicz, Hild, Cambridge,
[Link]
5. J. Jannink, D. Lam, N. Shivakumar, J. Widom, and D.C. Cox. Efficient and
Flexible Location Management Techniques for Wireless Communication
Systems. ACM/Baltzer Journal of Wireless Networks, 3(5):361-374, 1997.
[Link]
Thank you
