Sciweavers

2926 search results - page 220 / 586
» Partially Optimal Routing
Sort
View
135
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
Bottleneck Routing Games in Communication Networks
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
Ron Banner, Ariel Orda
139
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
Designing Low Cost Networks with Short Routes and Low Congestion
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
Van Nguyen, Charles U. Martel
131
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
Distributed algorithms for secure multipath routing
— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple pa...
Patrick P. C. Lee, Vishal Misra, Dan Rubenstein
143
Voted
INFOCOM
2000
IEEE
15 years 8 months ago
Energy Conserving Routing in Wireless Ad-hoc Networks
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
Jae-Hwan Chang, Leandros Tassiulas
FPGA
2000
ACM
177views FPGA» more  FPGA 2000»
15 years 7 months ago
Automatic generation of FPGA routing architectures from high-level descriptions
In this paper we present a "high-level" FPGA architecture description language which lets FPGA architects succinctly and quickly describe an FPGA routing architecture. W...
Vaughn Betz, Jonathan Rose