Packet dispatching algorithms with static desynchronization for three-stage buffered clos-network switches

• Autorzy: Kleban J. , Santos H.
• Języki publikacji: EN

Abstrakty

EN

The Internet cannot continue to scale-up to higher data rates and to support for differentiated services without network nodes (switches/routers) with high-speed interfaces and large switching capacity. Network nodes are still the critical bottleneck in the Internet. The main part of each switching node is a switching fabric, which provides connecting paths between input and output lines. For high-performance switches and routers the Clos-network is very attractive because of its modular architecture and scalability. In packet switching systems it adopted the use of packet dispatching algorithms to avoid packet contention, which may occur while a packet is being routed in a switching fabric. Different dispatching schemes for buffered Clos-network switches were proposed in many papers. Most of them consist of request, grant and accept phases, and cannot work in real environment. In this paper two algorithms called Static Desynchronization (SD) and Maximal Matching Static Desynchronization (MMSD) for three-stage buffed Clos-network switches are proposed. These algorithms are easy to implement in hardware and perform well for a wide range of traffic load per input port. The performance of the proposed algorithms was evaluated and compared with results obtained for CRRD (Concurrent Round-Robin Dispatching) and CMSD (Concurrent Master-Slave Round-Robin Dispatching) schemes.

Słowa kluczowe

EN

Clos-network; packet switching; dispatching algorithm

• Wydawca: Oficyna Wydawnicza Politechniki Wrocławskiej
• Czasopismo: Systems Science
• Rocznik: 2006
• Tom: Vol. 32, no 3
• Strony: 119--125
• Opis fizyczny: Bibliogr. 14 poz., wykr.

Twórcy

autor

Kleban J.

autor

Santos H.

• Poznań University of Technology ul. Piotrowo 3A, 60-965 Poznań, Poland,

Bibliografia

• [1] Anderson T. et al., High-speed switch scheduling for local-area networks, ACM Trans, on Computer Systems, Vol. 11, No. 4, 1993, pp. 319-352.
• [2] Chao H.J., Saturn: A terabit packet switch using dual round-robin, IEEE Communications Mag., Vol. 38, No. 12, 2002, pp. 78-84.
• [3] Chao H.J., Lam C.H., Oki E., Broadband Packet Switching Technologies: A Practical Guide to ATM Switches and IP Routers, Willey, New York, 2001.
• [4] Clos C., A Study of Non-Blocking Switching Networks, Bell Sys. Tech. Jour., 1953, pp. 406-424.
• [5] Hui J.Y., Arthurs E., A Broadband Packet Switch for Integrated Transport, IEEE J. Sel. Areas Commun., Vol. 5, No. 8, October 1987, pp. 1264-1273.
• [6] Jiang Y., Hamdi M., A fully desynchronized round-robin matching scheduler for a VOQ packet switch architecture, Proc. HPSR 2001, May 2001, pp. 407-411.
• [7] Kleban J., Wieczorek A., CRRD-OG: A packet Dispatching Algorithm with Open Grants for Three-Stage Buffered Clos-Network Switches, Proc. High Performance Switching and Routing 2006, pp. 315-320.
• [8] McKeown N., Mekkittikul A., Anantharam V., Walrand J., Achieving 100% throughput in input-queued switches, IEEE Trans. Commun., Vol. 47, No. 8, 1999, pp. 1260-1267.
• [9] Oki E., Jing Z., Rojas-Cessa R., Chao H. J., Concurrent Round-Robin-Based Dispatching Schemes for Clos-Network Switches. IEEE/ACM Trans. Networking, Vol. 10, No. 6, 2002, pp. 830-844.
• [10] Oki E., Rojas-Cessa R., Chao H. J., A pipeline-based approach for maximal-sized matching scheduling in input-buffered switches. IEEE Commun. Lett., Vol. 5, No. 6. 2001, pp. 263-265.
• [11] Pun K., Hamdi M., Dispatching schemes for Clos-network switches, Computer Networks, No. 44. 2004, pp. 667-679.
• [12] Rojas-Cessa R., Chao H. J., Maximum Weight Matching Dispatching Scheme in Buffered Clos-Network Packet Switches, Proc. ICC 2004, Paris, France, 2004, pp. 830-844.
• [13] Tamir Y., Frazier G., High performance multi-queue buffers for VLSI communications switches, Proc. Computer Architecture, Honolulu, Hawaii, United States, 1988, pp. 343-354.
• [14] Yoshigoe K., Christensen K.J., An evolution to crossbar switches with virtual ouptul queuing and buffered cross points, IEEE Network, Vol. 17, No. 5, 2003, pp. 48-56.