Skip to main content
SpringerLink
Log in

Pathfinder: Application-Aware Distributed Path Computation in Clouds

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

Path computation in a network is dependent on the network’s processes and resource usage pattern. While distributed traffic control methods improve the scalability of a system, their topology and link state conditions may influence the sub-optimal path computation. Herein, we present Pathfinder, an application-aware distributed path computation model. The proposed model framework can improve path computation functions through software-defined network controls. In the paper, we first analyse the key issues in distributed path computation functions and then present Pathfinder’s system architecture, followed by its design principles and orchestration environment. Furthermore, we evaluate our system’s performance by comparing it with FreeFlow and Prune-Dijk techniques. Our results demonstrate that Pathfinder outperforms these two techniques and delivers significant improvement in the system’s resource utilisation behaviour.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Armbrust, M., Fox, A., Griffith, R., Joseph, A.D., Katz, R., Konwinski, A., Lee, G., Patterson, D., Rabkin, A., Stoica, I., Zaharia, M.: A view of cloud computing. Commun. ACM 53(4), 50–58 (2010)

    Article  Google Scholar 

  2. Drepper, U.: The cost of virtualization. ACM Queue 6(1), 28–35 (2008)

    Article  Google Scholar 

  3. Greenberg, A., Hamilton, J.R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D.A., Patel, P., Sengupta, S.: Vl2: a scalable and flexible data center network. ACM SIGCOMM Comput. Commun. Rev. 39(4), 51–62 (2009)

    Article  Google Scholar 

  4. Shue, D., Freedman, M.J., Shaikh, A.: Performance isolation and fairness for multi-tenant cloud storage. In: Proceedings of 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI’12), pp. 349–362 (2012)

  5. Battré, D., Frejnik, N., Goel, S., Kao, O., Warneke, D.: Evaluation of network topology inference in opaque compute clouds through end-to-end measurements. In: Proceedings of 2011 IEEE International Conference on Cloud Computing (CLOUD’11), pp. 17–24 (2011)

  6. Ray, S., Guérin, R., Sofia, R.: Distributed path computation without transient loops: an intermediate variables approach. In: Lorne, M., Tadeusz, D., James, Y. (eds.) Managing Traffic Performance in Converged Networks, pp. 104–116. Springer, Berlin, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Leonardi, E., Mellia, M., Marsan, M.A., Neri, F.: Optimal scheduling and routing for maximum network throughput. IEEE/ACM Trans. Netwo. 15(6), 1541–1554 (2007)

    Article  Google Scholar 

  8. Qin, P., Dai, B., Huang, B., Xu, G., Wu, K.: A survey on network tomography with network coding. IEEE Commun. Surv. Tutor. 16(4), 1981–1995 (2014)

    Article  Google Scholar 

  9. Kim, H., Feamster, N.: Improving network management with software defined networking. IEEE Commun. Mag. 51(2), 114–119 (2013)

    Article  Google Scholar 

  10. Abbasi, A.A., Jin, H., Wu, S.: A software-defined cloud resource management framework. In: Lina, Y., Xia, X., Qingchen, Z., Laurence, T.Y., Albert, Y.Z., Hai, J. (eds.) Advances in Services Computing, pp. 61–75. Springer International Publishing AG, Switzerland (2015)

    Chapter  Google Scholar 

  11. Ni, J., Xie, H., Tatikonda, S., Yang, Y.R.: Efficient and dynamic routing topology inference from end-to-end measurements. IEEE/ACM Trans. Netw. 18(1), 123–135 (2010)

    Article  Google Scholar 

  12. Wei, W., Wang, B., Towsley, D., Kurose, J.: Model-based identification of dominant congested links. IEEE/ACM Trans. Netw. 19(2), 456–469 (2011)

    Article  Google Scholar 

  13. Ni, J., Tatikonda, S.: Network tomography based on additive metrics. IEEE Trans. Inf. Theory 57(12), 7798–7809 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  14. Zhao, Y., Chen, Y., Bindel, D.: Towards unbiased end-to-end network diagnosis. IEEE/ACM Trans. Netw. 17(6), 1724–1737 (2009)

    Article  Google Scholar 

  15. Jesus, V., Aguiar, R.L., Steenkiste, P.: Topological implications of cascading interdomain bilateral traffic agreements. IEEE J. Sel. Areas Commun. 29(9), 1848–1862 (2011)

    Article  Google Scholar 

  16. Snoeren, A.C., Raghavan, B.: Decoupling policy from mechanism in internet routing. ACM SIGCOMM Comput. Commun. Rev. 34(1), 81–86 (2004)

    Article  Google Scholar 

  17. Krishnamurthy, B., Willinger, W., Gill, P., Arlitt, M.: A socratic method for validation of measurement-based networking research. Comput. Commun. 34(1), 43–53 (2011)

    Article  Google Scholar 

  18. Bestavros, A., Byers, J.W., Harfoush, K.A.: Inference and labeling of metric-induced network topologies. IEEE Trans. Parallel Distrib. Syst. 16(11), 1053–1065 (2005)

    Article  Google Scholar 

  19. Liu, H., Bouillet, E., Pendarakis, D., Komaee, N., Labourdette, J.-F., Chaudhuri, S.: Distributed route computation and provisioning in shared mesh optical networks. IEEE J. Sel. Areas Commun. 22(9), 1626–1639 (2004)

    Article  Google Scholar 

  20. Zhao, L., Lai, Y.-C., Park, K., Ye, N.: Onset of traffic congestion in complex networks. Phys. Rev. E 71(2), 026125 (2005)

    Article  Google Scholar 

  21. Liu, G., Ramakrishnan, K.: A* prune: an algorithm for finding k shortest paths subject to multiple constraints. In: Proceedings of the Twentieth IEEE Annual Joint Conference of the Computer and Communications Societies (INFOCOM’01), vol. 2, pp. 743–749 (2001)

  22. Sama, M.R., Contreras, L.M., Kaippallimalil, J., Akiyoshi, I., Qian, H., Ni, H.: Software-defined control of the virtualized mobile packet core. IEEE Commun. Mag. 53(2), 107–115 (2015)

    Article  Google Scholar 

Download references

Acknowledgments

We thank Xinyu Zhao and Hao Fan for their feedback on data loads. This research is supported by National Science Foundation of China under Grant No. 61232008, National 863 Hi-Tech Research and Development Program under Grant No. 2015AA01A203 and the Fundamental Research Funds for the Central Universities under Grant HUST: 2016YXZD016.

Author information

Authors and Affiliations

  1. Services Computing Technology and System Lab, Cluster and Grid Computing Lab, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, 430074, China

    Hai Jin, Aaqif Afzaal Abbasi & Song Wu

Authors
  1. Hai Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aaqif Afzaal Abbasi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Song Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aaqif Afzaal Abbasi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jin, H., Abbasi, A.A. & Wu, S. Pathfinder: Application-Aware Distributed Path Computation in Clouds. Int J Parallel Prog 45, 1273–1284 (2017). https://doi.org/10.1007/s10766-016-0469-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10766-016-0469-7

Keywords

Search

Navigation