Sciweavers

995 search results - page 15 / 199
» Minimizing Congestion in General Networks
Sort
View
JACM
2007
121views more  JACM 2007»
13 years 7 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
MOBIQUITOUS
2008
IEEE
14 years 2 months ago
Congestion control protocol for wireless sensor networks handling prioritized heterogeneous traffic
Heterogeneous applications could be assimilated within the same wireless sensor network with the aid of modern motes that have multiple sensor boards on a single radio board. Diff...
Muhammad Mostafa Monowar, Md. Obaidur Rahman, Al-S...
CONEXT
2007
ACM
13 years 11 months ago
Backpressure multicast congestion control in mobile ad-hoc networks
In mobile ad-hoc networks, the multicast paradigm is of central importance. It can help to save scarce medium bandwidth if packets are to be delivered to multiple destinations. We...
Björn Scheuermann, Matthias Transier, Christi...
SIROCCO
2008
13 years 9 months ago
Computing Approximate Nash Equilibria in Network Congestion Games
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
Andreas Emil Feldmann, Heiko Röglin, Berthold...
DAC
1998
ACM
14 years 8 months ago
Performance Driven Multi-Layer General Area Routing for PCB/MCM Designs
In this paper we present a new global router appropriate for Multichip Module MCM and dense Printed Circuit Board PCB design, which utilizes a hybrid of the classical rip-up and r...
Jason Cong, Patrick H. Madden