High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Flexible bandwidth allocation in high-capacity packet switches
IEEE/ACM Transactions on Networking (TON)
Switching and Traffic Theory for Integrated Broadband Networks
Switching and Traffic Theory for Integrated Broadband Networks
The Mathematical Theory of Nonblocking Switching Networks
The Mathematical Theory of Nonblocking Switching Networks
Concurrent round-robin-based dispatching schemes for Clos-network switches
IEEE/ACM Transactions on Networking (TON)
Tiny Tera: A Packet Switch Core
IEEE Micro
Symmetric Crossbar Arbiters for VLSI Communication Switches
IEEE Transactions on Parallel and Distributed Systems
Analysis of the parallel packet switch architecture
IEEE/ACM Transactions on Networking (TON)
Design of a Gigabit ATM Switch
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Scaling internet routers using optics
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Load balanced Birkhoff-von Neumann switches, part II: multi-stage buffering
Computer Communications
Scheduling of multicast traffic in high-capacity packet switches
IEEE Communications Magazine
Guest editorial - 50th anniversary of clos networks
IEEE Communications Magazine
Routing with load balancing: increasing the guaranteed node traffics
IEEE Communications Letters
Optimal capacity allocation for load balanced shortest path routing
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
A parallel packet switch supporting differentiated QoS based on weighted layer assignment
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Two phase load balanced routing using OSPF
IEEE Journal on Selected Areas in Communications
Hedera: dynamic flow scheduling for data center networks
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Improving datacenter performance and robustness with multipath TCP
Proceedings of the ACM SIGCOMM 2011 conference
Green Networking With Packet Processing Engines: Modeling and Optimization
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
The size of a single-hop cross-bar fabric is still limited by the technology, and the fabrics available on the market do not exceed the terabit capacity. A multihop fabric such as Clos network provides the higher capacity by using the smaller switching elements (SE). When the traffic load is balanced over the switches in a middle stage, all the traffic would get through the fabric, as long as the switch outputs are not overloaded. However, the delay that packets experience through the Clos switch depends on the granularity of flows that are balanced. We examine the maximum fabric utilization under which a tolerable delay is provided for various load balancing algorithms, and derive the general formula for this utilization in terms of the number of flows that are balanced. We show that the algorithms which balance flows with sufficiently coarse granularity provide both high fabric utilization and delay guarantees to the most sensitive applications. Since no admission control should be performed within the switch, the fast traffic-pattern changes can be accommodated in the proposed scalable architecture.