| Document Date: 2013-09-18 16:37:33
Open Document File Size: 530,40 KBShare Result on Facebook
Company I. I NTRODUCTION Networks / Intel / / / Facility Johns Hopkins University / Purdue University / / IndustryTerm greedy solution / Online DAP / realistic solution / wireless context / online assignments / greedy algorithms / cloud infrastructure / online scenario / Online Diversity Assignment Problem / online version / random wireless topologies / greedy algorithm / wireless contexts / random solution / assignment algorithm / deterministic polynomial time algorithm / software versions / online manner / greedy approximation algorithm / intrusion-tolerant infrastructure / variant assignment solution / random algorithm / branch-and-bound algorithm / byzantine tolerant routing protocol / diverse software / real-world systems / assignment algorithms / online versions / intrusion-tolerant protocols / cloud services / / OperatingSystem FreeBSD / MacOS / Linux / / Organization Department of Computer Science / Johns Hopkins University / Purdue University / / Person Bob Balzer / / Position administrator / network graph representative / representative / general network resiliency / / Technology assignment algorithms / Byzantine FaultTolerant Protocol / three algorithms / intrusion-tolerant protocols / greedy approximation algorithm / Linux / 1 Greedy assignment algorithm / byzantine tolerant routing protocol / greedy algorithm / random algorithm / variant assignment Algorithm / operating system / operating systems / branch-and-bound algorithm / deterministic polynomial time algorithm / /
SocialTag |
Increasing Network Resiliency by Optimally Assigning Diverse Variants to Routing Nodes Andrew Newell1 , Daniel Obenshain2 , Thomas Tantillo2 , Cristina Nita-Rotaru1 , and Yair Amir2 1 Department of Computer Science at P