Sciweavers

12301 search results - page 134 / 2461
» Distributed Computation in Dynamic Networks
Sort
View
JACM
2002
107views more  JACM 2002»
15 years 6 months ago
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
In completely symmetric systems that have homogeneous nodes (hosts, computers, or processors) with identical arrival processes, an optimal static load balancing scheme does not in...
Hisao Kameda, Odile Pourtallier
ICDCS
2010
IEEE
15 years 10 months ago
Quantifying and Querying Network Reachability
—Quantifying and querying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenanc...
Amir R. Khakpour, Alex X. Liu
INFOCOM
2005
IEEE
16 years 16 hour ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
INFOCOM
2008
IEEE
16 years 25 days ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
NETGAMES
2005
ACM
15 years 12 months ago
A distributed event delivery method with load balancing for MMORPG
In this paper, we propose a new distributed event delivery method for MMORPG (Massively Multiplayer Online Role Playing Games). In our method, the whole game space is divided into...
Shinya Yamamoto, Yoshihiro Murata, Keiichi Yasumot...