118 search results - page 23 / 24 » Minimizing maximum fiber requirement in optical networks |
RAID
1999
Springer
14 years 20 days ago
1999
Springer
In this paper we propose a real-time anomaly detection method for detecting TCP SYN-flooding attacks. This method is based on the intensities of SYN segments which are measured on...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
INFOCOM
1998
IEEE
1998
IEEE
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
14 years 20 days ago
-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward para...
TON
2002
13 years 8 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
KDD
2012
ACM
11 years 11 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...