Sciweavers

276 search results - page 29 / 56
» Proving Properties of Dynamic Process Networks
Sort
View
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
15 years 10 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
ADHOC
2007
144views more  ADHOC 2007»
14 years 9 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
88
Voted
CORR
2010
Springer
189views Education» more  CORR 2010»
14 years 9 months ago
ACRR: Ad Hoc On-Demand Distance Vector Routing with Controlled Route Requests
Reactive routing protocols like Ad-hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing in Ad-Hoc Wireless Networks (DSR) which are used in Mobile and Ad-hoc Ne...
Jayesh Kataria, P. S. Dhekne, Sugata Sanyal
INFOCOM
2007
IEEE
15 years 4 months ago
Can Retransmissions of Superexponential Documents Cause Subexponential Delays?
— Consider a generic data unit of random size L that needs to be transmitted over a channel of unit capacity. The channel dynamics is modeled as an on-off process {(Ai, Ui)}i≥1...
Predrag R. Jelenkovic, Jian Tan
AP2PC
2003
Springer
15 years 2 months ago
G-Grid: A Class of Scalable and Self-Organizing Data Structures for Multi-dimensional Querying and Content Routing in P2P Networ
Peer-to-Peer (P2P) technologies promise to provide efficient distribution, sharing and management of resources, such as storage, processing, routing and other sundry service capabi...
Aris M. Ouksel, Gianluca Moro