Adaptive Ant Colony Algorithm Researching in Cloud Computing Routing Resource Scheduling

Zhi-gao Chen ()
Additional contact information
Zhi-gao Chen: Hu Nan vocational institute of science and technology

Chapter Chapter 11 in The 19th International Conference on Industrial Engineering and Engineering Management, 2013, pp 101-108 from Springer

Abstract: 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.

Keywords: Ant colony algorithm; Cloud computing; Pheromone (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-38391-5_11

Ordering information: This item can be ordered from
http://www.springer.com/9783642383915

DOI: 10.1007/978-3-642-38391-5_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().