∫ntegrabℓε ∂iﬀerentiαℓs · unorganised notes, code, and writings of random topics

Ibáñez et al (2010) Fast Path Ethernet Switching: On-demand, Efficient Transparent Bridges for Data Center and Campus Networks (LANMAN)

October 3, 2010 paper

This paper addresses how to use “transparent bridges” to make switching fast. Instead of spanning tree, this uses shortest paths in the topology to forward packets. [more]

Kim et al (2008) Floodless in SEATTLE: A Scalable Ethernet Architecture for Large Enterprises (SIGCOMM)

October 3, 2010 paper

This paper proposes a way to make a floodless Ethernet. [more]

Yu et al (2009) BUFFALO: Bloom Filter Forwarding Architecture for Large Organizations (CoNEXT)

October 3, 2010 paper

This paper proposes a new architecture on how a switch should forward packet, so that it can (1) reduce the memory requirement for storing a forwarding table and (2) reduce the processing time by not looking up the forwarding table. [more]

Myers et al (2004) Rethinking the Service Model: Scaling Ethernet to a Million Nodes (HotNets)

October 2, 2010 paper

This paper tells why Ethernet cannot scale and propose a solution to solve it. [more]

Using SSE (SIMD extension) in GCC

October 2, 2010 blog code

Simply speaking, SSE is vector processing. The way to do is to declare a vector type in GCC: [more]