Sciweavers

2343 search results - page 216 / 469
» The Locomotive Routing Problem
Sort
View
ICDCS
2010
IEEE
15 years 6 months ago
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
CN
2007
154views more  CN 2007»
15 years 6 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
TCAD
2008
106views more  TCAD 2008»
15 years 6 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
TJS
2002
118views more  TJS 2002»
15 years 6 months ago
On the Design, Development, Deployment, and Network Survivability Analysis of the Dynamic Routing System Protocol
: With the ever-increasing demands on server applications, reliability is of paramount importance. Often these services are implemented using a distributed server cluster architect...
Abdur Chowdhury, Ophir Frieder, Peng-Jun Wan
ATMOS
2010
128views Optimization» more  ATMOS 2010»
15 years 5 months ago
Robust Train Routing and Online Re-scheduling
Train Routing is a problem that arises in the early phase of the passenger railway planning process, usually several months before operating the trains. The main goal is to assign...
Alberto Caprara, Laura Galli, Leo G. Kroon, G&aacu...