| Document Date: 2014-08-28 10:26:44
Open Document File Size: 790,71 KBShare Result on Facebook
Company I. I NTRODUCTION Networks / Intel / / / Facility Johns Hopkins University / Purdue University / / IndustryTerm greedy solution / realistic solution / wireless context / online assignments / greedy algorithms / cloud infrastructure / online scenario / Online Diversity Assignment Problem / near-optimal solutions / online version / greedy algorithm / wireless contexts / random solution / assignment algorithm / deterministic polynomial time algorithm / software versions / network operator / online manner / greedy approximation algorithm / intrusion-tolerant infrastructure / variant assignment solution / random algorithm / branch-and-bound algorithm / byzantine tolerant routing protocol / diverse software / search space / assignment algorithms / online versions / intrusion-tolerant protocols / cloud services / / OperatingSystem FreeBSD / MacOS / Linux / / Organization Department of Computer Science / Johns Hopkins University / Purdue University / / Position administrator / network graph representative / general network resiliency / / Technology particular variant assignment Algorithm / assignment algorithms / three algorithms / intrusion-tolerant protocols / greedy approximation algorithm / Linux / 1 Greedy assignment algorithm / byzantine tolerant routing protocol / 8 Algorithm / greedy algorithm / random algorithm / simulation / operating system / operating systems / branch-and-bound algorithm / 18 20 22 24 Routers / 0.5 8 10 12 Routers / deterministic polynomial time algorithm / / URL http /
SocialTag |
1 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, P