IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-38391-5_11.html
   My bibliography  Save this book chapter

Adaptive Ant Colony Algorithm Researching in Cloud Computing Routing Resource Scheduling

In: The 19th International Conference on Industrial Engineering and Engineering Management

Author

Listed:
  • Zhi-gao Chen

    (Hu Nan vocational institute of science and technology)

Abstract

Cloud computing has been regarded as one of the most important planning projects in the future, the technique will be beneficial to thousands enterprises in our country. The advantages of Cloud service depend on efficient, fast running network conditions. At present, under the condition of limited bandwidth in our country, studying fast and efficient routing mechanism is necessary, according to which Scheduling resource with the maximum capacity of a network node. Therefore, in this paper, the parameters of network capacity was increased as the threshold in each node to route adaptively, the shortest path can be found quickly on the traditional ant algorithm, and also the network capacity of nodes on the path can be adjusted accordingly. As the experimental result shown, the congestion of data on the critical path can effectively avoid by this method.

Suggested Citation

  • Zhi-gao Chen, 2013. "Adaptive Ant Colony Algorithm Researching in Cloud Computing Routing Resource Scheduling," Springer Books, in: Ershi Qi & Jiang Shen & Runliang Dou (ed.), The 19th International Conference on Industrial Engineering and Engineering Management, edition 127, chapter 0, pages 101-108, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-38391-5_11
    DOI: 10.1007/978-3-642-38391-5_11
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-38391-5_11. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.