Sciweavers

14 search results - page 3 / 3
» On-Demand Distributed Energy-Aware Routing with Limited Rout...
Sort
View
SOICT
2010
13 years 4 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
FOCS
1997
IEEE
14 years 2 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
MOBIHOC
2005
ACM
14 years 9 months ago
On the node-scheduling approach to topology control in ad hoc networks
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
Budhaditya Deb, Badri Nath
DSD
2002
IEEE
96views Hardware» more  DSD 2002»
14 years 2 months ago
Networks on Silicon: Blessing or Nightmare?
Continuing VLSI technology scaling raises several deep submicron (DSM) problems like relatively slow interconnect, power dissipation and distribution, and signal integrity. Those ...
Paul Wielage, Kees G. W. Goossens