Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1702.07489

SIFM: A network architecture for seamless flow mobility between LTE and WiFi networks - Analysis and Testbed Implementation

Dhathri R. Purohith·Krishna M. Sivalingam
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper deals with cellular (e.g. LTE) networks that selectively offload the mobile data traffic onto WiFi (IEEE 802.11) networks to improve network performance. We propose the Seamless Internetwork Flow Mobility (SIFM) architecture that provides seamless flow-mobility support using concepts of Software Defined Networking (SDN). The SDN paradigm decouples the control and data plane, leading to a centralized network intelligence and state. The SIFM architecture utilizes this aspect of SDN and moves the mobility decisions to a centralized Flow Controller (FC). This provides a global network view while making mobility decisions and also reduces the complexity at the PGW. We implement and evaluate both basic PMIPv6 and the SIFM architectures by incorporating salient LTE and WiFi network features in the ns-3 simulator. Performance experiments validate that seamless mobility is achieved. Also, the SIFM architecture shows an improved network performance when compared to the base PMIPv6 architecture. A proof-of-concept prototype of the SIFM architecture has been implemented on an experimental testbed. The LTE network is emulated by integrating USRP B210x with the OpenLTE eNodeB and OpenLTE EPC. The WiFi network is emulated using hostapd and dnsmasq daemons running on Ubuntu 12.04. An off-the-shelf LG G2 mobile phone running Android 4.2.2 is used as the user equipment. We demonstrate seamless mobility between the LTE network and the WiFi network with the help of ICMP ping and a TCP chat application.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dhathri R. Purohith, Krishna M. Sivalingam. 2017-02-24. SIFM: A network architecture for seamless flow mobility between LTE and WiFi networks - Analysis and Testbed Implementation. https://doi.org/10.1007/s40012-019-00214-1

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI↗
arXiv2026

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI↗
arXiv2026

Pattern-Aware Virtual Network Embedding Optimization for Cloud Data Centers

The network virtualization (NV) technology has enabled the sharing of multiple resources among virtual networks (VNs) in cloud data centers. One of the key challenges is to allocate resources in real-time for virtual network request (VNR), which is known as online virtual network embedding (VNE). However, the existing online VNE methods do not exploit the multi-dimensional complementary relationship among diverse VNRs, resulting in the fragmentation and waste of substrate resources. In this paper, we propose the pattern matching based online VNE approach by constructing appropriate matching rules among observed patterns to maximize resources utilization. We devise the clustering based VNRs quantization method and conduct rigorous study on the pattern combination filtering problem. Then, we utilize the column generation to solve it and construct the pattern matching rules. Based on the rules, we propose an online pattern matching VNE algorithm with linear worst-case complexity. Evaluation on a 106-server testbed using Alibaba production cluster trace dataset shows that our algorithm achieves close-to-offline performance and more accepted workloads that outperforms traditional designs by 25%-30%.

cs.NI↗