Sciweavers

351 search results - page 25 / 71
» Estimation for queues from queue length data
Sort
View
SIGCOMM
1991
ACM
15 years 1 months ago
A Control-Theoretic Approach to Flow Control
This paper presents a control-theoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a round-robin-like queue service discipline in the o...
Srinivasan Keshav
CN
2008
84views more  CN 2008»
14 years 9 months ago
A router-based technique to mitigate reduction of quality (RoQ) attacks
We propose a router-based technique to mitigate the stealthy reduction of quality (RoQ) attacks at the routers in the Internet. The RoQ attacks have been shown to impair the QoS s...
Amey Shevtekar, Nirwan Ansari
76
Voted
HPCC
2009
Springer
15 years 2 months ago
Grid Network Dimensioning by Modeling the Deadline Constrained Bulk Data Transfers
—Grid applications need to move large amounts of data between distributed resources within deterministic time frames. In most cases it is possible to specify the volume and the d...
Kashif Munir, Pascale Vicat-Blanc Primet, Michael ...
TON
2008
107views more  TON 2008»
14 years 9 months ago
On guaranteed smooth switching for buffered crossbar switches
Scalability considerations drive the evolution of switch design from output queueing to input queueing and further to combined input and crosspoint queueing (CICQ). However, CICQ s...
Simin He, Shutao Sun, Hong-Tao Guan, Qiang Zheng, ...
SPAA
2004
ACM
15 years 3 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran