Sciweavers

2343 search results - page 253 / 469
» The Locomotive Routing Problem
Sort
View
IPPS
2010
IEEE
15 years 4 months ago
Stability of a localized and greedy routing algorithm
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...
ICDCS
2009
IEEE
15 years 4 months ago
Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective ...
Meijia Hou, Dan Wang, Mingwei Xu, Jiahai Yang
MOBIHOC
2005
ACM
16 years 6 months ago
Link-layer salvaging for making routing progress in mobile ad hoc networks
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...
Chansu Yu, Kang G. Shin, Lubo Song
JAVA
2000
Springer
15 years 10 months ago
Development routes for message passing parallelism in Java
Java is an attractive environment for writing portable message passing parallel programs. Considerable work in message passing interface bindings for the C and Fortran languages h...
J. A. Mathew, Heath A. James, Kenneth A. Hawick
EOR
2008
100views more  EOR 2008»
15 years 5 months ago
Urban rapid transit network capacity expansion
The rapid transit network design problem consists on the location of the train alignments and stations in an urban traffic context. The location problem incorporates the demand dec...
Ángel Marín, Patricia Jaramillo