1768 search results - page 153 / 354 » Optimal routing in Chord |
118
click to vote
CN
2000
15 years 1 months ago
2000
This contribution concentrates on dynamic routing in WDM (Wavelength Division Multiplexing) networks. It is shown that a strategy based on precalculated alternatives and an adapti...
119
click to vote
NETWORKS
2007
15 years 25 days ago
2007
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
131
click to vote
PIMRC
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...
SECON
2010
IEEE
14 years 11 months ago
2010
IEEE
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...
GLOBECOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—This paper investigates the network performance loss of using only single-path routing when multiple paths are available. The performance metric is the aggregate utility achieve...