Sciweavers

2926 search results - page 314 / 586
» Partially Optimal Routing
Sort
View
IJNM
2008
141views more  IJNM 2008»
15 years 3 months ago
Dynamic scheduling of network resources with advance reservations in optical grids
Advance reservation of lightpaths in Grid environments is necessary to guarantee QoS and reliability. In this paper, we have evaluated and compared several algorithms for dynamic ...
Savera Tanwir, Lina Battestilli, Harry G. Perros, ...
COR
2007
112views more  COR 2007»
15 years 3 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
IJWIN
2007
68views more  IJWIN 2007»
15 years 3 months ago
Density-Independent, Scalable Search in Ad Hoc Networks
— We analyze the asymptotic cost of discovering a route within a flat ad hoc network and we show that one can discover a route with cost that is proportional only to the area of...
Zygmunt J. Haas, Rimon Barr
COMCOM
1999
87views more  COMCOM 1999»
15 years 3 months ago
Virtual path layout in ATM networks based on the P-median problem
We study the problem of virtual path layout in ATM networks. Virtual path (VP) and virtual channel are used by the ATM networks in realizing multiplexing, resource management and ...
W. K. Lai, R. F. Chang
NETWORKS
2007
15 years 3 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...