aboutsummaryrefslogtreecommitdiff
path: root/progress/net-apps.tex
diff options
context:
space:
mode:
authorHolden Rohrer <holden.rohrer@gmail.com>2019-10-21 22:58:56 -0400
committerHolden Rohrer <holden.rohrer@gmail.com>2019-10-21 22:58:56 -0400
commit1a3e971805c9ef515695f7688ed6000dfafbf369 (patch)
treed8dc2b54d2e073d78364b274e219d688f8cabeee /progress/net-apps.tex
parent602c2e5d25c93a48e39ddd644f6eed530b921908 (diff)
Network Robustness
Diffstat (limited to 'progress/net-apps.tex')
-rw-r--r--progress/net-apps.tex3
1 files changed, 3 insertions, 0 deletions
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).