Sciweavers

3116 search results - page 262 / 624
» Design and implementation of network puzzles
Sort
View
MOBICOM
2009
ACM
16 years 1 months ago
Capacity of large-scale CSMA wireless networks
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schem...
Chi-Kin Chau, Minghua Chen, Soung Chang Liew
SIGCOMM
2009
ACM
16 years 1 months ago
A programmable, generic forwarding element approach for dynamic network functionality
Communication networks are growing exponentially, and new services and applications are being introduced unceasingly. To meet the demands of these services and applications, curre...
Ran Giladi, Niv Yemini
DSN
2008
IEEE
16 years 1 months ago
Probabilistic quorum systems in wireless ad hoc networks
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
Roy Friedman, Gabriel Kliot, Chen Avin
ICC
2008
IEEE
118views Communications» more  ICC 2008»
16 years 1 months ago
A Distributed Scheduling Algorithm for an Optical Switching Fabric
— Designing switching architectures for network routers and switches needs to consider limits imposed by the electronic technology, like small bandwidth×distance factors, power ...
Andrea Bianco, Elisabetta Carta, Davide Cuda, Jorg...
IPPS
2007
IEEE
16 years 28 days ago
Machine Bank: Own Your Virtual Personal Computer
In this paper, we report the design, implementation and experimental results of Machine Bank, a system engineered towards the popular shared-lab scenario, where users outnumber av...
Shuo Tang, Yu Chen, Zheng Zhang