Sciweavers

74 search results - page 10 / 15
» Approximating the traffic grooming problem
Sort
View
CLUSTER
2001
IEEE
14 years 1 months ago
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
Li-Chuan Chen, Hyeong-Ah Choi
ACSC
2003
IEEE
14 years 3 months ago
A Practical Method to Counteract Denial of Service Attacks
Today distributed denial of service (DDoS) attacks are causing major problems to conduct online business over the Internet. Recently several schemes have been proposed on how to p...
Udaya Kiran Tupakula, Vijay Varadharajan
CHARME
1997
Springer
105views Hardware» more  CHARME 1997»
14 years 1 months ago
Simulation-based verification of network protocols performance
Formal verification techniques need to deal with the complexity of the systems rified. Most often, this problem is solved by taking an abstract model of the system and aiming at a...
Mario Baldi, Fulvio Corno, Maurizio Rebaudengo, Pa...
JUCS
2006
112views more  JUCS 2006»
13 years 9 months ago
A Multi-objective Genetic Approach to Mapping Problem on Network-on-Chip
Abstract: Advances in technology now make it possible to integrate hundreds of cores (e.g. general or special purpose processors, embedded memories, application specific components...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi
EOR
2006
107views more  EOR 2006»
13 years 9 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...