Sciweavers

1259 search results - page 16 / 252
» On Survivable Access Network Design: Complexity and Algorith...
Sort
View
EUROPAR
2006
Springer
15 years 3 months ago
A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
Hyungsoo Jung, Heon Young Yeom
MOBIHOC
2004
ACM
15 years 11 months ago
A unified MAC layer framework for ad-hoc networks with smart antennas
Smart antennas represent a broad variety of antennas that differ in their performance and transceiver complexity. The superior capabilities of smart antennas, however, can be leve...
Karthikeyan Sundaresan, Raghupathy Sivakumar
IMC
2006
ACM
15 years 5 months ago
The need for cross-layer information in access point selection algorithms
The low price of commodity wireless LAN cards and access points (APs) has resulted in the rich proliferation of high density WLANs in enterprise, academic environments, and public ...
Karthikeyan Sundaresan, Konstantina Papagiannaki
MOBIHOC
2009
ACM
16 years 6 days ago
Spectrum auction framework for access allocation in cognitive radio networks
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
Gaurav S. Kasbekar, Saswati Sarkar
CCR
2006
122views more  CCR 2006»
14 years 11 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer