Sciweavers

48 search results - page 8 / 10
» A Simple Approximation to Minimum-Delay Routing
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
Exploiting anarchy in networks: a game-theoretic approach to combining fairness and throughput
— We propose a novel mechanism for routing and bandwidth allocation that exploits the selfish and rational behavior of flows in a network. Our mechanism leads to allocations th...
Sreenivas Gollapudi, D. Sivakumar, Aidong Zhang
86
Voted
INFOCOM
2008
IEEE
15 years 3 months ago
Cross-Monotonic Multicast
—In the routing and cost sharing of multicast towards a group of potential receivers, cross-monotonicity is a property that states a user’s payment can only be smaller when ser...
Zongpeng Li
WCNC
2010
IEEE
14 years 7 months ago
A Recursive Battery Model for Nodes Lifetime Estimation in Wireless Sensor Networks
—Since sensor nodes use batteries as their source of energy, energy-based routing becomes an important requirement to extend network lifetime. This routing is done using the node...
Joseph Rahmé, Nicolas Fourty, Khaldoun Al A...
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
15 years 9 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
15 years 1 months ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng