Abstract
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.
Highlights
In the computer communication network (CCN), while data transmission occurs across the two specific ends, it takes time to transmit the data, which is the function of the two parameters, that is, delay occurred along the path and the capacity of the path
The results shows that when same values have been applied to the same topology for the service-level agreement cooperative quickest path problem (SLAQPP) simulation, the path P = 1 À 3 À6 À 13 À 14 is the feasible solution for the SLAQPP with the capacity of path c(P) = 34 Mb=s
A theoretical model of BSLAQPP has been introduced which is a variant of quickest path problem (QPP) with the constraints of service-level agreements (SLAs)
Summary
In the computer communication network (CCN), while data transmission occurs across the two specific ends, it takes time to transmit the data, which is the function of the two parameters, that is, delay occurred along the path and the capacity of the path The applicability of these types of problem has been addressed in a number of examples; these types of problem in the networks gained attention by researchers and have been termed as quickest path problem (QPP). The QPP got wide attention by the research communities and, several different polynomial algorithms have been proposed with the same time complexity of O(r(m + nlog(n))), where (r) represents the number of different capacities associated with the networks in previous studies;[5,6,7] it is worth to mention that they do not have same space complexities. Maybe it was the case of a wired network, but practically, still these are associated, and in case of wireless networks, this scenario becomes
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
