Sciweavers

540 search results - page 27 / 108
» Competitive Routing over Time
Sort
View
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
14 years 3 months ago
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...
Artur Alves Pessoa, Marcus Poggi de Aragão,...
GLOBECOM
2007
IEEE
13 years 10 months ago
QoT-Aware Routing in Impairment-Constrained Optical Networks
—In this paper, we consider the problem of routing and wavelength assignment (RWA) in all-optical networks, where signals propagate in the optical domain (with no electrical rege...
Jun He, Maïté Brandt-Pearce, Yvan Poin...
INFOCOM
2005
IEEE
14 years 2 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
TR
2008
107views more  TR 2008»
13 years 9 months ago
A New Shared Segment Protection Method for Survivable Networks with Guaranteed Recovery Time
Shared Segment Protection (SSP), compared with Shared Path Protection (SPP), and Shared Link Protection (SLP), provides an optimal protection configuration due to the ability of ma...
János Tapolcai, Pin-Han Ho, Dominique Verch...
IAJIT
2010
87views more  IAJIT 2010»
13 years 7 months ago
A performance comparison of MD5 authenticated routing traffic with EIGRP, RIPv2, and OSPF
: Routing is the process of forwarding data across an inter-network from a designated source to a final destination. Along the way from source to destination, at least one intermed...
Khalid Abu Al-Saud, Hatim Mohd Tahir, Moutaz Saleh...