Quasi-optimal algorithms for input buffered ATM switches

被引：1

作者：

Marsan, MA ^{[1
]}

Bianco, A ^{[1
]}

Leonardi, E ^{[1
]}

Milia, L ^{[1
]}

机构：

[1] Politecn Torino, Dipartimento Elettron, Turin, Italy

来源：

THIRD IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, PROCEEDINGS | 1998年

关键词：

D O I：

10.1109/ISCC.1998.702543

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper presents and evaluates a quasi-optimal policy for input buffered ATM switches, named RPA (Reservation with Preemption and Acknowledgment), comprising an input queuing discipline and a cell scheduling algorithm. RPA is based on reservation rounds Ic here the switch input ports can indicate their most urgent cell transfer needs, possibly overwriting less urgent requests by other input ports, and an acknowledgment round to allow input ports to determine what cell they can actually transfer toward the desired switch output port. RPA is shown to be simpler than previous proposals of input queuing policies, efficient, and flexible, allowing the support of different traffic classes and packet-mode operations. The effectiveness of RPA is assessed with detailed simulations in uniform, as well as unbalanced, traffic conditions.

引用

页码：336 / 342

页数：7