Sciweavers

15 search results - page 2 / 3
» On selection of candidate paths for proportional routing
Sort
View
CEC
2005
IEEE
13 years 6 months ago
DNA implementation of k-shortest paths computation
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
Zuwairie Ibrahim, Yusei Tsuboi, Mohd Saufee Muhamm...
INFOCOM
2006
IEEE
13 years 11 months ago
How to Select a Good Alternate Path in Large Peer-to-Peer Systems?
Abstract— When multiple paths are available between communicating hosts, application quality can be improved by switching among them to always use the best one. The key to such a...
Teng Fei, Shu Tao, Lixin Gao, Roch Guérin
IPTPS
2005
Springer
13 years 10 months ago
Evaluating DHT-Based Service Placement for Stream-Based Overlays
Stream-based overlay networks (SBONs) are one approach to implementing large-scale stream processing systems. A fundamental consideration in an SBON is that of service placement, ...
Peter R. Pietzuch, Jeffrey Shneidman, Jonathan Led...
WINET
2010
158views more  WINET 2010»
13 years 3 months ago
Joint multi-cost routing and power control in wireless ad hoc networks
Abstract In this work we study the combination of multicost routing and adjustable transmission power in wireless ad hoc networks, so as to obtain dynamic energy- and interference-...
Nikolaos Karagiorgas, Panagiotis C. Kokkinos, Chri...
ANCS
2009
ACM
13 years 2 months ago
Weighted random oblivious routing on torus networks
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
Rohit Sunkam Ramanujam, Bill Lin