Abstract — The load-balanced switch architecture is a promising way to scale router capacity. We explained in [1] how it can be used to build a 100Tb/s router with no centralized scheduler, no memory operating faster than the line-rate, no packet missequencing, a 100 % throughput guarantee for all traffic patterns, and an optical switch fabric that simply spreads traffic evenly among linecards. This switch fabric uses optical MEMS switches that are reconfigured only when linecards are added and deleted, allowing the router to function when any subset of linecards is present and working. In [2] we introduced a configuration algorithm that will find a correct configuration of the MEMS switches in polynomial time. However, we found that our al...
[[abstract]]This paper is about load-balancing packets across multiple paths inside a switch, or acr...
Chang et al. [1], [2] consists of two stages. First, a load-balancing stage converts arriving packet...
Abstract—In this paper, we present three algorithms that provide performance guarantees for scheduli...
Abstract — The load-balanced switch architecture is a promis-ing way to scale router capacity. We ex...
Abstract — The load-balanced switch architecture is a promising way to scale router capacity. We exp...
The load-balanced switch architecture is a promising way to scale router capacity. It requires no ce...
The advance of internet applications, such as video streaming, big data and cloud computing, is resh...
A. Background With increasing demand for high speed communications there is an urgent need for high ...
Routers built around a single-stage crossbar and a centralized scheduler do not scale, and (in pract...
Routers built around a single-stage crossbar and a central-ized scheduler do not scale, and (in prac...
As the traffic volume on the Internet increases exponentially, so does the demand for fast switching...
High performance computer and data-centers require PetaFlop/s processing speed and Petabyte storage ...
We consider traffic scheduling in an N × N packet switch with an optical switch fabric, where the fa...
We consider traffic scheduling in an N x N packet switch with an optical switch fabric, where the fa...
In this paper we present three algorithms that provide performance guarantees for scheduling switche...
[[abstract]]This paper is about load-balancing packets across multiple paths inside a switch, or acr...
Chang et al. [1], [2] consists of two stages. First, a load-balancing stage converts arriving packet...
Abstract—In this paper, we present three algorithms that provide performance guarantees for scheduli...
Abstract — The load-balanced switch architecture is a promis-ing way to scale router capacity. We ex...
Abstract — The load-balanced switch architecture is a promising way to scale router capacity. We exp...
The load-balanced switch architecture is a promising way to scale router capacity. It requires no ce...
The advance of internet applications, such as video streaming, big data and cloud computing, is resh...
A. Background With increasing demand for high speed communications there is an urgent need for high ...
Routers built around a single-stage crossbar and a centralized scheduler do not scale, and (in pract...
Routers built around a single-stage crossbar and a central-ized scheduler do not scale, and (in prac...
As the traffic volume on the Internet increases exponentially, so does the demand for fast switching...
High performance computer and data-centers require PetaFlop/s processing speed and Petabyte storage ...
We consider traffic scheduling in an N × N packet switch with an optical switch fabric, where the fa...
We consider traffic scheduling in an N x N packet switch with an optical switch fabric, where the fa...
In this paper we present three algorithms that provide performance guarantees for scheduling switche...
[[abstract]]This paper is about load-balancing packets across multiple paths inside a switch, or acr...
Chang et al. [1], [2] consists of two stages. First, a load-balancing stage converts arriving packet...
Abstract—In this paper, we present three algorithms that provide performance guarantees for scheduli...