Sciweavers

370 search results - page 10 / 74
» Balanced Routing
Sort
View
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 8 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
WCNC
2008
IEEE
14 years 1 months ago
Arbutus: Network-Layer Load Balancing for Wireless Sensor Networks
—The hot spot problem is a typical byproduct of the many-to-one traffic pattern that characterizes most wireless sensor networks: the nodes with the best channel to the sink are ...
Daniele Puccinelli, Martin Haenggi
FPL
2006
Springer
161views Hardware» more  FPL 2006»
13 years 11 months ago
Predictive Load Balancing for Interconnected FPGAs
A Field Programmable Gate Array (FPGA), when used as a platform for implementing special-purpose computing architectures, offers the potential for increased functional parallelism...
Jason D. Bakos, Charles L. Cathey, Allen Michalski
ICDCSW
2005
IEEE
14 years 29 days ago
Using a Fairness Monitoring Service to Improve Load-Balancing in DSR
Many routing protocols for MANETs do not promote a balanced use of resources among the participating nodes, since they are designed to optimize other criteria, such as the number ...
Hugo Miranda, Luís Rodrigues
WINE
2005
Springer
118views Economy» more  WINE 2005»
14 years 25 days ago
Nash Equilibria and Dominant Strategies in Routing
Nash equilibria and dominant strategies are two of the major approaches to deal with selfishness in an automated system (AS), where each agent is a selfish entity. In this paper,...
Weizhao Wang, Xiang-Yang Li, Xiaowen Chu