Handover cost optimization in traffic management for multi-homed mobile networks

Authors:
Shupeng Wang;Jianping Wang;Mei Yang;Xiaochun Yun;Yingtao Jiang
Affiliations:
Institute of Computing Technology, Chinese Academy of Engineering, Beijing, China;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Electrical and Computer Engineering, University of Nevada, Las Vegas, NV;Institute of Computing Technology, Chinese Academy of Engineering, Beijing, China;Department of Electrical and Computer Engineering, University of Nevada, Las Vegas, NV
Venue:
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Year:
2007

Citing 6
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Multiservice Allocation in Hierarchical Cellular Networks (MAHCN)

ISCC '99 Proceedings of the The Fourth IEEE Symposium on Computers and Communications
Multihoming in Nested Mobile Networking

SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
Survey on network mobility support

ACM SIGMOBILE Mobile Computing and Communications Review
Optimizing cost and performance for multihoming

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.