-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcomputer-networks.html
80 lines (70 loc) · 3.53 KB
/
computer-networks.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
<!DOCTYPE HTML>
<html>
<head>
<title>Computer Networks - Eric Weng</title>
<meta charset="utf-8" />
<meta name="viewport" content="width=device-width, initial-scale=1, user-scalable=no" />
<link rel="stylesheet" href="assets/css/main.css" />
<style>
.container, .box { text-align: left; }
</style>
</head>
<body class="is-preload">
<!-- Nav -->
<nav id="nav">
<ul class="container">
<li><a href="index.html">Home</a></li>
<li><a href="computer-networks.html">Computer Networks</a></li>
<!-- Add other navigation links as needed -->
</ul>
</nav>
<!-- Main Content -->
<article class="wrapper style2">
<div class="container">
<header>
<h2>Computer Networks Projects</h2>
<p>A showcase of my computer networks projects.</p>
</header>
<!-- Project 1: Spanning Tree Protocol for Network Switches -->
<section class="box">
<h3>Spanning Tree Protocol for Network Switches</h3>
<p>A distributed algorithm with formal communication rules that enables network nodes to build up a global picture of the network topology using only local message passing. The Spanning Tree Protocol solves the problem of providing redundancy and resilience in a computer network while avoiding infinitely looping communications and broadcast storms.</p>
</section>
<!-- Project 2: Distance Vector Routing -->
<section class="box">
<h3>Distance Vector Routing</h3>
<p>A fully distributed algorithm of Distance Vector (DV) routing protocols to find shortest paths by solving the Bellman-Ford equation at each node</p>
</section>
<!-- Project 3: SDN Firewall -->
<section class="box">
<h3>SDN Firewall</h3>
<p>Implement and test an externally configurable firewall in Mininet using SDN, defining rules in code that describes what network traffic is disallowed based on communications protocols and on parameters of the network topology.</p>
</section>
<!-- Project 4: BGP Hijacking -->
<section class="box">
<h3>BGP Hijacking</h3>
<p>Simulate the vulnerability of the Border Gateway Protocol (BGP) to cyber-attacks. In a Mininet emulation, events are reproduced in code where a victim Internet provider is induced to route traffic bound for a specified network destination instead to a malicious entity.</p>
</section>
<!-- Project 5: BGP Measurements -->
<section class="box">
<h3>BGP Measurements</h3>
<p>Use PyBGPStream to interact with the BGP protocol using a newly developed tool that gives us the option to both browse BGP data in real-time and go back in time and browse through historic BGP data.</p>
</section>
</div>
</article>
<!-- Footer -->
<footer id="footer" class="wrapper style4">
<div class="container">
<p>© Eric Weng. All rights reserved.</p>
<!-- Additional footer content -->
</div>
</footer>
<!-- Scripts -->
<script src="assets/js/jquery.min.js"></script>
<script src="assets/js/jquery.scrolly.min.js"></script>
<script src="assets/js/browser.min.js"></script>
<script src="assets/js/breakpoints.min.js"></script>
<script src="assets/js/util.js"></script>
<script src="assets/js/main.js"></script>
</body>
</html>