diff options
| -rw-r--r-- | progress/Network.tex | 3 | ||||
| -rw-r--r-- | progress/net-apps.tex | 3 | ||||
| -rw-r--r-- | progress/progress.tex | 2 |
3 files changed, 8 insertions, 0 deletions
diff --git a/progress/Network.tex b/progress/Network.tex new file mode 100644 index 0000000..d165a01 --- /dev/null +++ b/progress/Network.tex @@ -0,0 +1,3 @@ +Network connectivity is usually an issue on a local scale: one router or modem or device has a broken component---usually software that needs to be reset in one way or another. However, it rears its head on a very large scale as well: routing connections, as mentioned earlier, relies on the ability to communicate with at least one ``neighbor'' on the network, which is fine unless that neighbor goes down for whatever reason. And in non-decentralized systems, such as modern ISPs, that's exactly what happens: a software bug or power outage or any sort of problem tanks an entire area's coverage for hours to days. + +\sinclude Combinatorics Applications:net-apps diff --git a/progress/net-apps.tex b/progress/net-apps.tex new file mode 100644 index 0000000..49000a4 --- /dev/null +++ b/progress/net-apps.tex @@ -0,0 +1,3 @@ +Graphs, as noted in the textbook, describe similar situations very well: a member of the internet could draw out every other user and their connections as a graph, and that graph has measurable robustness. For a given service like Amazon AWS or Microsoft Azure, the service's connection to the rest of the web relies on hundreds of smaller connections in a distributed network across the nation. + +We want to, using graph theory, study the reliability of those services in terms of bridges or $k$-connectivity, as well as how that could be improved (especially for the consumer market). diff --git a/progress/progress.tex b/progress/progress.tex index ef5d722..a8b7b39 100644 --- a/progress/progress.tex +++ b/progress/progress.tex @@ -7,4 +7,6 @@ \include RSA Algorithm:RSA +\include Network Robustness:Network + \bye |