Sciweavers

1502 search results - page 36 / 301
» Node weighted scheduling
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
STUMP: Exploiting Position Diversity in the Staggered TDMA Underwater MAC Protocol
—In this paper, we propose the Staggered TDMA Underwater MAC Protocol (STUMP), a scheduled, collision free TDMA-based MAC protocol that leverages node position diversity and the ...
Kurtis B. Kredo II, Petar Djukic, Prasant Mohapatr...
ISAAC
2004
Springer
141views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Jérôme Monnot, Vangelis Th. Paschos, ...
INFOCOM
1993
IEEE
14 years 2 months ago
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...
Abhay K. Parekh, Robert G. Gallager
INFOCOM
2009
IEEE
14 years 4 months ago
On Fast Optimal STDMA Scheduling over Fading Wireless Channels
—Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI)...
JiaLiang Zhang, Soung Chang Liew, Liqun Fu
INFOCOM
2006
IEEE
14 years 3 months ago
Light-Weight Overlay Path Selection in a Peer-to-Peer Environment
— Large-scale peer-to-peer systems span a wide range of Internet locations. Such diversity can be leveraged to build overlay “detours” to circumvent periods of poor performan...
Teng Fei, Shu Tao, Lixin Gao, Roch Guérin, ...