Sciweavers

134 search results - page 26 / 27
» Light-Trail Networks: Design and Survivability
Sort
View
INFOCOM
2006
IEEE
13 years 11 months ago
On the Sensitivity of Online Game Playing Time to Network QoS
Abstract— Online gaming is one of the most profitable businesses on the Internet. Among various threats to continuous player subscriptions, network lags are particularly notorio...
Kuan-Ta Chen, Polly Huang, Guo-Shiuan Wang, Chun-Y...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 5 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
MSS
2007
IEEE
86views Hardware» more  MSS 2007»
13 years 12 months ago
RAIF: Redundant Array of Independent Filesystems
Storage virtualization and data management are well known problems for individual users as well as large organizations. Existing storage-virtualization systems either do not suppo...
Nikolai Joukov, Arun M. Krishnakumar, Chaitanya Pa...
MOBIQUITOUS
2008
IEEE
13 years 12 months ago
Context-aware fault tolerance in migratory services
Mobile ad hoc networks can be leveraged to provide ubiquitous services capable of acquiring, processing, and sharing real-time information from the physical world. Unlike Internet...
Oriana Riva, Josiane Nzouonta, Cristian Borcea
FOCS
2008
IEEE
14 years 1 days ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna