Sciweavers

121 search results - page 3 / 25
» A routing protocol for finding two node-disjoint paths in co...
Sort
View
TON
2008
125views more  TON 2008»
13 years 6 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
ICPPW
2002
IEEE
13 years 11 months ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen
CJ
2011
12 years 10 months ago
Dynamic Multipath Allocation in Ad Hoc Networks
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/...
Yosi Ben-Asher, Sharoni Feldman, Moran Feldman
AINA
2008
IEEE
14 years 1 months ago
Geographical Routing in Intermittently Connected Ad Hoc Networks
In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destinat...
Erik Kuiper, Simin Nadjm-Tehrani
IWCMC
2006
ACM
14 years 18 days ago
TARP: trust-aware routing protocol
Security is a critical issue in a mobile ad hoc network (MANET). In most of the previous protocols security is an added layer above the routing protocol. We propose a TrustAware R...
Loay Abusalah, Ashfaq A. Khokhar, G. BenBrahim, W....