Sciweavers

9 search results - page 2 / 2
» Randomized Intrusion-Tolerant Asynchronous Services
Sort
View
SPAA
2009
ACM
14 years 2 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
ICC
2009
IEEE
111views Communications» more  ICC 2009»
14 years 11 days ago
Supporting VCR-Like Operations in Derivative Tree-Based P2P Streaming Systems
— Supporting user interactivity in peer-to-peer streaming systems is challenging. VCR-like operations, such as random seek, pause, fast forward and rewind, require timely P2P ove...
Tianyin Xu, Jianzhong Chen, Wenzhong Li, Sanglu Lu...
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 5 months ago
Window-Based Greedy Contention Management for Transactional Memory
r of Abstraction (invited lecture) . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Barbara Liskov Fast Asynchronous Consensus with Optimal Resilience. . . . . . . . . . . ....
Gokarna Sharma, Brett Estrade, Costas Busch
COMCOM
2004
127views more  COMCOM 2004»
13 years 5 months ago
Traffic splitting in a network: split traffic models and applications
The contemporary high-speed networks, e.g. the Internet and asynchronous transfer mode (ATM) networks provide a convenient and cost-effective communication platform to carry the e...
Huei-Wen Ferng, Cheng-Ching Peng