Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Optimal information dispersal for probabilistic latency targets
Marvin K. Nakayama
, Bülent Yener
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
2
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Optimal information dispersal for probabilistic latency targets'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Latency
100%
Redundancy
100%
Optimal Information
100%
Information Dispersal
100%
Delay Constraint
66%
Analytical Results
33%
Quality of Service Guarantee
33%
Redundant Information
33%
Intermediate Node
33%
Success Probability
33%
Multipath Routing
33%
Loss Rate
33%
Computational Results
33%
Quality of Service Routing
33%
Disjoint Paths
33%
Rabin
33%
Information Dispersal Algorithm
33%
File Size
33%
Engineering
Quality of Service
100%
Nodes
50%
Redundant Information
50%
Intermediate Node
50%
Optimal Value
50%
Multipath Routing
50%
Rate Loss
50%
Success Probability
50%
File Size
50%
Computer Science
Quality of Service
100%
Service Guarantee
50%
Success Probability
50%
Multipath Routing
50%