Handover Cost Optimization in Traffic Management for Multi-homed Mobile Networks

• Published in: Ubiquitous Intelligence and Computing pp. 295 - 308
• Main Authors: Wang, Shupeng, Wang, Jianping, Yang, Mei, Yun, Xiaochun, Jiang, Yingtao
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: Bandwidth Demand; Heuristic Algorithm; Mobile Network; Node Versus; Wireless Access Network
• ISBN: 9783540735489; 3540735488
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-540-73549-6_30

In this paper, we study the traffic management problem for multi-homed mobile networks with the objective of minimizing the overall handover cost. Two different traffic distribution modes are considered in our study: the Fractional Flow Assignment (FFA) mode which assumes the bandwidth demand from one connection is infinitely splittable and can be assigned to different wireless access networks, and the Integral Flow Assignment (IFA) mode which assumes that at any time the bandwidth demand from each connection can only be assigned to a single wireless network. We show that the general FFA problem and the IFA problem are both NP-hard and propose optimal solutions to the four special cases of the FFA problem and heuristic solutions to the general FFA problem and the IFA problem. Extensive simulations are conducted to verify the impact of the capacity-demand ratio on the performance of the proposed solutions.