Abstract
Airline companies are currently investigating means to improve in-flight services for passengers. Given emerging Air-to-Ground (A2G) communication technologies and the high desire of passengers for in-flight services, the servers providing in-flight services can be moved from the airplane to Data Centers (DCs) on the ground. In this scenario, network nodes (airplanes) demanding network services move over a ground core network. Therefore, the selection of DCs to connect to, as well as the underlying routing decisions are challenging. In particular, to keep a low-delay in-flight connection during the flight, airplanes connections can be reconfigured from a DC to another one, which comes at a delay cost. This paper presents a formal model for the in-flight service provisioning problem, also as an Integer Linear Program (ILP). We show that the problem is NP-hard and hence propose an efficient online heuristic, HOMA, which addresses the above challenges in polynomial time. HOMA models the problem as a dynamic matching with special properties, and then efficiently solves it by a transformation into the shortest-path routing problem. Our simulation results indicate that HOMA can achieve near-optimal performance and outperform the baseline and state-of-the-art algorithms by up to 15% while reducing the runtime from hours to seconds.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Network and Service Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
