Sciweavers

306 search results - page 60 / 62
» Do you Queue
Sort
View
IEEEPACT
2000
IEEE
14 years 1 months ago
On Some Implementation Issues for Value Prediction on Wide-Issue ILP Processors
In this paper, we look at two issues which could affect the performance of value prediction on wide-issue ILP processors. One is the large number of accesses to the value predicti...
Sang Jeong Lee, Pen-Chung Yew
RAID
1999
Springer
14 years 29 days ago
Defending against a Denial-of-Service Attack on TCP
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...
Pars Mutaf
SPAA
1996
ACM
14 years 26 days ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
CCR
2006
122views more  CCR 2006»
13 years 8 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
ORDER
2006
97views more  ORDER 2006»
13 years 8 months ago
Upward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
Vida Dujmovic, David R. Wood