> On Oct 8, 2018, at 7:23 AM, vineet deshpande <[email protected]>
> wrote:
>
> I have re-written the document removing the buzz words
The buzzwords are still there.
They are exceeded only by the amount and extent of factual errors - a *partial*
list of which is noted below.
Joe
-----
Section 2:
- MIMO can occur with refraction or partial reflection; it does not
need total internal reflection
- MIMO requires multiple transmitters, whereas multipath routing can be
leveraged using only one network interface
Section 3:
- “machine” and “host” imply more similarity then difference
- the Von Neumann bottleneck would be an artifact of a machine
implementation; non-Von architectures, such as dataflow, do not suffer this
fate (and are used in high-performance routers)
Section 4 (which isn’t even written out as paragraphs):
- OSPF is incremental computation of a Ford-Fulkerson graph based on
local information; whether code uses a heap, a stack, or any other data
structure is an implementation detail
- classful routing hasn’t been used in IPv4 since the early 1990s and
CIDR; it was never part of IPv6
- BGP runs OSPF on a graph transformation, where the networks of
Autonomous Systems collapse to nodes in the transformed graph; nodes are not
“inserted”, but computed
- a tree is a UAG where each node can have only one parent; while all
trees are UAGs, not all UAGs are trees
- A UAG whose underlying graph is a tree is — a tree.
- BGP computes a graph determined by AS interconnectivity; whether this
graph is strongly connected or not depends on the AS connectivity alone
----_______________________________________________
Int-area mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/int-area
