Sciweavers

1127 search results - page 15 / 226
» New Algorithms for Generalized Network Flows
Sort
View
CCS
2009
ACM
15 years 10 months ago
Automatic discovery of botnet communities on large-scale communication networks
Botnets are networks of compromised computers infected with malicious code that can be controlled remotely under a common command and control (C&C) channel. Recognized as one ...
Wei Lu, Mahbod Tavallaee, Ali A. Ghorbani
TMC
2008
179views more  TMC 2008»
14 years 9 months ago
Active Queue Management for Fair Resource Allocation in Wireless Networks
This paper investigates the interaction between end-to-end flow control and medium access control (MAC)-layer scheduling on wireless links. We consider a wireless network with mult...
Lachlan L. H. Andrew, Stephen V. Hanly, Rami G. Mu...
CCR
2008
118views more  CCR 2008»
14 years 10 months ago
A generic language for application-specific flow sampling
Flow records gathered by routers provide valuable coarse-granularity traffic information for several measurement-related network applications. However, due to high volumes of traf...
Harsha V. Madhyastha, Balachander Krishnamurthy
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
14 years 11 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
DATE
2007
IEEE
106views Hardware» more  DATE 2007»
15 years 4 months ago
Design closure driven delay relaxation based on convex cost network flow
Design closure becomes hard to achieve at physical layout stage due to the emergence of long global interconnects. Consequently, interconnect planning needs to be integrated in hi...
Chuan Lin, Aiguo Xie, Hai Zhou