Scribe by Pathik A Solanki
Date: 12/5/2012
Problem I:
1. Answer=8 ns
i.e (40 * 8)bits/40Gbps
2. (c) 2sqrt(2)
Explanation given in previous lectures
3. (e) None of the above
20 nodes is actual answer
Problem II.
Problem III.
6 different equivalent cross p
Page Mode DRAM
To access a byte one needs to access the whole page.
High Price paid initially in terms of time taken to get the first byte , but the successive ones are
pretty quick.
Memory Interleaving Used to compensate for the slow speed of DRAM
Memo
CS7260 Internet Architecture and Protocols
Association Rule mining problem
th
Nov 19 2012
Scribe by Arvinder S Saini
In this lecture we talked about the Association Rule mining problem. Suppose the
8/24/12
Selector
Image of a selector:
Reference: http:/www.edwardbosworth.com/My5155Text_V07_HTM/MyText5155_Ch06_V07.htm
Barrel shifter
Image of 4 bit barrel shifter where C = 1:
Reference: http:/www.edwardbosworth.com/
Calculating Stack Distances
Efficiently
George Almasi,Calin Cascaval,David Padua
cfw_galmasi,cascaval,[email protected]
What this talk is, and is not, about
This talk is about:
Algorithms to calculate
stack distance
histograms
Speed/memory
optimization
Homework 1: Scanning (Solutions)
CS4240
Mayank Parasar
GTID: 902978052
February 10, 2017
Question 1: For each of the language described below in prose, write a regular expression that
matches the language.
Solution 1
Part 1:
[2]+ [1] [0]  [2] [1]+ [0] 
Homework 2: Application of Scanners and Parsers (50 points)
Question 1 (30 points) The following grammar G (reproduced from the Lecture 0 slides) defines a language of
simple imperative programs. Each program consists of a sequence of formal parameters, a
Design and Analysis of Network/Router Algorithms and Hardware
CS 7260

Fall 2013
CS 7260 INTERNET ARCHITECTURE AND PROTOCOLS
Scribe for 10/26/2012 by Fernando Medina
On the last lecture, we had found that the expectation ! () = 1
. Then, we
started working on another way to get a different value for ! () ,
Design and Analysis of Network/Router Algorithms and Hardware
CS 7260

Fall 2013
CS 7260 Internet Architecture and Protocols (IAP)
Scribe: Ashwin Kumble
Date: Oct 8th 2012.
Generalized Processor Sharing (GPS) Packet Scheduling.
Every packet has a real start time and real finish time given as t with unit in
seconds as well as virtual s
Design and Analysis of Network/Router Algorithms and Hardware
CS 7260

Fall 2013
Internet Architecture and Protocols CS 7260
Scribe Notes for 10/19/2012 by Sriram Madapusi Vasudevan
Note:
The following notes will deal with the proof for the Head of Line blocking with input
queuing along with saturated throughput to be 2 2.
Basic Prob
Design and Analysis of Network/Router Algorithms and Hardware
CS 7260

Fall 2013
CS 7260 INTERNET ARCHITECTURE AND PROTOCOLS
Scribe for 09/17/2012 by Harshal Chaudhari
1. Grid of tries with switch pointers:
Figure 1.Grid of tries without switching pointers
Previously we have seen 2 naive packet classification algorithms and then best
Design and Analysis of Network/Router Algorithms and Hardware
CS 7260

