Sciweavers

2149 search results - page 213 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
SASO
2010
IEEE
14 years 11 months ago
Extracting Overlay Invariants of Distributed Systems for Autonomic System Management
Many large-scale distributed systems have been built with great complexity to run Internet services. Due to the heterogeneity and dynamics of complex systems, it is very difficult ...
Hanhuai Shan, Guofei Jiang, Kenji Yoshihira
INFOCOM
2000
IEEE
15 years 6 months ago
Power Controlled Multiple Access (PCMA) in Wireless Communication Networks
—We address the issue of power-controlled shared channel access in future wireless networks supporting packetized data traffic, beyond the voice-oriented continuous traffic prima...
Nicholas Bambos, Sunil Kandukuri
INFOCOM
2005
IEEE
15 years 7 months ago
Distributed, secure load balancing with skew, heterogeneity and churn
— Numerous proposals exist for load balancing in peer-to-peer (p2p) networks. Some focus on namespace balancing, making the distance between nodes as uniform as possible. This te...
Jonathan Ledlie, Margo I. Seltzer
CISS
2008
IEEE
15 years 8 months ago
Threshold structure of channel aware distributed scheduling in ad-hoc networks: An optimal stopping view
— As evidenced by measurement data, channel fading and co-channel interference occur on the same time scales, and it is therefore difficult to determine if packet losses are due...
Junshan Zhang
AINA
2009
IEEE
14 years 11 months ago
Approximating Travel Times Using Opportunistic Networking
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...
Rudi Ball, Naranker Dulay