Network modelling and computation of quickest path for service-level agreements using bi-objective optimization

This article addresses the problem related to the reliability of path after transmitting the given amount of data with the service-level agreement cooperation in the computer communication network. The links have associated with service performance factor parameter during the data transmission, and each node is associated with the requested service performance factor. In this article, first we have considered the single objective to minimize the transmission time of the quickest path problem. An algorithm for quickest path problem has been proposed for results, and furthermore, its time complexity has been shown. The problem has been extended with bi-objective optimization of the quickest path problem, which minimizes the transmission time and hybrid logarithmic reliability. An algorithm is proposed for getting the number of efficient solutions for the quickest path problem using label-correcting algorithm. The algorithms are implemented and tested on different standard benchmark network problems provided with the set of Pareto front of the results.

[1]  Yi-Kuei Lin,et al.  Optimal Pair of Minimal Paths Under Both Time and Budget Constraints , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[2]  Yuefeng Ji,et al.  Experimental demonstration of multi-dimensional resources integration for service provisioning in cloud radio over fiber network , 2016, Scientific Reports.

[3]  James Evans,et al.  Optimization algorithms for networks and graphs , 1992 .

[4]  Jonas Johansson,et al.  A bi-objective formulation for robust defense strategies in multi-commodity networks , 2018, Reliab. Eng. Syst. Saf..

[5]  Jean-Chrysotome Bolot.  End-to-end packet delay and loss behavior in the internet , 1993, SIGCOMM 1993.

[6]  A. Shamsai,et al.  Multi-objective Optimization , 2017, Encyclopedia of Machine Learning and Data Mining.

[7]  Antonio Sedeño-Noda,et al.  Fast and fine quickest path algorithm , 2014, Eur. J. Oper. Res..

[8]  Fabrizio Lombardi,et al.  Approximate reliability of multi-state two-terminal networks by stochastic analysis , 2017, IET Networks.

[9]  Michel Minoux,et al.  A compact optimization model for the tail assignment problem , 2018, Eur. J. Oper. Res..

[10]  João C. N. Clímaco,et al.  Internet packet routing: Application of a K , 2007, Eur. J. Oper. Res..

[11]  Michael H. Moore.  On the Fastest Route for Convoy-Type Traffic in Flowrate-Constrained Networks , 1976 .

[12]  Keqin Li,et al.  Minimizing Redundancy to Satisfy Reliability Requirement for a Parallel Application on Heterogeneous Service-Oriented Systems , 2020, IEEE Transactions on Services Computing.

[13]  Hong Kam Lo,et al.  Capacity reliability of a road network: an assessment methodology and numerical results , 2002 .

[14]  Piet Van Mieghem,et al.  Concepts of exact QoS routing algorithms , 2004, IEEE/ACM Transactions on Networking.

[15]  Herminia I. Calvete,et al.  Dealing with residual energy when transmitting data in energy-constrained capacitated networks , 2018, Eur. J. Oper. Res..

[16]  Marie Schmidt,et al.  Optimization Approaches for the Traveling Salesman Problem with Drone , 2016, Transp. Sci..

[17]  Heiko Ludwig,et al.  The WSLA Framework: Specifying and Monitoring Service Level Agreements for Web Services , 2003, Journal of Network and Systems Management.

[18]  Gen-Huey Chen,et al.  On the Quickest Path Problem , 1990, Inf. Process. Lett..

[19]  Gen-Huey Chen,et al.  Algorithms for the constrained quickest path problem and the enumeration of quickest paths , 1994, Comput. Oper. Res..

[20]  Min Wen,et al.  Full-shipload tramp ship routing and scheduling with variable speeds , 2016, Comput. Oper. Res..

[21]  Yuefeng Ji,et al.  CSO: cross stratum optimization for optical as a service , 2015, IEEE Communications Magazine.

[22]  Blas Pelegrín,et al.  On the sum-max bicriterion path problem , 1998, Comput. Oper. Res..

[23]  Olasupo Ajayi,et al.  Cloud Service Level Agreements – Issues and Development , 2017, 2017 International Conference on Next Generation Computing and Information Systems (ICNGCIS).

[24]  Emmanouil E. Zachariadis,et al.  The Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and Two-Dimensional Loading Constraints , 2016, Eur. J. Oper. Res..

[25]  Y. L. Chen,et al.  Finding the k Quickset Simple Paths in a Network , 1994, Inf. Process. Lett..

[26]  Mir Saman Pishvaee,et al.  A Vehicle Routing Problem for Modeling Home Healthcare: a Case Study , 2018 .

