Sciweavers

806 search results - page 135 / 162
» Lower Bounds on Correction Networks
Sort
View
INFOCOM
2008
IEEE
14 years 4 months ago
A New ACK Policy To Mitigate the Effects of Coexisting IEEE 802.11/802.11e Devices
— In IEEE 802.11 wireless networks, EDCA users’ performance may be degraded because of the existence of legacy users and therefore would get a lower priority service. Such effe...
Haithem Al-Mefleh, J. Morris Chang
INFOCOM
2005
IEEE
14 years 4 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
14 years 3 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
IPPS
2000
IEEE
14 years 2 months ago
Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
Maurizio A. Bonuccelli, Susanna Pelagatti
PODC
2010
ACM
14 years 2 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela