Sciweavers

625 search results - page 70 / 125
» Semi-preemptive routing on trees
Sort
View
73
Voted
EOR
2010
102views more  EOR 2010»
15 years 18 days ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...
122
Voted
HPCC
2007
Springer
15 years 4 months ago
Power-Aware Fat-Tree Networks Using On/Off Links
Abstract. Nowadays, power consumption reduction techniques are being increasingly used in computer systems, and high-performance computing systems are not an exception. In particul...
Marina Alonso, Salvador Coll, Vicente Santonja, Ju...
94
Voted
OPODIS
2008
15 years 1 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
GLOBECOM
2010
IEEE
14 years 10 months ago
Approximation Ratios of Multicast Light-Trees in WDM Networks
Abstract--All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The costoptimal multicast light-tree is NP-hard to compute, especially w...
Fen Zhou, Miklós Molnár, Bernard Cou...
97
Voted
ICASSP
2009
IEEE
15 years 7 months ago
Energy-efficient graph-based wavelets for distributed coding in Wireless Sensor Networks
This work presents a class of unidirectional lifting-based wavelet transforms for an arbitrary communication graph in a wireless sensor network. These transforms are unidirectiona...
Godwin Shen, Sundeep Pattem, Antonio Ortega