NXG05-6: Minimum Delay Scheduling in Scalable Hybrid Electronic/Optical Packet Switches
Bin Wu,K.L. Yeung +1 more
- pp 1-5
Reads0
Chats0
TLDR
It is shown that the existing speedup bound for QLEF is not tight enough, and a new bound which is 10% lower than the existing one is derived.Abstract:
A hybrid electronic/optical packet switch consists of electronically buffered line-cards interconnected by an optical switch fabric. It provides a scalable switch architecture for next generation high-speed routers. Due to the non-negligible switch reconfiguration overhead, many packet scheduling algorithms are invented to ensure performance guaranteed switching (i.e. 100% throughput with bounded packet delay), at the cost of speedup. In particular, minimum delay performance can be achieved if an algorithm can always find a schedule of no more than N configurations for any input traffic matrix, where N is the switch size. Various minimum delay scheduling algorithms (MIN, alphai-SCALE and QLEF) are proposed. Among them, QLEF requires the lowest speedup bound. In this paper, we show that the existing speedup bound for QLEF is not tight enough. A new bound which is 10% lower than the existing one is derived.read more
Citations
More filters
Proceedings ArticleDOI
Scheduling techniques for hybrid circuit/packet networks
He Liu,Matthew K. Mukerjee,Conglong Li,Nicolas Feltman,George Papen,Stefan Savage,Srinivasan Seshan,Geoffrey M. Voelker,David G. Andersen,Michael Kaminsky,George Porter,Alex C. Snoeren +11 more
TL;DR: The hybrid switching problem is formalized, the design space of scheduling algorithms are explored, and insight on using such algorithms in practice is provided, including a heuristic-based algorithm, Solstice, that provides a 2.9× increase in circuit utilization over traditional scheduling algorithms, while being within 14% of optimal, at scale.
Journal Article
Costly circuits, submodular schedules and approximate Carathéodory Theorems
TL;DR: In this paper, the authors propose a scheduling algorithm for hybrid switches that trades-off reconfiguration costs with the benefits of reconfigurations that match the traffic demands, in which a high bandwidth circuit switch (optical or wireless) is used in conjunction with a low bandwidth packet switch.
Proceedings ArticleDOI
Costly Circuits, Submodular Schedules and Approximate Carathéodory Theorems
TL;DR: A lightweight, simple and nearly-optimal scheduling algorithm that trades-off reconfiguration costs with the benefits of reconfigurations that match the traffic demands and achieves a performance at least half that of the optimal schedule.
Journal ArticleDOI
Minimizing internal speedup for performance guaranteed switches with optical fabrics
TL;DR: A generic approach to decompose a traffic matrix into an arbitrary number of Ns and it is shown that the algorithmic efficiency of ADAPT can be improved by better utilizing the switch bandwidth, which leads to a more efficient algorithm SRF (Scheduling Residue First).
Journal ArticleDOI
Costly circuits, submodular schedules and approximate Carathéodory Theorems
TL;DR: This paper shows that indirect routing leads to exponential connectivity; this is another phenomenon of the power of multi-hop routing, distinct from the well-known load balancing effects.
References
More filters
Journal ArticleDOI
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
John E. Hopcroft,Richard M. Karp +1 more
TL;DR: This paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to $(m + n)\sqrt n $.
Proceedings ArticleDOI
A n5/2 algorithm for maximum matchings in bipartite
John E. Hopcroft,Richard M. Karp +1 more
TL;DR: In this paper, a bipartite graph with n vertices and m edges was constructed in a number of computation steps proportional to (m+n) n, where n is the number of edges in the graph.
Journal ArticleDOI
Free-space micromachined optical switches with submillisecond switching time for large-scale optical crossconnects
TL;DR: In this article, the free-space micromachined optical switches (FS-MOS) demonstrated in this paper represent a means of filling this network need by combining the advantages of free-rotating hinged micromirrors with the virtues of integrated optics.
Journal ArticleDOI
Next generation routers
TL;DR: Several algorithms/architectures to implement IP route lookup, packet classification, and switch fabrics can be implemented with emerging network processors that have the advantages of providing flexibility to new applications and protocols, shortening the design cycle and time-to-market, and reducing the implementation cost by avoiding the ASIC approach.
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.