1 / 15

Optimizations for Vertical Handoff Decision Algorithms

Optimizations for Vertical Handoff Decision Algorithms. Fang Zhu and Janise McNair University of Florida. Introduction. Vertical handoff Traditionally handoff based on RSS is not sufficient Monetary cost, network conditions, mobile node conditions, user preferences should be considered

lela
Download Presentation

Optimizations for Vertical Handoff Decision Algorithms

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. Optimizations for Vertical Handoff Decision Algorithms Fang Zhu and Janise McNair University of Florida

  2. Introduction • Vertical handoff • Traditionally handoff based on RSS is not sufficient • Monetary cost, network conditions, mobile node conditions, user preferences should be considered • Contributions • A cost function • A net work elimination process • The optimization cost function (multi-network)

  3. Policy-based v-handoff • RFC2753 • Two main architectural elements • Policy Enforcement Point (PEP) • The point where the policy decisions are actually enforced. • Network-controlled handoff. • Mobile-assisted handoff. • Mobile-controlled handoff. • Policy Decision Point (PDP) • The point where policy decisions are made.

  4. Policy-based v-handoff (cont.) • Three different configurations. Network node Policy DB Network node PDP LPDP PEP PEP Network node Policy DB PEP PDP

  5. Cost function optimization (1) Where Cn is the cost function evaluated for network n. (2) Where s is the index representing the user-requested services, and Csn is the per-service cost function for network n. (3) Where Esn is the network elimination factor for requested service s at network n and Qsn is the QoS factor for service s at network n.

  6. Vertical Handoff Policies • The first policy • arg min(Cn) • Collective handoff • The second policy • Csn • Prioritized multi-network handoff

  7. Vertical Handoff Policies(cont.) Begin with a list of active services Select the service with highest priority Evaluate Csn for each possible target network Handoff to network n based on lowest value of Csn Update resource database Any Unassigned services left? Exit

  8. Performance Analysis Network 3 Network 2 Network 1

  9. Performance Analysis (cont.) • Scenario 1: Collective Handoff

  10. Performance Analysis (cont.) • Scenario 2: Prioritized multi-network handoff

  11. Numerical result • Result for three cases • The traditional handoff • The cost function with collective handoff • The cost function with the prioritized, multi-network optimization

  12. Numerical result (cont.)

  13. Numerical result (cont.)

  14. Numerical result (cont.)

  15. Conclusion • A network elimination feature • Reduce the delay and processing required • A multi-network optimization • Improve throughput for MT with multiple active sessions. • Performance significant gains in QoS

More Related