Fall 2013
Network Algorithmics: Lecture Notes for 10/10/2012
Taken By: Shradha Kohli
Deficit Round Robin:
In this technique, each flow is considered compared to the quantum size. The
pointer goes to the foremost packet in each flow once, comparing the size of
that
CS7260 Scribe Notes: IP Lookup
By Xiang Fu
September 5, 2012
1. Previous
IP Lookup: Triecfw_
2. Multibit Trie
Given a set of rules, give an upper limit on the # of memory accesses (at most k times).
How to minimize the storage cost?
2.1 FixedStride Tri
CS 7260 Scribe  09/12/2012
Vinay Bharadwaj
The lecture covered getaround solutions to IP lookup. Since IP lookup is expensive, programmers usually
try to find workarounds to avoid performing IP lookup as much as possible.
Some of the workarounds proposed
CS 7260  Internet Architecture & Protocols
Scribe 8/27
As discussed in the last class, In the case of priority encoder If Input = 0, the output is 0
If Input = 1, the output is 1
Programmable Priority Encoder
In Programmable Priority Encoder (PPE) there
CS 7260 9/14/2012
Anuprem Chalvadi
Packet classification is difficult for four fields ( Source and Destination IPs, source and destination Ports).
Hence, packet classification for two fields namely, source and distimation IPs, is presented with three
data
CS 7260 Lecture 8 Notes
Notes by Daewon Lee
Quick review of the previous lecture
Completely expanding a TRIE at a node corresponds to a lookup table at the said node, which contains
2height(r), where r is the said root node. This can be expressed as follo
CS 7260  Internet Architecture & Protocols
Scribe 8/31
A packet, once it arrives at a router, follows a forwarding path to a destination port. The
various methods through which it determines the destination address of this port and
reaches it is what we
Taken by: Nate Barish
Network Algorithms Lecture Notes 9102012
Announcement: Remote students will not need to scribe but still need to do the special HW assignment.
Binary Search on Prefix Length
Goal: What is the longest prefix match given an IP addres
CS 7260 Internet Architectures and Protocols
December 3 2012 Lecture
By Mohan M Sitaram
Token Bucket Algorithm
Let
i = size of the bucket
ri = Rate at which the bucket is filled
* The filling rate corresponds to how much the network allows you to transmit
CS 7260 Internet Architecture and Protocols
Lecture of 2Nov2012
Raghavendra Pai
This lecture distinguishes the standard WFQ implementation from a new one. I
shall refer to the old algorithm as Standard and the new one as New
(implementation).
There is u
Name : Manoj Kumar Panguluru
Lecture Date : 8/22/2012
General Architecture of Router:
LC : Line Card
SF : Switching Fabric
RP: Route Processor
Input
LC
LC
LC
LC
SF
RP
LC
LC
Line Card performs both the input and output functionalities.
Every router has one
CS 7260 Internet Architecture and Protocols
Scribe notes for 21Sep2012
Taken by Ajay Raghav, Gurubabu
Extended grid of tries
The Worst case complexity for packet classification on k fields can be quite bad when the value of
k is high and the number of r
21 November 2012
Scribe Notes Sundararajan Sarangan
Last time we talked about how data streaming works.
A Quick Summary:
We have a 2D gigantic table which is a binary table. (0s and 1s). We also have a Transaction ID Field. For
every two columns we need
Design and Analysis of Network/Router Algorithms and Hardware
CS 7260

Fall 2013
Khale, Anish Oct 05, 2012
Packet Scheduling
CS 7260
Generalized Processor Sharing
Generalized Processor Sharing (GPS), also called Infinitesimal Round Robin algorithm, is a
packet scheduling algorithm developed to decongest communication links of a netwo
Design and Analysis of Network/Router Algorithms and Hardware
CS 7260

Fall 2013
CS 7260 INTERNET ARCHITECTURE AND PROTOCOLS
Scribe for 09/19/2012 by Anjana Ganesh
1. Oversimplified configuration of an Enterprise Firewall:
The above diagram shows an oversimplified configuration of an enterprise firewall. (In reality,
firewalls are muc
Design and Analysis of Network/Router Algorithms and Hardware
CS 7260

Fall 2013
Internet Architecture and protocols (Lecture scribe by Harish Kanakaraju)
October 1, 2012
Parallel Iterative matching:
It is a natural consequence of VOQ.
With out VOQ