Sciweavers

1765 search results - page 196 / 353
» Communication Scheduling
Sort
View
INFOCOM
2002
IEEE
15 years 9 months ago
BSFQ: Bin Sort Fair Queueing
—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...
Shun Yan Cheung, Corneliu S. Pencea
INFOCOM
2002
IEEE
15 years 9 months ago
Travelling Miser Problem
— Various monitoring and performance evaluation tools generate considerable amount of low priority traffic. This information is not always needed in real time, and thus could of...
Yuval Shavitt, David Breitgand, Danny Raz
ICA3PP
2010
Springer
15 years 9 months ago
On-Line Task Granularity Adaptation for Dynamic Grid Applications
Abstract. Deploying lightweight tasks on grid resources would let the communication overhead dominate the overall application processing time. Our aim is to increase the resulting ...
Nithiapidary Muthuvelu, Ian Chai, Eswaran Chikkann...
CAAN
2006
Springer
15 years 8 months ago
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
Fredrik Manne, Qin Xin
INFOCOM
2010
IEEE
15 years 2 months ago
Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
Kyunghan Lee, Yung Yi, Jaeseong Jeong, Hyungsuk Wo...