Sciweavers

217 search results - page 35 / 44
» Approximating Minimum Manhattan Networks
Sort
View
INFOCOM
2007
IEEE
14 years 4 months ago
Multivariate Online Anomaly Detection Using Kernel Recursive Least Squares
— High-speed backbones are regularly affected by various kinds of network anomalies, ranging from malicious attacks to harmless large data transfers. Different types of anomalies...
Tarem Ahmed, Mark Coates, Anukool Lakhina
CN
2006
75views more  CN 2006»
13 years 9 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
MOBIHOC
2007
ACM
14 years 9 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi

Lecture Notes
443views
15 years 7 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
TAMC
2009
Springer
14 years 4 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens