An approach for dynamically load balanced flow scheduling(DLBS) in cloud

  • Authors

    • Mrs. A. Sheela
    • Mrs. J. Ranjani
    2018-06-08
    https://doi.org/10.14419/ijet.v7i2.33.14844
  • DLBS, Datacentres, LOBUS
  • Abstract

    The Paper based on load balanced flow scheduling algorithm. This algorithm is used in which huge amount of data send to multiple servers frequently without a few traffic, isolation in open flow network. In existing load balanced algorithm based on huge amount of data send to several server but it suffers from that that algorithm is not support to other open flow networks model and transmission pattern. In this proposed load balanced scheduled algorithm with Round Robin deals with maximizing the network throughput dynamically. The (Dynamically Load Balanced Flow Scheduling) DLBS problem is formulated , considerably a efficient heuristic scheduling algorithms was developed for the two typical Open Flow network model, they have data flow from time slot. The outcome represents load-balanced scheduling algorithms Round Robin and LOBUS with effective improvement in DLBS move toward will carry to the data centers. Plenty of researchers pay large number of attention on software-deï¬ned networking.

     

     
     
  • References

    1. [1] X. Han, J. Li, D. Yang et al., Efï¬cient Skyline Computation on Big Data, IEEE Transactions on Knowledge and Data Engineering, Vol.25, No.11, 2013, pp.2521-2535.

      [2] A. G. Erdman, D. F. Keefe, R. Schiestl, Grand Challenge: Applying Regulatory Science and Big Data to Improve Medical Device Innovation, IEEE Transactions on Biomedical Engineering, Vol.60, No.3, 2013, pp.700-706.

      [3] K. Greene, TR10: Software-Deï¬ned Networking, MIT Technology Review, Retrieved

  • Downloads

  • How to Cite

    A. Sheela, M., & J. Ranjani, M. (2018). An approach for dynamically load balanced flow scheduling(DLBS) in cloud. International Journal of Engineering & Technology, 7(2.33), 600-602. https://doi.org/10.14419/ijet.v7i2.33.14844

    Received date: 2018-06-30

    Accepted date: 2018-06-30

    Published date: 2018-06-08