Sciweavers

1454 search results - page 272 / 291
» Distributed Robust Optimization for Communication Networks
Sort
View
STACS
2005
Springer
14 years 26 days ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
GLOBECOM
2009
IEEE
13 years 11 months ago
Experimental Validation of Periodic Codes for PON Monitoring
In this paper we investigate both experimentally and via simulation the monitoring of fiber link quality in a PON using optical coding technology. We use a new, simple and costeffe...
Mohammad M. Rad, Habib Fathallah, Sophie LaRochell...
PODC
2003
ACM
14 years 20 days ago
Asynchronous resource discovery
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
Ittai Abraham, Danny Dolev
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 7 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
SIGCOMM
2012
ACM
11 years 9 months ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey