dc.contributor.author |
Fotakis, D |
en |
dc.contributor.author |
Spirakis, P |
en |
dc.date.accessioned |
2014-03-01T02:48:43Z |
|
dc.date.available |
2014-03-01T02:48:43Z |
|
dc.date.issued |
1999 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/34044 |
|
dc.subject |
Fault Tolerant |
en |
dc.title |
Efficient Redundant Assignments under Fault-Tolerance Constraints |
en |
heal.type |
conferenceItem |
en |
heal.identifier.primary |
10.1007/978-3-540-48413-4_17 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1007/978-3-540-48413-4_17 |
en |
heal.publicationDate |
1999 |
en |
heal.abstract |
. We consider the problem of constructing minimum congestion, fault-tolerant, redundantassignments of objects to faulty parallel delivery channels. In particular, we are givena set M of faulty channels, each having an integer capacity c i and failing independently withprobability f i . All the channels have the same source s and destination t, and, in case of failure,a channel delivers |
en |
heal.journalName |
Randomization and Approximation Techniques in Computer Science |
en |
dc.identifier.doi |
10.1007/978-3-540-48413-4_17 |
en |