Sciweavers

260 search results - page 39 / 52
» Quorum placement in networks: minimizing network congestion
Sort
View
JSAC
2010
122views more  JSAC 2010»
13 years 6 months ago
Scalable service migration in autonomic network environments
Abstract— Service placement is a key problem in communication networks as it determines how efficiently the user service demands are supported. This problem has been traditional...
Konstantinos Oikonomou, Ioannis Stavrakakis
CN
2004
129views more  CN 2004»
13 years 7 months ago
Dynamic traffic controls for Web-server networks
Distributed Web-server systems have been widely used to provide effective Internet services. The management of these systems requires dynamic controls of the Web traffic. With the...
Liming Liu, Yumao Lu
ESTIMEDIA
2006
Springer
13 years 11 months ago
Neighbors-on-Path: A New Selection Strategy for On-Chip Networks
Efficient and deadlock-free routing is critical to the performance of networks-on-chip. In this paper we present an approach that can be coupled to any adaptive routing algorithm ...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi,...
MAM
2006
95views more  MAM 2006»
13 years 7 months ago
Stochastic spatial routing for reconfigurable networks
FPGA placement and routing is time consuming, often serving as the major obstacle inhibiting a fast edit-compile-test loop in prototyping and development and the major obstacle pr...
André DeHon, Randy Huang, John Wawrzynek
IOR
2007
89views more  IOR 2007»
13 years 7 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...