Purdue CS 63600 - Network Algorithmics (18 pages)

Previewing pages 1, 2, 3, 4, 5, 6 of 18 page document View the full content.
View Full Document

Network Algorithmics



Previewing pages 1, 2, 3, 4, 5, 6 of actual document.

View the full content.
View Full Document
View Full Document

Network Algorithmics

28 views


Pages:
18
School:
Purdue University
Course:
Cs 63600 - Internetworking

Unformatted text preview:

CS 636 Internetworking Ramana Kompella Some slides courtesy of Cristian Estan at University of Wisconsin CS 636 Internetworking Network Algorithmics Interdisciplinary solutions Systems thinking Algorithmic thinking Definition Network algorithmics is the use of an interdisciplinary systems approach seasoned with algorithmic thinking to design fast implementations of network processing tasks at servers routers and other networking devices CS 636 Internetworking Network Bottlenecks How to reconcile ease of use and performance in networking Ease of use achieved via abstractions e g socket interfaces prefix based forwarding Without care such abstractions prone to performance penalty Network algorithmics seeks to address this gap CS 636 Internetworking Endnode algorithmics Computation vs Communication Endnodes are general purpose computers Vertical versus Horizontal Integration Many companies supply subsystems Kernels tolerate unknown and buggy apps Complexity of computation End node protocol functions e g TCP more complex compared to routers CS 636 Internetworking Artifacts of endnode software Structure Complexity and vastness leads to structured modular code Protection Need to protect apps from one another Generality Core routines are most general Scalability Simple data structures that work well under few connections become bottlenecks CS 636 Internetworking Endnode bottlenecks CS 636 Internetworking Router Algorithmics Router used generically for other network devices bridges switches gateways monitors security Typically special purpose devices devoted to networking Little structural overhead within a router Light weight operating system CS 636 Internetworking Forces affecting Routers Scale Scaling in bandwidth and population Services Very success of Internet requires guarantees in performance security and reliability CS 636 Internetworking Router bottlenecks CS 636 Internetworking Warm up example Observation Large frequency of uncommon characters within code Problem



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Network Algorithmics and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Network Algorithmics and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?