Frame-based matching algorithms for input-queued switches

IEEE International Conference on High Performance Switching and Routing, HPSR

Volumn , Issue , 2002, Pages 69-76

  Bianco, A ^a   Franceschinis, M ^a   Ghisolfi, S ^a   Hill, A M ^b   Leonardi, E ^a   Neri, F ^a   Webb, R ^b  

^a POLITECNICO DI TORINO   (Italy)

^b MARTLESHAM HEATH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; MERGING;

CONTROL STRATEGIES; FRAME-BASED; HEURISTIC APPROXIMATIONS; INPUT QUEUED SWITCH; MATCHING ALGORITHM; SIZE MATCHING;

APPROXIMATION ALGORITHMS;

EID: 0141524328     PISSN: 23255595     EISSN: 23255609     Source Type: Conference Proceeding    
DOI: 10.1109/HPSR.2002.1024211     Document Type: Conference Paper

References (18)

1. Ajmone Marsan M., Bianco A., Filippi E., Giaccone P., Leonardi E., Neri R, "On the behavior of input queuing switch architectures", Eu ropean Transact, on Telecommunications, vol. 10, n. 2, Mar. 1999, pp. 111-124
2. Awdeh Ra'ed Y, Mouftah H.T., "Survey of ATM switch architectures", Computer Networks & ISDN Systems, vol. 27, 1995, pp. 1567-1613
3. Parekh A.K., Gallager R.G., "A generalized processor sharing approach to flow control in integrated services networks", IEEE/ACM Transactions on Networking, vol.1, n.3, June 1993, p.344-357
4. Zhang H., "Service disciplines for guaranteed performance service in packet-switching networks", Proceedings of the IEEE, vol.83, n.10, Oct.1995, p.1374-1399
5. Dai J.D., Prabhakar B., "The throughput of data switches with and without speedup", IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000
6. Ajmone Marsan M., Leonardi E., Mellia M., Neri R, "On the Stability of Input-Buffer Cell Switches with Speed-Up", IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000
7. Ajmone Marsan M., Bianco A., Giaccone P., Leonardi E., Neri R, "On the Throughput in Input-Queued Cell-Based Switches with Multicast Traffic", IEEE INFOCOM 2001, Anchorage, Alaska, Apr. 2001
8. Even S., Kariv O., "An 0(n2'5) algorithm for maximum matching in general graphs", 16th Symp. on Foundations of Computer Science, Un. of California at Berkeley, Oct. 1975, pp. 100-112
9. Tarjan R.E., Data structures and network algorithms, Society for Industrial and Applied Mathematics, Pennsylvania, Nov. 1983
10. McKeown N., Mekkittikul A., Anantharam V., Walrand J., "Achieving 100% throughput in an input-queued switch", IEEE Trans, on Communications, vol. 47, n. 8, Aug. 1999, pp. 1260-1267
11. Hill A.M., "Frame-Based Scheduling Algorithms for Best-Effort Cell or Packet Switching", British Telecom, Network Foresight Project (BT Project 251MN), 1999
12. Hill A.M., "Parallel and Sequential Path-Searching Algorithms for the 3-Stage Circuit Switch", British Telecom, Network Foresight Project (BT Project 251MN), 1999
13. Hui J.Y, Switching and Traffic Theory for Integrated Broadband Networks, Kluwer Academic Press, 1990
14. Hill A.M., Webb R., "Frame-Based Matching and Scheduling Algorithms for Cell and Packet Switching", confidential paper draft, British Telecom Advanced Communications Research, 2000
15. Lee T.T., Liew S.-Y, "Parallel Routing Algorithms in Benes-Clos Networks", IEEE INFOCOM 1996, San Francisco, CA, Mar. 1996
16. Ajmone Marsan M., Bianco A., Leonardi E., Meo M., Neri R, "MAC Protocols and Fairness Control in WDM Multi-Rings with Tunable Transmitters and Fixed Receivers", IEEE/OSA Journal on Lightwave Technology, vol. 14, n. 6, pp. 1230-1244, June 1996
17. Ajmone Marsan M., Bianco A., Leonardi E., Morabito A., Neri R, "All-Optical WDM Multi-Rings with Differentiated QoS", IEEE Communications Magazine, vol. 37, n. 2, pp. 58-66, Febr. 1999
18. L. Tassiulas, "Linear Complexity Algorithms for Maximum Trhoughput in Radio Networks and Input-Queued Switches", IEEE INFOCOM '98, vol. 2, pp. 533-539, San Francisco, CA, 1998