Sciweavers

112 search results - page 18 / 23
» Rounds in Communication Complexity Revisited
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Credit based fair scheduling for packet switched networks
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
Deng Pan, Yuanyuan Yang
ICC
2007
IEEE
14 years 2 months ago
Simple and Fair Scheduling Algorithm for Combined Input-Crosspoint-Queued Switch
— In this paper, we propose a fair and simple high-performance scheduling algorithm for Combined Input-Crosspoint-Queued Switches, which is called Tracking Fair Quota Allocation ...
Nan Hua, Peng Wang, Depeng Jin, Lieguang Zeng, Bin...
INFOCOM
2005
IEEE
14 years 1 months ago
Optimizing cost-sensitive trust-negotiation protocols
Trust negotiation is a process that establishes mutual trust by the exchange of digital credentials and/or guiding policies among entities who may have no pre-existing knowledge a...
Weifeng Chen, L. Clarke, James F. Kurose, Donald F...
PODC
2005
ACM
14 years 1 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
IFIP
2003
Springer
14 years 26 days ago
Exact Probabilistic Analysis of the Limited Scheduling Algorithm for Symmetrical Bluetooth Piconets
Efficient communication in Bluetooth scatternets requires design of intra and inter-piconet scheduling algorithms, and therefore numerous algorithms have been proposed. However, du...
Gil Zussman, Uri Yechiali, Adrian Segall