[27]  Xin-She Yang,et al.  An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems , 2016, Eng. Appl. Artif. Intell..

[28]  Bjarne E. Helvik,et al.  The cost for meeting SLA dependability requirements; implications for customers and providers , 2016, Reliab. Eng. Syst. Saf..

[29]  Soondal Park,et al.  A label-setting algorithm for finding a quickest path , 2004, Comput. Oper. Res..

[30]  Rajiv Kumar,et al.  A framework for continuity of mission-critical network services , 2015, 2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS).

[31]  Yi-Kuei Lin,et al.  Evaluate the system reliability for a manufacturing network with reworking actions , 2012, Reliab. Eng. Syst. Saf..

[32]  Marta M. B. Pascoal,et al.  Computational experiments with a lazy version of a K quickest simple path ranking algorithm , 2007 .

[33]  Herminia I. Calvete,et al.  The energy-constrained quickest path problem , 2016, Optimization Letters.

[34]  Carl Eklund,et al.  Quality of service support in IEEE 802.16 networks , 2006, IEEE Network.

[35]  Yi-Kuei Lin,et al.  Project Reliability Interval for a Stochastic Project Network Subject to Time and Budget Constraints , 2017, IEEE Transactions on Reliability.

[36]  Yi-Kuei Lin,et al.  Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network , 2003, Comput. Oper. Res..

[37]  Saman Hassanzadeh Amin,et al.  A possibilistic solution to configure a battery closed-loop supply chain: Multi-objective approach , 2018, Expert Syst. Appl..

[38]  Ashutosh Sharma,et al.  A Framework for Pre-computated Multi-Constrained Quickest QoS Path Algorithm , 2017 .

[39]  I. Y. Kim,et al.  Adaptive weighted-sum method for bi-objective optimization: Pareto front generation , 2005 .

[40]  Y. H. Chin,et al.  The quickest path problem , 1990, Comput. Oper. Res..

[41]  D. Goderis,et al.  Service level agreements: a main challenge for next generation networks , 2002, 2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563).

[42]  Jean-Chrysostome Bolot,et al.  End-to-end packet delay and loss behavior in the internet , 1993, SIGCOMM '93.

[43]  Soheyl Khalilpourazari,et al.  Bi-objective emergency blood supply chain network design in earthquake considering earthquake magnitude: a comprehensive study with real world application , 2019, Ann. Oper. Res..

[44]  Krishna Gopal and Rajiv Kumar,et al.  An Algorithm for Computing the Best-Performing Path in a Computer Network , 2007 .

[45]  Christos A. Kontovas,et al.  A multiple ship routing and speed optimization problem under time, cost and environmental objectives , 2017 .

[46]  Halife Kodaz,et al.  A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem , 2015, Appl. Soft Comput..

[47]  Guoliang Xue,et al.  End-to-end data paths: quickest or most reliable? , 1998, IEEE Commun. Lett..

[48]  Yiwei Thomas Hou,et al.  Service overlay networks: SLAs, QoS, and bandwidth provisioning , 2003, TNET.

[49]  Wei-Chang Yeh,et al.  An efficient alternative to the exact evaluation of the quickest path flow network reliability problem , 2016, Comput. Oper. Res..

[50]  Dung-Ying Lin,et al.  Ship routing and freight assignment problem for liner shipping: Application to the Northern Sea Route planning problem , 2018 .

[51]  H. W. Hamacher,et al.  Mathematical Modelling of Evacuation Problems: A State of Art , 2001 .

[52]  J. Ben Rosen,et al.  Algorithms for the quickest path problem and the enumeration of quickest paths , 1991, Comput. Oper. Res..

[53]  Ernesto de Queirós Vieira Martins,et al.  An algorithm for the quickest path problem , 1997, Oper. Res. Lett..

[54]  Herminia I. Calvete,et al.  Algorithms for the quickest path problem and the reliable quickest path problem , 2012, Comput. Manag. Sci..

[55]  Matthias Ehrgott,et al.  A comparison of solution strategies for biobjective shortest path problems , 2009, Comput. Oper. Res..

[56]  Stefan Ruzika,et al.  Reliable and Restricted Quickest Path Problems , 2011, INOC.

[57]  Andrea Raith,et al.  A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem , 2015, Comput. Oper. Res..

[58]  Lean Yu,et al.  Fuzzy Optimal Allocation Model for Task–Resource Assignment Problem in a Collaborative Logistics Network , 2019, IEEE Transactions on Fuzzy Systems.

[59]  Yi-Kuei Lin,et al.  Reliability evaluation of a multistate flight network under time and stopover constraints , 2018, Comput. Ind. Eng..