Statistical performance guarantees in large-scale cross-path packet switch
IEEE/ACM Transactions on Networking (TON)
Performance and Complexity of Multicast Cross-Path ATM Switches
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Providing guaranteed rate services in the load balanced Birkhoff-von Neumann switches
IEEE/ACM Transactions on Networking (TON)
Approximating fluid schedules in crossbar packet-switches and Banyan networks
IEEE/ACM Transactions on Networking (TON)
An efficient packet scheduling algorithm with deadline guarantees for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches
Theoretical Computer Science
Analysis on memory-space-memory clos packet switching network
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
A distributed qos scheduler for smoothing output traffic of input buffered switches
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering
Computer Communications
| Hi-index | 0.07 |
A quasi-static routing scheme called path switching for large-scale ATM packet switch systems is proposed. Previously the Clos network has been used as the model for many large-scale ATM switch architectures, in which the most difficult issue is path and bandwidth assignment for each connection request. The static routing scheme, such as multirate circuit switching, does not fully exploit the statistical multiplexing gain. In contrast, the dynamic routing scheme, such as straight matching, requires slot-by-slot computation of route assignment. Path switching is a compromise of these two routing schemes. It uses a predetermined periodical connection pattern in the central stage, look-ahead selection in the input stage, and output queueing in the last stage. The scheduling of path switching consists of capacity assignment and route assignment. The capacity assignment is constrained by the quality of service of connection requests. The route assignment is based on the timespace interleaving of the coloring of bipartite multigraphs. We show that path switching can handle multirate and multimedia traffic effectively in the Clos network