Sciweavers

3652 search results - page 457 / 731
» A study of query length
Sort
View
IEEEIAS
2009
IEEE
15 years 11 months ago
Detecting Stepping-Stone Intruders with Long Connection Chains
: A common technique hacker use is to route their traffic through a chain of stepping-stone hosts. It is generally agreed that there is no valid reason to use a long connection cha...
Wei Ding, Matthew J. Hausknecht, Shou-Hsuan Stephe...
INFOCOM
2009
IEEE
15 years 11 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
INFOCOM
2009
IEEE
15 years 11 months ago
Impairment-Aware Offline RWA for Transparent Optical Networks
—We consider the offline version of the routing and wavelength assignment (RWA) problem in transparent all-optical networks. In such networks and in the absence of regenerators, ...
Konstantinos Manousakis, Kostas Christodoulopoulos...
IPPS
2009
IEEE
15 years 11 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 11 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...