期刊名称:International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN:2278-1323
出版年度:2012
卷号:1
期号:3
页码:259-262
出版社:Shri Pannalal Research Institute of Technolgy
摘要:For effective working of peer to peer systems the load balancing is the critical task. To assign the load to a particular node, care should be taken that cost incur to assign the load should be minimized. The problem consists of a number of tasks that are to be assigned to various nodes in the network at the least cost. In this paper we describe an algorithm for load assignment where other approaches resort to randomization. An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant System. It is a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are to the nodes in the network that is inspired by scatter search using ant heuristics. Scatter search contrasts with other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on generalized path constructions in Euclidean space and by utilizing strategic designs.
关键词:Load balance; Scatter search; ; structured peer to peer networks; reference set