Sciweavers

89 search results - page 15 / 18
» Fast paths in large-scale dynamic road networks
Sort
View
JNW
2008
173views more  JNW 2008»
13 years 8 months ago
Dominating Set Theory based Semantic Overlay Networks for Efficient and Resilient Content Distribution
Recently overlay networks have emerged as an efficient and flexible method for content distribution. An overlay network is a network running on top of another network, usually the ...
J. Amutharaj, S. Radhakrishnan
PVLDB
2008
154views more  PVLDB 2008»
13 years 7 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing
INFOCOM
2006
IEEE
14 years 2 months ago
Minimum User-Perceived Interference Routing in Service Composition
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
Li Xiao, Klara Nahrstedt
INFOCOM
2000
IEEE
13 years 11 months ago
Minimum Interference Routing with Applications to MPLS Traffic Engineering
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding...
Murali S. Kodialam, T. V. Lakshman
TPDS
2008
199views more  TPDS 2008»
13 years 8 months ago
DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks
Abstract-- Broadcast-based Peer-to-Peer (P2P) networks, including flat (e.g., Gnutella) and two-layer super-peer implementations (e.g., Kazaa), are extremely popular nowadays due t...
Zhenzhou Zhu, Panos Kalnis, Spiridon Bakiras