An Objective-Driven On-Demand Network Abstraction for Adaptive Applications

• Published in: IEEE/ACM transactions on networking Vol. 27; no. 2; pp. 805 - 818
• Main Authors: Gao, Kai, Xiang, Qiao, Wang, Xin, Yang, Yang Richard, Bi, Jun
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.04.2019; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Bandwidth; Constraint modelling; Demand; Equivalence; IEEE transactions; Lower bounds; Measurement; Network topology; Quality of service; resource abstraction; Routing; routing algebra; Software-defined networking; Topology
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/TNET.2019.2899905

Revealing an abstract view of the network is essential for the new paradigm of developing network-aware adaptive applications that can fully leverage the available computation and storage resources and achieve better business values. In this paper, we introduce ONV, a novel abstraction of flow-based on-demand network view. The ONV models network views as linear constraints on network-related variables in application-layer objective functions, and provides "equivalent" network views that allow applications to achieve the same optimal objectives as if they have the global information. We prove the lower bound for the number of links contained in an equivalent network view, and propose two algorithms to effectively calculate on-demand equivalent network views. We evaluate the efficacy and the efficiency of our algorithms extensively with real-world topologies. Evaluations demonstrate that the ONV can simplify the network up to 80% while maintaining an equivalent view of the network. Even for a large network with more than 25 000 links and a request containing 3000 flows, the result can be effectively computed in less than 1 min on a commodity server.