Sciweavers

1333 search results - page 228 / 267
» Packet Routing on the Grid
Sort
View
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 8 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
MOBIHOC
2007
ACM
14 years 7 months ago
On exploiting asymmetric wireless links via one-way estimation
A substantial percentage of links in wireless networks, especially low-power ones, is asymmetric. For the low-quality direction of asymmetric links, we observe based on testbed ex...
Lifeng Sang, Anish Arora, Hongwei Zhang
MOBIHOC
2002
ACM
14 years 7 months ago
Minimum energy paths for reliable communication in multi-hop wireless networks
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...
Suman Banerjee, Archan Misra
ICCCN
1997
IEEE
13 years 12 months ago
Design and implementation of a QoS capable switch-router
Rapid expansion has strained the capabilities of the Internet infrastructure. Emerging audio and video applications place further demands on already overloaded network elements, e...
Erol Basturk, Alexander Birman, G. Delp, Roch Gu&e...
ADHOC
2007
144views more  ADHOC 2007»
13 years 7 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac