Sciweavers

1875 search results - page 164 / 375
» Automatic Network Protocol Analysis
Sort
View
123
Voted
WDAG
2010
Springer
158views Algorithms» more  WDAG 2010»
15 years 1 months ago
Distributed Contention Resolution in Wireless Networks
We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric ...
Thomas Kesselheim, Berthold Vöcking
133
Voted
PODC
2010
ACM
15 years 1 months ago
Brief announcement: distributed contention resolution in wireless networks
We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric ...
Thomas Kesselheim, Berthold Vöcking
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
16 years 3 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...
ISCC
1999
IEEE
111views Communications» more  ISCC 1999»
15 years 7 months ago
Towards TCP-Friendly Adaptive Multimedia Applications Based on RTP
For multimedia senders to benefit the most of dynamically changing availability of network resources they need to adjust their transmission behavior in accordance with the network...
Dorgham Sisalem, Adam Wolisz
NETWORKING
2004
15 years 4 months ago
Efficient, Authenticated, and Fault-Tolerant Key Agreement for Dynamic Peer Groups
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...
Li Zhou, Chinya V. Ravishankar