Sciweavers

1497 search results - page 247 / 300
» A Computational Model for Message Passing
Sort
View
FSEN
2007
Springer
14 years 2 months ago
Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata
Abstract. A communication protocol consists of a sequence of messages used by peer entities to communicate. Each entity in a network is equipped by at least one protocol stack. Due...
Mahdi Niamanesh, Rasool Jalili
ICALP
2007
Springer
14 years 2 months ago
Ring Signatures of Sub-linear Size Without Random Oracles
Ring signatures, introduced by Rivest, Shamir and Tauman, enable a user to sign a message anonymously on behalf of a “ring”. A ring is a group of users, which includes the sign...
Nishanth Chandran, Jens Groth, Amit Sahai
INFOCOM
2006
IEEE
14 years 2 months ago
Loss-Cognizant Pricing in Feed-Forward Networks with Greedy Users
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
Ashraf Al Daoud, Murat Alanyali
ISPDC
2006
IEEE
14 years 2 months ago
MojaveFS: Providing Sequential Consistency in a Distributed Objects System
This paper presents MojaveFS, a distributed file system with support for sequential consistency. It provides location transparency and makes use of replication for reliability an...
Cristian Tapus, David A. Noblet, Vlad Grama, Jason...
CSCW
2006
ACM
14 years 1 months ago
Sandboxes: supporting social play through collaborative multimedia composition on mobile phones
Media sharing over mobile devices is quickly becoming a common practice, used to support a variety of social processes. Most existing systems employ a model of sharing that treats...
David Fono, Scott Counts