Table of Contents Author Guidelines Submit a Manuscript
Journal of Computer Networks and Communications
Volume 2019, Article ID 4109453, 8 pages
https://doi.org/10.1155/2019/4109453
Research Article

A Framework for Risk-Energy Aware Service-Level Agreement Provisioning (RESP) for Computing the Quickest Path

Department of Electronics and Communication, Jaypee University of IT, Solan, India

Correspondence should be addressed to Ashutosh Sharma; moc.liamg@6231hsotuhsaamrahs

Received 31 August 2018; Revised 13 March 2019; Accepted 14 March 2019; Published 6 May 2019

Academic Editor: Juraj Machaj

Copyright © 2019 Ashutosh Sharma and Rajiv Kumar. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. R. Kalmanek, S. Misra, and Y. R. Yang, Guide to Reliable Internet Services and Applications, Springer Science & Business Media, Berlin, Germany, 2010.
  2. L. Norros, I. Norros, M. Liinasuo, and K. Seppänen, “Impact of human operators on communication network dependability,” Cognition, Technology & Work, vol. 15, no. 4, pp. 363–372, 2013. View at Publisher · View at Google Scholar · View at Scopus
  3. A. Arroyo and T. Grisham, Leading Extreme Projects: Strategy, Risk and Resilience in Practice, Taylor & Francis, Abingdon, UK, 2017.
  4. P. E. Heegaard, B. E. Helvik, and V. B. Mendiratta, “Achieving dependability in software-defined networking—a perspective,” in Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling (RNDM), pp. 63–70, Munich, Germany, October 2015.
  5. K. B. Misra, Handbook of Performability Engineering, Springer Science & Business Media, Berlin, Germany, 2008.
  6. Y. L. Chen and Y. H. Chin, “The quickest path problem,” Computers & Operations Research, vol. 17, no. 2, pp. 153–161, 1990. View at Publisher · View at Google Scholar · View at Scopus
  7. E. D. Q. V. Martins and J. L. E. Dos Santos, “An algorithm for the quickest path problem,” Operations Research Letters, vol. 20, no. 4, pp. 195–198, 1997. View at Publisher · View at Google Scholar
  8. J. B. Rosen, S.-Z. Sun, and G.-L. Xue, “Algorithms for the quickest path problem and the enumeration of quickest paths,” Computers & Operations Research, vol. 18, no. 6, pp. 579–584, 1991. View at Publisher · View at Google Scholar · View at Scopus
  9. M. M. B. Pascoal, M. E. V. Captivo, and J. C. N. Clı́maco, “An algorithm for ranking quickest simple paths,” Computers & Operations Research, vol. 32, no. 3, pp. 509–520, 2005. View at Publisher · View at Google Scholar · View at Scopus
  10. M. M. B. Pascoal, M. E. V. Captivo, and J. C. N. Clímaco, “A comprehensive survey on the quickest path problem,” Annals of Operations Research, vol. 147, no. 1, pp. 5–21, 2006. View at Publisher · View at Google Scholar · View at Scopus
  11. M. Pascoal, M. E. Captivo, and J. C. Clímaco, “Computational experiments with a lazy version of a K quickest simple path ranking algorithm,” TOP, vol. 15, no. 2, pp. 372–382, 2007. View at Publisher · View at Google Scholar
  12. S. Ruzika and M. Thiemann, “Min-max quickest path problems,” Networks, vol. 60, no. 4, pp. 253–258, 2012. View at Publisher · View at Google Scholar · View at Scopus
  13. J. Rak, Resilient Routing in Communication Networks, Springer, Berlin, Germany, 2015.
  14. D. Eppstein, “Finding the k shortest paths,” SIAM Journal on Computing, vol. 28, no. 2, pp. 652–673, 1998. View at Publisher · View at Google Scholar · View at Scopus
  15. H. W. Hamacher and S. A. Tjandra, “Mathematical modelling of evacuation problems: a state of art,” in Pedestrian and Evacuation Dynamics, Springer, Berlin, Germany, 2001. View at Google Scholar
  16. P. H. Pathak and R. Dutta, Designing for Network and Service Continuity in Wireless Mesh Networks, Springer Science & Business Media, Berlin, Germany, 2012.
  17. G. Xue, “End-to-end data paths: quickest or most reliable?” IEEE Communications Letters, vol. 2, no. 6, pp. 156–158, 1998. View at Publisher · View at Google Scholar · View at Scopus
  18. S. Tragoudas, “The most reliable data-path transmission,” IEEE Transactions on Reliability, vol. 50, no. 3, pp. 281–285, 2001. View at Publisher · View at Google Scholar · View at Scopus
  19. H. I. Calvete, L. del-Pozo, and J. A. Iranzo, “Algorithms for the quickest path problem and the reliable quickest path problem,” Computational Management Science, vol. 9, no. 2, pp. 255–272, 2012. View at Publisher · View at Google Scholar · View at Scopus
  20. Y.-K. Lin, “Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network,” Computers & Operations Research, vol. 30, no. 4, pp. 567–575, 2003. View at Publisher · View at Google Scholar · View at Scopus
  21. M. Xia, M. Tornatore, C. U. Martel, and B. Mukherjee, “Risk-aware provisioning for optical WDM mesh networks,” IEEE/ACM Transactions on Networking, vol. 19, no. 3, pp. 921–931, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. K. Vajanapoom and D. Tipper, “Risk based incremental survivable network design,” in Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, pp. 1–9, La Rochelle, France, October 2007.
  23. K. Vajanapoom, Risk-Based Survivable Network Design, University of Pittsburgh, Pittsburgh, PA, USA, 2008.
  24. K. Vajanapoom, D. Tipper, and S. Akavipat, “Risk based resilient network design,” Telecommunication Systems, vol. 52, no. 2, pp. 799–811, 2013. View at Publisher · View at Google Scholar · View at Scopus
  25. A. J. Gonzalez and B. E. Helvik, “SLA success probability assessment in networks with correlated failures,” Computer Communications, vol. 36, no. 6, pp. 708–717, 2013. View at Publisher · View at Google Scholar · View at Scopus
  26. P. Chołda and P. Jaglarz, “Optimization/simulation-based risk mitigation in resilient green communication networks,” Journal of Network and Computer Applications, vol. 59, pp. 134–157, 2016. View at Publisher · View at Google Scholar · View at Scopus
  27. P. Chołda and P. Jaglarz, “Energy-efficiency versus resilience: risk awareness view on dimensioning of optical networks with a sleep mode,” Photonic Network Communications, vol. 30, no. 1, pp. 43–58, 2015. View at Publisher · View at Google Scholar · View at Scopus
  28. H. I. Calvete, L. del-Pozo, and J. A. Iranzo, “The energy-constrained quickest path problem,” Optimization Letters, vol. 11, no. 7, pp. 1319–1339, 2017. View at Publisher · View at Google Scholar · View at Scopus
  29. Y. Wu, M. Tornatore, C. U. Martel, and B. Mukherjee, “Green and low-risk content placement in optical content delivery networks,” in Proceedings of the IEEE International Conference on Communications (ICC), pp. 1–6, Kuala Lumpur, Malaysia, May 2016.
  30. S. Ruzika and M. Thiemann, “Reliable and restricted quickest path problems,” in Network Optimization, pp. 309–314, Springer, Berlin, Germany, 2011. View at Google Scholar
  31. T. Gomes and J. Craveirinha, “Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks,” European Journal of Operational Research, vol. 181, no. 3, pp. 1055–1064, 2007. View at Publisher · View at Google Scholar · View at Scopus
  32. J. Chabarek, J. Sommers, P. Barford, C. Estan, D. Tsiang, and S. Wright, “Power awareness in network design and routing,” in Proceedings of the IEEE INFOCOM-The 27th Conference on Computer Communications, pp. 457–465, Phoenix, AZ, USA, April 2008.
  33. N. C. Nguyen, P. Wang, D. Niyato, Y. Wen, and Z. Han, “Resource management in cloud networking using economic analysis and pricing models: a survey,” IEEE Communications Surveys & Tutorials, vol. 19, no. 2, pp. 954–1001, 2017. View at Publisher · View at Google Scholar · View at Scopus
  34. L. Zhang, K. Li, C. Li, and K. Li, “Bi-objective workflow scheduling of the energy consumption and reliability in heterogeneous computing systems,” Information Sciences, vol. 379, pp. 241–256, 2017. View at Publisher · View at Google Scholar · View at Scopus
  35. Y. Liu, H. S. Seah, and G. Shou, “Constrained energy-efficient routing in time-aware road networks,” GeoInformatica, vol. 21, no. 1, pp. 89–117, 2017. View at Publisher · View at Google Scholar · View at Scopus
  36. J. Rak, M. Pickavet, K. S. Trivedi et al., “Future research directions in design of reliable communication systems,” Telecommunication Systems, vol. 60, no. 4, pp. 423–450, 2015. View at Publisher · View at Google Scholar · View at Scopus
  37. Y. Cui, S. Xiao, X. Wang et al., “Performance-aware energy optimization on mobile devices in cellular network,” IEEE Transactions on Mobile Computing, vol. 16, no. 4, pp. 1073–1089, 2017. View at Publisher · View at Google Scholar · View at Scopus
  38. K. Wang, J. Yu, Y. Yu et al., “A survey on energy internet: architecture, approach, and emerging technologies,” IEEE Systems Journal, vol. 12, no. 3, pp. 2403–2416, 2017. View at Publisher · View at Google Scholar · View at Scopus
  39. H. Bast, D. Delling, A. Goldberg et al., “Route planning in transportation networks,” in Algorithm Engineering, pp. 19–80, Springer, Berlin, Germany, 2016. View at Google Scholar
  40. F. Wu, “Integration of software reliability engineering, risk management and safety assurance case,” in Proceedings of the IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW), pp. 169–192, Pasadena, CA, USA, November 2013.
  41. V. Balasubramanian, M. Aloqaily, F. Zaman, and Y. Jararweh, “Exploring computing at the edge: a multi-interface system Architecture enabled mobile device cloud,” in Proceedings of the IEEE 7th International Conference on Cloud Networking (CloudNet), pp. 1–4, Tokyo, Japan, October 2018.
  42. A. Sharma and R. Kumar, “Risk-energy aware service level agreement assessment for computing quickest path in computer networks,” International Journal of Reliability and Safety, vol. 13, no. 1-2, p. 96, 2019. View at Publisher · View at Google Scholar
  43. H. I. Calvete, L. del-Pozo, and J. A. Iranzo, “Dealing with residual energy when transmitting data in energy-constrained capacitated networks,” European Journal of Operational Research, vol. 269, no. 2, pp. 602–620, 2018. View at Publisher · View at Google Scholar · View at Scopus
  44. A. Chen, H. Yang, H. K. Lo, and W. H. Tang, “A capacity related reliability for transportation networks,” Journal of Advanced Transportation, vol. 33, no. 2, pp. 183–200, 1999. View at Publisher · View at Google Scholar · View at Scopus
  45. V. Kounev, M. Lévesque, D. Tipper, and T. Gomes, “Reliable communication networks for smart grid transmission systems,” Journal of Network and Systems Management, vol. 24, no. 3, pp. 629–652, 2016. View at Publisher · View at Google Scholar · View at Scopus
  46. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, MIT Sloan School of Management, Cambridge, MA, USA, 1993.
  47. W.-C. Yeh and M. El Khadiri, “A new universal generating function method for solving the single $(d,\tau) $-quick-path problem in multistate flow networks,” IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, vol. 42, no. 6, pp. 1476–1484, 2012. View at Publisher · View at Google Scholar · View at Scopus
  48. A. Sharma and R. Kumar, “Service-level agreement—energy cooperative quickest ambulance routing for critical healthcare services,” Arabian Journal for Science and Engineering, vol. 44, no. 4, pp. 3831–3848, 2019. View at Publisher · View at Google Scholar
  49. M. L. Fredman and R. E. Tarjan, “Fibonacci heaps and their uses in improved network optimization algorithms,” Journal of the ACM, vol. 34, no. 3, pp. 596–615, 1987. View at Publisher · View at Google Scholar · View at Scopus