TY - GEN
T1 - Don't let the stack get stuck#x201D;
T2 - 16th IEEE International Conference on High Performance Switching and Routing, HPSR 2015
AU - Yallouz, Jose
AU - Blocq, Gideon
AU - Revah, Yoram
AU - Kadosh, Aviran
AU - Orda, Ariel
N1 - Publisher Copyright: © 2015 IEEE.
PY - 2016/6/1
Y1 - 2016/6/1
N2 - Stackable Routers, i.e. a class of independent routing units operating together as a single router, constitute an affordable scalable approach for coping with the growing networking requirements of organizations. In this study, we investigate several design problems of stackable routers and develop novel schemes for improving their performance. First, we formalize a mathematical model for optimizing the network topology in terms of throughput and delay, while obeying constraints in the number of ports of each internal routing unit. We then consider the problem of minimizing the diameter of the interconnection topology, as a measure of maximum delay, and establish efficient near-to optimal (explicit) topologies. Furthermore, we also consider the problem of maximizing the throughput of a stackable router. We show its hardness and derive bounds for the optimal solution. While, traditionally, the different routing units of a stackable router are linked together in a ring topology, through simulations we show that a major improvement in the diameter of stackable routers can be accomplished even through the employment of randomly-generated topologies. Finally, we investigate the basic problem of constructing a feasible stackable router and establish some fundamental properties of the required structure of the routing units.
AB - Stackable Routers, i.e. a class of independent routing units operating together as a single router, constitute an affordable scalable approach for coping with the growing networking requirements of organizations. In this study, we investigate several design problems of stackable routers and develop novel schemes for improving their performance. First, we formalize a mathematical model for optimizing the network topology in terms of throughput and delay, while obeying constraints in the number of ports of each internal routing unit. We then consider the problem of minimizing the diameter of the interconnection topology, as a measure of maximum delay, and establish efficient near-to optimal (explicit) topologies. Furthermore, we also consider the problem of maximizing the throughput of a stackable router. We show its hardness and derive bounds for the optimal solution. While, traditionally, the different routing units of a stackable router are linked together in a ring topology, through simulations we show that a major improvement in the diameter of stackable routers can be accomplished even through the employment of randomly-generated topologies. Finally, we investigate the basic problem of constructing a feasible stackable router and establish some fundamental properties of the required structure of the routing units.
UR - http://www.scopus.com/inward/record.url?scp=84978209212&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/HPSR.2015.7483081
DO - https://doi.org/10.1109/HPSR.2015.7483081
M3 - منشور من مؤتمر
T3 - IEEE International Conference on High Performance Switching and Routing, HPSR
BT - 2015 IEEE 16th International Conference on High Performance Switching and Routing, HPSR 2015
Y2 - 30 June 2015 through 4 July 2015
ER -