1 / 76

CS5214 Spring 2001 Elango Sundaram Jeffery W. Wilson

Agent-Based Forwarding Strategies for Reducing Location Management Cost in Mobile Networks Ing-Ray Chen, Tsong-Min Chen, and Chiang Lee. CS5214 Spring 2001 Elango Sundaram Jeffery W. Wilson. Problem statement.

habib
Télécharger la présentation

CS5214 Spring 2001 Elango Sundaram Jeffery W. Wilson

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Agent-Based Forwarding Strategies for Reducing Location Management Cost in Mobile NetworksIng-Ray Chen, Tsong-Min Chen, and Chiang Lee CS5214Spring 2001 Elango Sundaram Jeffery W. Wilson

  2. Problem statement • For a Personal Communication Service (PCS) network, we desire to minimize the cost of • Mobile user (MU) location updates • Searches in response to a call CS5214

  3. Background • Desire is to reduce communication cost associated with keeping track of MUs • Balance between frequency of incoming calls and MU mobility rate • Two extremes: • High call reception rate, low mobility • Low call reception rate, high mobility CS5214

  4. Location update/search strategies • IS-41 • High Call-to-Mobility Ratio (CMR) • Location cache • Low CMR • Forwarding and resetting algorithm • Alternative location strategy • Two location algorithm (TLA) CS5214

  5. Mobile Communication Network HLR PSTN STP STP V1 V2 V4 V3 V5 V6 PSTN: Public Switched Telephone Network STP: Service Transfer Point HLR: Home Location Register VLR: Visitor Location Register CS5214

  6. Mobile Communication Network HLR PSTN For the basic IS-41 scheme, the MU is permanently registered in the HLR. When a MU moves to a new VLR, the HLR is notified and updated. STP STP V1 V2 V4 V3 V5 V6 PSTN: Public Switched Telephone Network STP: Service Transfer Point HLR: Home Location Register VLR: Visitor Location Register CS5214

  7. Markov models • Three Markov models are built; these are described in later slides • Each state in these Markov models is described by a three-component state description vector (a, b, c) CS5214

  8. State description vector MU movement to new VLR; 0 if no, 1 if yes (a, b, c) MU location table inconsistent with HLR; 0 if no, 1 if yes Call state; 0 if idle, 1 if busy CS5214

  9. TLA • MU and its HLR keep a location table to store two most recently visited VLRs • When MU moves to a VLR which is not one of two most recently visited VLRs, location table in MU unit and HLR are updated CS5214

  10. TLA Algorithm CS5214

  11. Parameters λ Arrival rate of calls to the MU σ Mobility rate of the MU θ Probability of MU moving to previous VLR CMR Call-to-mobility ratio σ1 Mobility rate to new VLR σ2 Mobility rate to previous VLR δ HLR location table update rate μg Rate in locating MU when in consistent state μb Rate in locating MU when in inconsistent state CS5214

  12. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  13. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  14. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 Call arrives δ μb CS5214

  15. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  16. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  17. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  18. Two location algorithm (TLA) δ Call serviced; HLR, MU consistent σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  19. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  20. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  21. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  22. Two location algorithm (TLA) δ Call serviced; HLR, MU tables inconsistent σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  23. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  24. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  25. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  26. Two location algorithm (TLA) MU moves to new VLR δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  27. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  28. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 HLR updated δ μb CS5214

  29. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  30. Two location algorithm (TLA) δ σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ MU moves topreviously-visited VLR;no HLR update required σ2 δ μb CS5214

  31. Two location algorithm (TLA) δ Inconsistent state σ2 σ1 σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 δ σ2 λ λ λ λ μg σ1 σ2 σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 δ σ2 δ μb CS5214

  32. ATLA • Agent based forwarding using locality and access history of MU • HLR points only to one VLR (unlike TLA) • Local agent replaced as MU moves from one VLR to another • When MU moves from local agent to nearby VLR, a Forwarding Pointer is set up CS5214

  33. ATLA Algorithm CS5214

  34. Parameters λ Arrival rate of calls to the MU σ Mobility rate of the MU θ Probability of MU moving to previous VLR CMR Call-to-mobility ratio σ1 Mobility rate to new VLR σ2 Mobility rate to previous VLR δ HLR location table update rate μg Rate in locating MU when in consistent state μb Rate in locating MU when in inconsistent state CS5214

  35. Additional parameters δa HLR location table update rate μa Rate in locating MU when local agent is not current CS5214

  36. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  37. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  38. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 λ λ λ λ μg MU moves fromlocal agent to newsecond VLR σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  39. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  40. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 Update agent’slocal table λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  41. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  42. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  43. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  44. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 MU moves to new VLR (not the agent) λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  45. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  46. Agent-based TLA δ Update HLR location table σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  47. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  48. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 MU moves to previously-visited VLR λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  49. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

  50. Agent-based TLA δ σ2 σ1 δa σ1 0, 0, 0 0, 1, 0 0, 0, 1 0, 1, 1 σ2 λ λ λ λ μg σ2 σ1 δa σ1 1, 0, 0 1, 1, 0 1, 0, 1 1, 1, 1 σ2 δ μa CS5214

More Related