Sciweavers

456 search results - page 42 / 92
» On Routing in Distributed Hash Tables
Sort
View
SIGOPSE
2004
ACM
14 years 4 months ago
The lonely NATed node
In this paper we take the position that current research in the area of distributed systems has all but forgotten about one of the largest collective Internet resources - the NATe...
Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S...
ISPAN
2005
IEEE
14 years 4 months ago
A Hybrid Algorithm for Dynamic Lightpath Protection in Survivable WDM Optical Networks
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
Vinh Trong Le, Son-Hong Ngo, Xiaohong Jiang, Susum...
COORDINATION
2007
Springer
14 years 5 months ago
Requirements for Routing in the Application Layer
In the application layer of networks, many application servers are middleboxes in the paths of messages from source to destination. Applications require, as a basic coordination me...
Pamela Zave
JCST
2008
203views more  JCST 2008»
13 years 11 months ago
Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks
Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor sca...
Xue Zhang, Jue Hong, Sanglu Lu, Li Xie, Jiannong C...
ICDE
2006
IEEE
179views Database» more  ICDE 2006»
15 years 10 days ago
Distributed Evaluation of Continuous Equi-join Queries over Large Structured Overlay Networks
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...
Stratos Idreos, Christos Tryfonopoulos, Manolis Ko...