1594 search results - page 114 / 319 » An Algorithm to Compute Collusion Paths |
130
click to vote
SIGCOMM
2004
ACM
15 years 8 months ago
2004
ACM
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...
158
click to vote
APNOMS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. DoS(Denial of Service) / DDoS(Distributed Denial of Service) attacks threaten Internet security nowadays. However, the current Internet protocol and backbone network do n...
115
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
128
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
New architectures have recently been proposed and deployed to support end-to-end advance reservation of network resources. These architectures rely on the use a centralized schedul...
135
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...