Journal ArticleDOI
Load balanced Birkhoff-von Neumann switches, part I
TLDR
A switch architecture with two-stage switching fabrics and one- stage switching fabrics that scales up with the speed of fiber optics is proposed.About:Â
This article is published in Computer Communications.The article was published on 2002-04-01. It has received 232 citations till now. The article focuses on the topics: Load-balanced switch & Von Neumann architecture.read more
Citations
More filters
Journal ArticleDOI
VL2: a scalable and flexible data center network
Albert Greenberg,James R. Hamilton,Navendu Jain,Srikanth Kandula,Changhoon Kim,Parantap Lahiri,David A. Maltz,Parveen Patel,Sudipta Sengupta +8 more
TL;DR: VL2 is a practical network architecture that scales to support huge data centers with uniform high capacity between servers, performance isolation between services, and Ethernet layer-2 semantics and can be deployed today, and a working prototype is built.
Journal ArticleDOI
Load balanced Birkhoff-von Neumann switches, part II: multi-stage buffering
TL;DR: The main objective of this sequel is to solve the out-of-sequence problem that occurs in the load balanced Birkhoff-von Neumann switch with one-stage buffering by adding a load-balancing buffer in front of the first stage and a resequencing-and-output buffer after the second stage.
Proceedings ArticleDOI
Scaling internet routers using optics
Isaac Keslassy,Shang-Tse Chuang,Kyoungsik Yu,David A. B. Miller,Mark Horowitz,Olav Solgaard,Nick McKeown +6 more
TL;DR: This paper considers how optics can be used to scale capacity and reduce power in a router, and describes two different implementations based on technology available within the next three years.
Proceedings ArticleDOI
RotorNet: A Scalable, Low-complexity, Optical Datacenter Network
William M. Mellette,Rob McGuinness,Arjun Roy,Alex Forencich,George C. Papen,Alex C. Snoeren,George Porter +6 more
TL;DR: While RotorNet dynamically reconfigures its constituent circuit switches, it decouples switch configuration from traffic patterns, obviating the need for demand collection and admitting a fully decentralized control plane.
Proceedings ArticleDOI
Maintaining packet order in two-stage switches
Isaac Keslassy,Nick McKeown +1 more
TL;DR: This paper presents an algorithm called full frames first (FFF), that prevents mis-sequencing while maintaining the performance benefits (in terms of throughput and delay) of the basic two-stage switch.
References
More filters
Journal ArticleDOI
On the self-similar nature of Ethernet traffic (extended version)
TL;DR: It is demonstrated that Ethernet LAN traffic is statistically self-similar, that none of the commonly used traffic models is able to capture this fractal-like behavior, and that such behavior has serious implications for the design, control, and analysis of high-speed, cell-based networks.
Journal ArticleDOI
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
Abhay Parekh,Robert G. Gallager +1 more
TL;DR: Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments.
Proceedings ArticleDOI
Analysis and simulation of a fair queueing algorithm
TL;DR: It is found that fair queueing provides several important advantages over the usual first-come-first-serve queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth and protection from ill-behaved sources.
Journal ArticleDOI
High-speed switch scheduling for local-area networks
TL;DR: Issues in the design of a prototype switch for an arbitrary topology point-to-point network with link speeds of up to 1 Gbit/s are described and a technique called statistical matching is described, which can be used to ensure fairness at the switch and to support applications with rapidly changing needs for guaranteed bandwidth.
Proceedings ArticleDOI
Achieving 100% throughput in an input-queued switch
TL;DR: This paper proves that if a suitable queueing policy and scheduling algorithm are used then it is possible to achieve 100% throughput for all independent arrival processes.