IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Routers with a single stage of buffering
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
ATM Input-Buffered Switches with the Guaranteed-Rate Property
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Matching output queueing with a combined input/output-queued switch
IEEE Journal on Selected Areas in Communications
Providing QoS guarantees to unicast and multicast flows in multistage packet switches
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In order to find a more tractable and practical architecture for high-performance routers within current technology and market constraints, the High- Performance Networking Group (HPNG) of Stanford University proposed to build a router just with single stage of buffering, i.e. the scheme of Single-Buffered (SB) routers. Concretely, two different designs of SB routers were proposed by HPNG: one of which was Parallel Shared Memory (PSM) router and the other was Distributed Shared Memory (DSM) router. Although the notion of Single-Buffered routers deserves full credit, the results of HPNG seem just theoretical rather than practical. In this paper, we attempt to make high-performance SB routers practical by introducing a new architecture for the shared memories. We call the resulting SB router as Virtual Output and Input Queued (VOIQ) router. We show that the scheme of VOIQ can eliminate the need for centralized memory management algorithms and allow a fully distributed implementation of SB routers with rich QoS guarantees and the ability to support variable-length packets while retaining low total memory bandwidth and complexity of processing and communication.