Sciweavers

272 search results - page 21 / 55
» Improving the Performance of TCP in the Case of Packet Reord...
Sort
View
CN
2002
102views more  CN 2002»
13 years 7 months ago
Predicting bottleneck bandwidth sharing by generalized TCP flows
The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottlene...
Archan Misra, Teunis J. Ott, John S. Baras
GLOBECOM
2007
IEEE
14 years 1 months ago
LSP Setup Arrival Reordering Approach for MPLS-TE Routing
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...
Imène Chaieb, Jean-Louis Le Roux, Bernard C...
ASPDAC
1995
ACM
108views Hardware» more  ASPDAC 1995»
13 years 11 months ago
Transistor reordering rules for power reduction in CMOS gates
— The goal of transistor reordering for a logic gate is to reduce the propagation delay as well as the charging and discharging of internal capacitances to achieve low power cons...
Wen-Zen Shen, Jiing-Yuan Lin, Fong-Wen Wang
HPDC
2002
IEEE
14 years 15 days ago
An Evaluation of Object-Based Data Transfers on High Performance Networks
In this paper, we describe FOBS: a simple userlevel communication protocol designed to take advantage of the available bandwidth in a highbandwidth, high-delay network environment...
Phillip M. Dickens, William Gropp
SIGMETRICS
1998
ACM
187views Hardware» more  SIGMETRICS 1998»
13 years 11 months ago
An Analytic Behavior Model for Disk Drives with Readahead Caches and Request Reordering
Modern disk drives read-ahead data and reorder incoming requests in a workload-dependent fashion. This improves their performance, but makes simple analytical models of them inade...
Elizabeth A. M. Shriver, Arif Merchant, John Wilke...