Sciweavers

2343 search results - page 162 / 469
» The Locomotive Routing Problem
Sort
View
GLOBECOM
2006
IEEE
16 years 9 days ago
Optimal Routing in the Worst-Case-Error Metric
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
Edwin Soedarmadji
ICITA
2005
IEEE
15 years 12 months ago
On Dynamic Routing and Wavelength Assignment in Multi-granular All-Optical Networks
In this paper, we investigate the dynamic RWA problem in networks comprising of all-optical switches based on the multi-granular architecture (MG_DRWA). With this adaptive archite...
Ching-Fang Hsu, Te-Lung Liu, Fang-Sheng Lin
NCA
2003
IEEE
15 years 11 months ago
Optimal Content Placement for En-Route Web Caching
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the ...
Anxiao Jiang, Jehoshua Bruck
143
Voted
ICPADS
1998
IEEE
15 years 10 months ago
An Optimal Routing Scheme for Multiple Broadcast
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Hua Lee
ENTCS
2007
110views more  ENTCS 2007»
15 years 6 months ago
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
Camil Demetrescu, Giuseppe F. Italiano