Service Placement in Complex Active Networks

The Information-Centric Network (ICN) is very promising in the area of Complex Active Networks (CANs), where the data-centric approach is useful in reducing the data retrieval latency as well as the network traffic of active networking services. Also, the in-network caching and processing capabilities in ICN limits the massive data access to the data producers and so relaxes the need of continuous E2E connectivity between data producers and data consumers. In this paper, we present an ICN-based architecture in which ICN nodes provide processing/treatment capabilities and caching functions. Service placement algorithms (OPPA and HPPA) in CANs are proposed to choose optimal and near-optimal placement location for ICN nodes. We evaluated the algorithms with respect to several performance metrics and the obtained results show improvement in services consumption latency and network load. Furthermore, we propose a caching strategy that shows to stabilize the network load despite any increase in the number of consumer interests.

[1]  Suyong Eum,et al.  Information-Centric Networking (ICN) Research Challenges , 2016, RFC.

[2]  Ahmed E. Kamal,et al.  Scalable and Cost Efficient Algorithms for Virtual CDN Migration , 2016, 2016 IEEE 41st Conference on Local Computer Networks (LCN).

[3]  Takuya Akiba,et al.  Cut Tree Construction from Massive Graphs , 2016, 2016 IEEE 16th International Conference on Data Mining (ICDM).

[4]  Andrew V. Goldberg,et al.  Cut Tree Algorithms: An Experimental Study , 2001, J. Algorithms.

[5]  Guoqiang Wang,et al.  ICN based Architecture for IoT - Requirements and Challenges , 2015 .

[6]  Gennaro Boggia,et al.  Information-Centric Networking: Evaluation and Security Considerations , 2016, RFC.

[7]  Christian Timmerer,et al.  Adaptive Video Streaming over Information-Centric Networking (ICN) , 2016, RFC.

[8]  Gennaro Boggia,et al.  Information-Centric Networking: Baseline Scenarios , 2015, RFC.

[9]  Yash P. Aneja,et al.  Parametric Min-cuts Analysis in a Network , 2003, Discret. Appl. Math..

[10]  Richard Cole,et al.  A fast algorithm for computing steiner edge connectivity , 2003, STOC '03.

[11]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[12]  Debmalya Panigrahi,et al.  An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs , 2007, STOC '07.

[13]  Lixia Zhang,et al.  Kite: a mobility support scheme for NDN , 2014, ICN '14.

[14]  Dan Gusfield,et al.  Very Simple Methods for All Pairs Network Flow Analysis , 1990, SIAM J. Comput..

[15]  Dorothea Wagner,et al.  Dynamic Gomory-Hu Tree Construction - fast and simple , 2013, ArXiv.

[16]  Kayhan Erciyes,et al.  Complex Networks: An Algorithmic Perspective , 2014 .

[17]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.