Sciweavers

33 search results - page 5 / 7
» Maintaining Packet Order for the Parallel Switch
Sort
View
PADS
2004
ACM
14 years 24 days ago
Space-Parallel Network Simulations Using Ghosts
We discuss an approach for creating a federated network simulation that eases the burdens on the simulator user that typically arise from more traditional methods for defining sp...
George F. Riley, Talal M. Jaafar, Richard M. Fujim...
NPC
2004
Springer
14 years 22 days ago
Request Distribution for Fairness with a New Load-Update Mechanism in Web Server Cluster
The complexity of services and applications provided by Web sites is ever increasing as integration of traditional Web publishing sites with new paradigms, i.e., e-commerce. Each d...
MinHwan Ok, Myong-Soon Park
CF
2010
ACM
13 years 10 months ago
A communication infrastructure for a million processor machine
: The SpiNNaker machine is a massively parallel computing system, consisting of 1,000,000 cores. From one perspective, it has a place in Flynns' taxonomy: it is a straightforw...
Andrew D. Brown, Steve Furber, Jeff S. Reeve, Pete...
ICNP
2003
IEEE
14 years 20 days ago
RR-TCP: A Reordering-Robust TCP with DSACK
TCP performs poorly on paths that reorder packets significantly, where it misinterprets out-of-order delivery as packet loss. The sender responds with a fast retransmit though no...
Ming Zhang, Brad Karp, Sally Floyd, Larry L. Peter...
INFOCOM
2012
IEEE
11 years 9 months ago
Robust multi-pipeline scheduling in low-duty-cycle wireless sensor networks
—Data collection is one of the major traffic pattern in wireless sensor networks, which requires regular source nodes to send data packets to a common sink node with limited end...
Yongle Cao, Shuo Guo, Tian He