Sciweavers

114 search results - page 10 / 23
» Resource Constrained Shortest Paths
Sort
View
OSN
2008
83views more  OSN 2008»
13 years 8 months ago
Path selection in user-controlled circuit-switched optical networks
User-controlled circuit-switched optical networks are gaining popularity in an effort to fulfill the insatiable data transport needs of the online community. In this paper we cons...
Wojciech M. Golab, Raouf Boutaba
ICC
2007
IEEE
146views Communications» more  ICC 2007»
14 years 2 months ago
A Delay-Constrained Shared Mesh Restoration Scheme
—We present a multi-constrained routing algorithm, called Delay-constrained Pool Sharing (DPS), in a survivable mesh network. The goal of this algorithm is to find a pair of link...
Hassan Naser, Ming Gong
CAV
2001
Springer
107views Hardware» more  CAV 2001»
14 years 1 months ago
Job-Shop Scheduling Using Timed Automata
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
Yasmina Abdeddaïm, Oded Maler
NOMS
2000
IEEE
141views Communications» more  NOMS 2000»
14 years 28 days ago
IconoNET: a tool for automated bandwidth allocation planning
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
Christian Frei, Boi Faltings, George Melissargos, ...
TON
2008
99views more  TON 2008»
13 years 8 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly