Sciweavers

661 search results - page 27 / 133
» Bandwidth Sharing: Objectives and Algorithms
Sort
View
ESA
2003
Springer
81views Algorithms» more  ESA 2003»
15 years 2 months ago
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting
We consider the transmission of a movie over a broadcast network to support several viewers who start watching at arbitrary times, after a wait of at most twait minutes. A recent a...
Therese C. Biedl, Erik D. Demaine, Alexander Golyn...
ICC
2007
IEEE
130views Communications» more  ICC 2007»
15 years 4 months ago
A Distributed Scheme for Responsive Network Engineering
— Optimal bandwidth utilisation together with resilience and recovery from failure are two key drivers for Traffic Engineering (TE) which have been widely addressed by the IP co...
Johannes Göbel, Anthony E. Krzesinski, Dieter...
TDSC
2010
218views more  TDSC 2010»
14 years 8 months ago
Secure Data Objects Replication in Data Grid
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
Manghui Tu, Peng Li, I-Ling Yen, Bhavani M. Thurai...
SPAA
2009
ACM
15 years 6 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
USENIX
1994
14 years 11 months ago
TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems
TreadMarks is a distributed shared memory DSM system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultr...
Peter J. Keleher, Alan L. Cox, Sandhya Dwarkadas, ...