Sciweavers

268 search results - page 39 / 54
» Fairness in Routing and Load Balancing
Sort
View
SECON
2007
IEEE
14 years 1 months ago
Robust Routing and Scheduling in Wireless Mesh Networks
—Joint routing-and-scheduling has been considered in wireless mesh networks for its significant performance improvement. While existing work assumes it, accurate traffic inform...
Wei Wang, Xin Liu, Dilip Krishnaswamy
TPDS
2008
188views more  TPDS 2008»
13 years 7 months ago
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks
We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduc...
Yu Wang 0003, Weizhao Wang, Xiang-Yang Li, Wen-Zha...
HPCC
2007
Springer
14 years 1 months ago
CDACAN: A Scalable Structured P2P Network Based on Continuous Discrete Approach and CAN
Abstract. CAN is a famous structured peer-to-peer network based on ddimensional torus topology with constant degree and logarithmical diameter, but suffers from poor scalability wh...
Lingwei Li, Qunwei Xue, Deke Guo
ICPADS
2005
IEEE
14 years 1 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
FOCS
2000
IEEE
13 years 11 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella