A novel switch architecture for high-performance computing and signal processing networks

Sukhtankar, S.; Hecht, D.; Rosen, Warren A.

doi:10.1109/nca.2004.1347780

Cited by 2 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, switch simulations in the literature usually also work with m = 8 to m = 32 ports, see e.g. [26,30]. Our basic setting of m and B is not critical.…”

Section: Resultsmentioning

confidence: 99%

An Experimental Study of New and Known Online Packet Buffering Algorithms

Albers

Jacobs

2008

Algorithmica

View full text Add to dashboard Cite

We present the first experimental study of online packet buffering algorithms for network switches. We consider a basic scenario in which m queues of size B have to be maintained so as to maximize the packet throughput. For this model various online algorithms with competitive factors ranging between 2 and 1.5 were developed in the literature. We first develop a new 2-competitive online algorithm, called HSFOD, which is especially designed to perform well under real-world conditions. In our experimental study we have implemented all the proposed algorithms, including HSFOD, and tested them on packet traces from benchmark libraries. We have evaluated the experimentally observed competitiveness, the running times, memory requirements and actual packet throughput of the strategies. The tests were executed for varying values of m and B as well as varying switch speeds. It shows that greedylike strategies and HSFOD perform best in practice.

show abstract

“…Furthermore, switch simulations in the literature usually also work with m = 8 to m = 32 ports, see e.g. [26,30]. Our basic setting of m and B is not critical.…”

Section: Resultsmentioning

confidence: 99%