Efficient Load Balancing Algorithm Using Complete Graph

LK Dey, D Ghosh, S Bagchi - International Conference on Applied …, 2011 - Springer
For load balancing process in a distributed network consisting of v nodes it requires O (v 2)
communication complexity. Here we present a new synchronous dynamic distributed load …
被引用次数：3 相关文章

Efficient Load Balancing Algorithm Using Complete Graph

LK Dey, D Ghosh, S Bagchi - Applied Informatics and Communication - infona.pl
For load balancing process in a distributed network consisting of v nodes it requires O (v 2)
communication complexity. Here we present a new synchronous dynamic distributed load …

Efficient Load Balancing Algorithm Using Complete Graph

LK Dey, D Ghosh, S Bagchi - Springer
For load balancing process in a distributed network consisting of v nodes it requires O (v2)
communication complexity. Here we present a new synchronous dynamic distributed load …

[引用][C] Efficient Load Balancing Algorithm Using Complete Graph

LK Dey, D Ghosh, S Bagchi - Applied Informatics and Communication, 2011 - Springer