Sciweavers

125 search results - page 20 / 25
» Dynamic load balancing experiments in a grid
Sort
View
ISCC
2003
IEEE
138views Communications» more  ISCC 2003»
15 years 2 months ago
Connectivity Aware Routing - a Method for Finding Bandwidth Constrained Paths Over a Variety of Network Topologies
Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in n...
Karol Kowalik, Martin Collier
PODS
2004
ACM
128views Database» more  PODS 2004»
15 years 9 months ago
Replicated Declustering of Spatial Data
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...
Hakan Ferhatosmanoglu, Aravind Ramachandran, Ali S...
ITIIS
2010
137views more  ITIIS 2010»
14 years 7 months ago
Improving the Availability of Scalable on-demand Streams by Dynamic Buffering on P2P Networks
In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable cl...
Chow-Sing Lin
SIGCOMM
2004
ACM
15 years 2 months ago
An algebraic approach to practical and scalable overlay network monitoring
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
Yan Chen, David Bindel, Han Hee Song, Randy H. Kat...
TC
2008
14 years 9 months ago
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
Ming Zhong, Kai Shen, Joel I. Seiferas