Sciweavers

48 search results - page 4 / 10
» Static and Dynamic Low-Congested Interval Routing Schemes
Sort
View
IPPS
2002
IEEE
13 years 11 months ago
A Limited-Global Fault Information Model for Dynamic Routing in 2-D Meshes
In this paper, a fault-tolerant routing in 2-D meshes with dynamic faults is provided. It is based on an early work on minimal routing in 2-D meshes with static faults. Unlike man...
Zhen Jiang, Jie Wu
TPDS
2010
126views more  TPDS 2010»
13 years 1 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
ICCS
2007
Springer
14 years 16 days ago
Securely Deliver Data by Multi-path Routing Scheme in Wireless Mesh Networks
Wireless Mesh Networks with static Transit Access Points (TAPs) have many advantages to connect different kinds of networks. While Mobile Ad hoc Networks still have many challenges...
Cao Trong Hieu, Choong Seon Hong
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 6 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...
GLOBECOM
2007
IEEE
14 years 22 days ago
Dynamic Multipath Onion Routing in Anonymous Peer-To-Peer Overlay Networks
— Although recent years provided many protocols for anonymous routing in overlay networks, they commonly rely on the same communication paradigm: Onion Routing. In Onion Routing ...
Olaf Landsiedel, Lexi Pimenidis, Klaus Wehrle, Hei...