Sciweavers

105 search results - page 14 / 21
» Distributed Algorithms for Computing Alternate Paths Avoidin...
Sort
View
EUC
2006
Springer
13 years 11 months ago
A Reverse AODV Routing Protocol in Ad Hoc Mobile Networks
In mobile ad hoc networks, mobile devices wander autonomously for the use of wireless links and dynamically varying network topology. AODV (Ad-hoc on-demand Distance vector routing...
Chonggun Kim, Elmurod Talipov, Byoungchul Ahn
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 8 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
INFOCOM
2002
IEEE
14 years 14 days ago
Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman
MOBIHOC
2004
ACM
14 years 7 months ago
Using labeled paths for loop-free on-demand routing in ad hoc networks
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
Hari Rangarajan, J. J. Garcia-Luna-Aceves
IPPS
1997
IEEE
13 years 11 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen