Sciweavers

Share
29 search results - page 1 / 6
» Provably competitive adaptive routing
Sort
View
INFOCOM
2005
IEEE
11 years 7 months ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...
ESAS
2005
Springer
11 years 6 months ago
Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks
Abstract. In this paper, we propose a framework for the security analysis of on-demand, distance vector routing protocols for ad hoc networks, such as AODV, SAODV, and ARAN. The pr...
Gergely Ács, Levente Buttyán, Istv&a...
NETWORK
2008
119views more  NETWORK 2008»
11 years 1 months ago
Improving the Performance of Route Control Middleboxes in a Competitive Environment
Multihomed subscribers are increasingly adopting intelligent route control solutions to optimize the cost and end-to-end performance of the traffic routed among the different link...
Marcelo Yannuzzi, Xavier Masip-Bruin, Eva Mar&iacu...
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
11 years 2 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
EURODAC
1994
IEEE
120views VHDL» more  EURODAC 1994»
11 years 5 months ago
Planar-DME: improved planar zero-skew clock routing with minimum pathlength delay
Clock routing has become a critical issue in the layout design of high-performance systems. We show that the two passes bottom-up and top-down of the DME algorithm 2, 3, 4, 8 can ...
Chung-Wen Albert Tsao, Andrew B. Kahng
books