DiffServ-based bandwidth-constrained anycast routing in a mobile IPv6 network
✍ Scribed by Wu-Hsiao Hsu; Yuh-Pyng Shieh; Sheng-Cheng Yeh
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 316 KB
- Volume
- 24
- Category
- Article
- ISSN
- 1074-5351
- DOI
- 10.1002/dac.1143
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
This paper proposes a differentiated service (DiffServ)‐based bandwidth‐constrained network layer anycast routing for a mobile IPv6 network. The proposed algorithm comprises three steps: (1) When moving into a new foreign network, the mobile node (MN) chooses a feasible path to easily locate the nearest server that can serve it. To perform path selection, a multi‐level list structure (MLLS) is defined and used to store the available bandwidth and hop count of a path. (2) An ingress extended edge router (E‐ER) uses the multi‐level list algorithm (MLLA) to examine the MLLS for selecting the feasible path with the smallest number of hops that satisfies the MN bandwidth request. (3) The E‐ER uses a condition of path change (CPC) variable to determine whether it should optimize the route between itself and the server. Simulation results indicate that the proposed algorithm offers better performance than the existing related approaches in terms of the average running time, request blocking rate, and reducing the control overhead of the simulated network. Copyright © 2010 John Wiley & Sons, Ltd.