Sciweavers

155 search results - page 25 / 31
» A New Necessary Condition for Shortest Path Routing
Sort
View
NOMS
2006
IEEE
14 years 2 months ago
An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...
Mohammed H. Sqalli, Sadiq M. Sait, Mohammed Aijaz ...
PDP
2005
IEEE
14 years 1 months ago
Some Solutions for Peer-to-Peer Global Computing
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
Guillaume Jourjon, Didier El Baz
MOBISYS
2010
ACM
13 years 10 months ago
GreenGPS: a participatory sensing fuel-efficient maps application
This paper develops a navigation service, called GreenGPS, that uses participatory sensing data to map fuel consumption on city streets, allowing drivers to find the most fueleffi...
Raghu K. Ganti, Nam Pham, Hossein Ahmadi, Saurabh ...
CN
2006
115views more  CN 2006»
13 years 8 months ago
MuSeQoR: Multi-path failure-tolerant security-aware QoS routing in Ad hoc wireless networks
In this paper, we present MuSeQoR: a new multi-path routing protocol that tackles the twin issues of reliability (protection against failures of multiple paths) and security, whil...
Tamma Bheemarjuna Reddy, S. Sriram, B. S. Manoj, C...
IPPS
2000
IEEE
14 years 23 days ago
Take Advantage of the Computing Power of DNA Computers
Ever since Adleman [1] solved the Hamilton Path problem using a combinatorial molecular method, many other hard computational problems have been investigated with the proposed DNA ...
Zhiquan Frank Qiu, Mi Lu