Sciweavers

5658 search results - page 1087 / 1132
» An Efficient Counting Network
Sort
View
CN
2004
122views more  CN 2004»
13 years 8 months ago
Group rekeying with limited unicast recovery
In secure group communications, a key server can deliver a "grouporiented" rekey message [22] to a large number of users efficiently using multicast. For reliable delive...
X. Brian Zhang, Simon S. Lam, Dong-Young Lee
COMCOM
2004
110views more  COMCOM 2004»
13 years 8 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu
CCR
1998
140views more  CCR 1998»
13 years 8 months ago
Policy tree multicast routing: an extension to sparse mode source tree delivery
Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scal...
Horst Hodel
PVLDB
2008
205views more  PVLDB 2008»
13 years 8 months ago
Making SENSE: socially enhanced search and exploration
Online communities like Flickr, del.icio.us and YouTube have established themselves as very popular and powerful services for publishing and searching contents, but also for ident...
Tom Crecelius, Mouna Kacimi, Sebastian Michel, Tho...
TPDS
2008
134views more  TPDS 2008»
13 years 8 months ago
Extending the TokenCMP Cache Coherence Protocol for Low Overhead Fault Tolerance in CMP Architectures
It is widely accepted that transient failures will appear more frequently in chips designed in the near future due to several factors such as the increased integration scale. On th...
Ricardo Fernández Pascual, José M. G...
« Prev « First page 1087 / 1132 Last » Next »