Sciweavers

2808 search results - page 167 / 562
» Routing betweenness centrality
Sort
View
NETWORKS
2002
15 years 6 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
NETWORKS
2007
15 years 6 months ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei
INFOCOM
2010
IEEE
15 years 5 months ago
Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
Wei Zeng, Rik Sarkar, Feng Luo 0002, Xianfeng Gu, ...
VTC
2010
IEEE
148views Communications» more  VTC 2010»
15 years 4 months ago
Delay-Tolerant Cooperative Diversity Routing MANET
—Some mobile ad hoc networks (MANETs) such as inter-vehicle communications require a transmission scheme that is robust to mobility and asynchronous reception with low setup over...
Tian Peng Ren, Yong Liang Guan, Chau Yuen, Rong Ju...
COR
2011
15 years 1 months ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria